./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci05-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci05-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7348520f04d4d9b10e62396a3389d8f9a2f3fbd69eb8f1a8953214a9bb54eb76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:28:02,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:28:02,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:28:02,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:28:02,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:28:02,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:28:02,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:28:02,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:28:02,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:28:02,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:28:02,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:28:02,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:28:02,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:28:02,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:28:02,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:28:02,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:02,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:28:02,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:28:02,812 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 -> 7348520f04d4d9b10e62396a3389d8f9a2f3fbd69eb8f1a8953214a9bb54eb76 [2025-03-04 11:28:03,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:28:03,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:28:03,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:28:03,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:28:03,039 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:28:03,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05-overflow.c [2025-03-04 11:28:04,189 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee50c7a1/2b88d3f9d5ac4cac9106309ad20ee4da/FLAG76888c7ad [2025-03-04 11:28:04,392 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:28:04,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05-overflow.c [2025-03-04 11:28:04,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee50c7a1/2b88d3f9d5ac4cac9106309ad20ee4da/FLAG76888c7ad [2025-03-04 11:28:04,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee50c7a1/2b88d3f9d5ac4cac9106309ad20ee4da [2025-03-04 11:28:04,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:28:04,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:28:04,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:04,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:28:04,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:28:04,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468822e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04, skipping insertion in model container [2025-03-04 11:28:04,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:28:04,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:04,531 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:28:04,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:04,548 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:28:04,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04 WrapperNode [2025-03-04 11:28:04,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:04,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:04,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:28:04,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:28:04,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,568 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 24 [2025-03-04 11:28:04,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:04,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:28:04,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:28:04,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:28:04,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,587 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:28:04,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,592 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:28:04,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:28:04,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:28:04,597 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:28:04,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (1/1) ... [2025-03-04 11:28:04,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:04,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:04,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:28:04,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:28:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-04 11:28:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-04 11:28:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:28:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:28:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:28:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:28:04,687 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:28:04,688 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:28:04,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-03-04 11:28:04,793 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 11:28:04,793 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:28:04,799 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:28:04,799 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:28:04,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:04 BoogieIcfgContainer [2025-03-04 11:28:04,800 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:28:04,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:28:04,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:28:04,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:28:04,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:28:04" (1/3) ... [2025-03-04 11:28:04,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70842d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:04, skipping insertion in model container [2025-03-04 11:28:04,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:04" (2/3) ... [2025-03-04 11:28:04,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70842d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:04, skipping insertion in model container [2025-03-04 11:28:04,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:04" (3/3) ... [2025-03-04 11:28:04,810 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci05-overflow.c [2025-03-04 11:28:04,821 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:28:04,823 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci05-overflow.c that has 2 procedures, 31 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 11:28:04,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:28:04,875 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;@1c82c7ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:28:04,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:28:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:28:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:28:04,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:04,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:04,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:04,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1001399972, now seen corresponding path program 1 times [2025-03-04 11:28:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:04,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272025980] [2025-03-04 11:28:04,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:04,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:28:04,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:28:04,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:04,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:04,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:04,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272025980] [2025-03-04 11:28:04,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272025980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:04,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:04,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:28:05,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266451266] [2025-03-04 11:28:05,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:05,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:28:05,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:05,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:28:05,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:05,015 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:05,045 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-03-04 11:28:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:28:05,047 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-04 11:28:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:05,050 INFO L225 Difference]: With dead ends: 36 [2025-03-04 11:28:05,051 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 11:28:05,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:05,054 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-04 11:28:05,054 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-04 11:28:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 11:28:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-04 11:28:05,072 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-04 11:28:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-04 11:28:05,078 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-03-04 11:28:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:05,078 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 11:28:05,078 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-04 11:28:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-04 11:28:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:28:05,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:05,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:05,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:28:05,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:05,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:05,080 INFO L85 PathProgramCache]: Analyzing trace with hash 978628045, now seen corresponding path program 1 times [2025-03-04 11:28:05,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:05,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891786885] [2025-03-04 11:28:05,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:05,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:05,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:28:05,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:28:05,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:05,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891786885] [2025-03-04 11:28:05,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891786885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:05,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:05,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385964733] [2025-03-04 11:28:05,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:05,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:05,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:05,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:05,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:05,137 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-04 11:28:05,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:05,195 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-04 11:28:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:05,195 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-04 11:28:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:05,196 INFO L225 Difference]: With dead ends: 24 [2025-03-04 11:28:05,196 INFO L226 Difference]: Without dead ends: 22 [2025-03-04 11:28:05,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:05,196 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:05,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-04 11:28:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-04 11:28:05,199 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-04 11:28:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-04 11:28:05,200 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2025-03-04 11:28:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:05,200 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-04 11:28:05,200 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-04 11:28:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-04 11:28:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:28:05,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:05,200 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-04 11:28:05,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:28:05,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:05,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:05,201 INFO L85 PathProgramCache]: Analyzing trace with hash -989645326, now seen corresponding path program 1 times [2025-03-04 11:28:05,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:05,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821800760] [2025-03-04 11:28:05,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:05,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:05,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:28:05,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:28:05,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:05,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:05,337 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-04 11:28:05,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:05,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821800760] [2025-03-04 11:28:05,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821800760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:05,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:05,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:05,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261911232] [2025-03-04 11:28:05,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:05,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:05,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:05,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:05,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:05,342 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-04 11:28:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:05,377 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-03-04 11:28:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:05,379 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-04 11:28:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:05,379 INFO L225 Difference]: With dead ends: 34 [2025-03-04 11:28:05,379 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 11:28:05,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:05,381 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:05,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 11:28:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-04 11:28:05,386 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-04 11:28:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-04 11:28:05,387 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 29 [2025-03-04 11:28:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:05,387 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 11:28:05,387 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-04 11:28:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-04 11:28:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:28:05,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:05,388 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:05,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:28:05,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:05,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1650141125, now seen corresponding path program 1 times [2025-03-04 11:28:05,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:05,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610507103] [2025-03-04 11:28:05,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:05,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:05,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:28:05,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:28:05,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:05,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:28:05,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610507103] [2025-03-04 11:28:05,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610507103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345390265] [2025-03-04 11:28:05,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:05,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:05,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:05,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:05,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:28:05,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:28:05,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:28:05,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:05,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:05,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:05,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:05,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 11:28:05,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 11:28:05,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345390265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:05,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:05,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-04 11:28:05,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20695377] [2025-03-04 11:28:05,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:05,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:28:05,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:05,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:28:05,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:28:05,796 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-04 11:28:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:06,012 INFO L93 Difference]: Finished difference Result 90 states and 128 transitions. [2025-03-04 11:28:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:28:06,013 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2025-03-04 11:28:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:06,014 INFO L225 Difference]: With dead ends: 90 [2025-03-04 11:28:06,014 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 11:28:06,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:28:06,016 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:06,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 94 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 11:28:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2025-03-04 11:28:06,025 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-04 11:28:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2025-03-04 11:28:06,026 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 24 [2025-03-04 11:28:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:06,026 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2025-03-04 11:28:06,026 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-04 11:28:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2025-03-04 11:28:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:28:06,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:06,030 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:06,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:06,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:06,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:06,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:06,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1771203833, now seen corresponding path program 2 times [2025-03-04 11:28:06,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:06,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606944775] [2025-03-04 11:28:06,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:06,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 11:28:06,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:28:06,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:06,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:28:06,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:06,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606944775] [2025-03-04 11:28:06,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606944775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:06,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115557111] [2025-03-04 11:28:06,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:06,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:06,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:06,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:06,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:28:06,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 11:28:06,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:28:06,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:06,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:06,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:28:06,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:28:06,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:06,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115557111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:06,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:06,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 11:28:06,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935406909] [2025-03-04 11:28:06,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:06,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:06,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:06,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:06,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:28:06,368 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-04 11:28:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:06,391 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2025-03-04 11:28:06,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:06,392 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-04 11:28:06,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:06,392 INFO L225 Difference]: With dead ends: 59 [2025-03-04 11:28:06,392 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 11:28:06,393 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-04 11:28:06,393 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-04 11:28:06,393 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-04 11:28:06,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 11:28:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-04 11:28:06,400 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-04 11:28:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2025-03-04 11:28:06,401 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 24 [2025-03-04 11:28:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:06,401 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-04 11:28:06,401 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-04 11:28:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2025-03-04 11:28:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:28:06,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:06,402 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:06,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:06,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:06,603 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:06,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash -591075408, now seen corresponding path program 1 times [2025-03-04 11:28:06,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:06,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846167039] [2025-03-04 11:28:06,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:06,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:06,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:28:06,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:28:06,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:06,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:28:06,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:06,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846167039] [2025-03-04 11:28:06,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846167039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:06,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467185608] [2025-03-04 11:28:06,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:06,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:06,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:06,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:06,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:28:06,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:28:06,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:28:06,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:06,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:06,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:06,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:28:06,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:06,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467185608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:06,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:06,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 11:28:06,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631208418] [2025-03-04 11:28:06,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:06,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:28:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:06,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:28:06,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:28:06,735 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-04 11:28:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:06,763 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2025-03-04 11:28:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:06,763 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 31 [2025-03-04 11:28:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:06,764 INFO L225 Difference]: With dead ends: 81 [2025-03-04 11:28:06,764 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 11:28:06,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:28:06,765 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:06,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 11:28:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2025-03-04 11:28:06,774 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-04 11:28:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-04 11:28:06,775 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 31 [2025-03-04 11:28:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:06,775 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-04 11:28:06,775 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-04 11:28:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-03-04 11:28:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:28:06,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:06,776 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:06,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:06,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:06,980 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:06,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:06,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1033276172, now seen corresponding path program 1 times [2025-03-04 11:28:06,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:06,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967104225] [2025-03-04 11:28:06,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:06,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:06,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:28:06,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:28:06,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:06,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:28:07,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:07,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967104225] [2025-03-04 11:28:07,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967104225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:07,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397557257] [2025-03-04 11:28:07,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:07,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:07,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:07,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:07,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:28:07,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:28:07,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:28:07,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:07,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:07,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:28:07,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-04 11:28:07,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 11:28:07,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397557257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:07,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:07,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-04 11:28:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119816556] [2025-03-04 11:28:07,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:07,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:28:07,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:07,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:28:07,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:28:07,420 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-04 11:28:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:07,592 INFO L93 Difference]: Finished difference Result 140 states and 216 transitions. [2025-03-04 11:28:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:28:07,593 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 45 [2025-03-04 11:28:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:07,595 INFO L225 Difference]: With dead ends: 140 [2025-03-04 11:28:07,596 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 11:28:07,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:28:07,597 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:07,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 183 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 11:28:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 97. [2025-03-04 11:28:07,618 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-04 11:28:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 158 transitions. [2025-03-04 11:28:07,619 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 158 transitions. Word has length 45 [2025-03-04 11:28:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:07,620 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 158 transitions. [2025-03-04 11:28:07,620 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-04 11:28:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 158 transitions. [2025-03-04 11:28:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 11:28:07,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:07,622 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 11:28:07,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:28:07,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:07,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:07,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1306687898, now seen corresponding path program 1 times [2025-03-04 11:28:07,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:07,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160130442] [2025-03-04 11:28:07,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:07,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:07,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 11:28:07,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 11:28:07,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:07,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 38 proven. 86 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-04 11:28:07,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160130442] [2025-03-04 11:28:07,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160130442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:07,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940304205] [2025-03-04 11:28:07,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:07,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:07,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:07,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:07,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:28:08,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 11:28:08,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 11:28:08,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:08,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:08,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:28:08,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 50 proven. 92 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 11:28:08,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 50 proven. 95 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 11:28:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940304205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:08,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 16 [2025-03-04 11:28:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556454955] [2025-03-04 11:28:08,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:08,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:28:08,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:08,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:28:08,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:28:08,366 INFO L87 Difference]: Start difference. First operand 97 states and 158 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-04 11:28:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:08,519 INFO L93 Difference]: Finished difference Result 173 states and 298 transitions. [2025-03-04 11:28:08,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:28:08,520 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Word has length 83 [2025-03-04 11:28:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:08,521 INFO L225 Difference]: With dead ends: 173 [2025-03-04 11:28:08,521 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 11:28:08,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 158 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:08,526 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 118 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:08,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 62 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 11:28:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2025-03-04 11:28:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 52 states have internal predecessors, (60), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 11:28:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2025-03-04 11:28:08,536 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 83 [2025-03-04 11:28:08,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:08,536 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2025-03-04 11:28:08,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-04 11:28:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2025-03-04 11:28:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 11:28:08,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:08,540 INFO L218 NwaCegarLoop]: trace histogram [19, 17, 13, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 4, 1, 1, 1, 1] [2025-03-04 11:28:08,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:28:08,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:08,741 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:08,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:08,742 INFO L85 PathProgramCache]: Analyzing trace with hash 291534894, now seen corresponding path program 2 times [2025-03-04 11:28:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502126028] [2025-03-04 11:28:08,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:08,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-04 11:28:08,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 11:28:08,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:08,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 94 proven. 278 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-04 11:28:08,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:08,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502126028] [2025-03-04 11:28:08,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502126028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:08,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089315844] [2025-03-04 11:28:08,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:08,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:08,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:08,911 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:08,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:28:08,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-04 11:28:08,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 11:28:08,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:08,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:08,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:28:08,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 449 proven. 15 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2025-03-04 11:28:09,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 95 proven. 328 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-03-04 11:28:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089315844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:09,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:09,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-03-04 11:28:09,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313955908] [2025-03-04 11:28:09,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:09,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:28:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:09,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:28:09,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:28:09,310 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:28:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:09,386 INFO L93 Difference]: Finished difference Result 128 states and 178 transitions. [2025-03-04 11:28:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:28:09,387 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 174 [2025-03-04 11:28:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:09,388 INFO L225 Difference]: With dead ends: 128 [2025-03-04 11:28:09,389 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 11:28:09,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 340 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:28:09,392 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:09,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 63 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 11:28:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2025-03-04 11:28:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 45 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (14), 10 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 11:28:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2025-03-04 11:28:09,397 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 174 [2025-03-04 11:28:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:09,397 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2025-03-04 11:28:09,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:28:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2025-03-04 11:28:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 11:28:09,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:09,398 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1] [2025-03-04 11:28:09,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:09,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:09,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:09,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1797592140, now seen corresponding path program 3 times [2025-03-04 11:28:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221299412] [2025-03-04 11:28:09,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:09,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 103 statements into 10 equivalence classes. [2025-03-04 11:28:09,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 70 of 103 statements. [2025-03-04 11:28:09,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 11:28:09,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 100 proven. 25 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-04 11:28:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221299412] [2025-03-04 11:28:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221299412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242895250] [2025-03-04 11:28:09,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:09,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:09,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:09,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:09,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:28:09,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 103 statements into 10 equivalence classes. [2025-03-04 11:28:09,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 70 of 103 statements. [2025-03-04 11:28:09,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 11:28:09,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:09,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:28:09,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-04 11:28:09,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-04 11:28:10,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242895250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:10,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:10,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2025-03-04 11:28:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296686717] [2025-03-04 11:28:10,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:10,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:28:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:10,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:28:10,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:28:10,214 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 12 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:28:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:10,282 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2025-03-04 11:28:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:28:10,283 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 12 states have call predecessors, (13), 5 states have call successors, (13) Word has length 103 [2025-03-04 11:28:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:10,283 INFO L225 Difference]: With dead ends: 63 [2025-03-04 11:28:10,283 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 11:28:10,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 191 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:28:10,284 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:10,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 127 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:10,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 11:28:10,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2025-03-04 11:28:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (14), 8 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 11:28:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-03-04 11:28:10,292 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 103 [2025-03-04 11:28:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:10,292 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-03-04 11:28:10,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 12 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:28:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-03-04 11:28:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 11:28:10,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:10,293 INFO L218 NwaCegarLoop]: trace histogram [18, 15, 15, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 3, 1, 1, 1, 1] [2025-03-04 11:28:10,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:28:10,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:10,494 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:10,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2131406242, now seen corresponding path program 2 times [2025-03-04 11:28:10,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:10,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803951928] [2025-03-04 11:28:10,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:10,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:10,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-03-04 11:28:10,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 11:28:10,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:10,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 120 proven. 355 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-03-04 11:28:10,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803951928] [2025-03-04 11:28:10,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803951928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684897723] [2025-03-04 11:28:10,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:10,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:10,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:10,699 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:10,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:28:10,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-03-04 11:28:10,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 11:28:10,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:10,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:10,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:28:10,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 515 proven. 189 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 11:28:10,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 141 proven. 410 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-04 11:28:11,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684897723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:11,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:11,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 19 [2025-03-04 11:28:11,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229077538] [2025-03-04 11:28:11,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:11,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:28:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:11,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:28:11,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:28:11,241 INFO L87 Difference]: Start difference. First operand 55 states and 66 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-04 11:28:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:11,450 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2025-03-04 11:28:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:28:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) Word has length 164 [2025-03-04 11:28:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:11,452 INFO L225 Difference]: With dead ends: 135 [2025-03-04 11:28:11,453 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 11:28:11,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 319 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-04 11:28:11,454 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 151 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:11,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 77 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:11,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 11:28:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2025-03-04 11:28:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 56 states have internal predecessors, (63), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (17), 11 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-04 11:28:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2025-03-04 11:28:11,463 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 164 [2025-03-04 11:28:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:11,464 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2025-03-04 11:28:11,464 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-04 11:28:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2025-03-04 11:28:11,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 11:28:11,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:11,464 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2025-03-04 11:28:11,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:11,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:28:11,668 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:11,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1623830502, now seen corresponding path program 3 times [2025-03-04 11:28:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:11,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052915594] [2025-03-04 11:28:11,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:11,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 8 equivalence classes. [2025-03-04 11:28:11,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 79 of 91 statements. [2025-03-04 11:28:11,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:28:11,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 102 proven. 38 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-04 11:28:11,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:11,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052915594] [2025-03-04 11:28:11,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052915594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:11,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223749552] [2025-03-04 11:28:11,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:11,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:11,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:11,758 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:11,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:28:11,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 8 equivalence classes. [2025-03-04 11:28:11,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 79 of 91 statements. [2025-03-04 11:28:11,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:28:11,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:11,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:28:11,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:28:11,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 11:28:12,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223749552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:12,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:12,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2025-03-04 11:28:12,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113333950] [2025-03-04 11:28:12,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:12,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 11:28:12,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:12,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 11:28:12,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:28:12,568 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 30 states, 30 states have (on average 3.3) internal successors, (99), 30 states have internal predecessors, (99), 10 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (22), 19 states have call predecessors, (22), 10 states have call successors, (22) [2025-03-04 11:28:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:13,146 INFO L93 Difference]: Finished difference Result 192 states and 278 transitions. [2025-03-04 11:28:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 11:28:13,146 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.3) internal successors, (99), 30 states have internal predecessors, (99), 10 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (22), 19 states have call predecessors, (22), 10 states have call successors, (22) Word has length 91 [2025-03-04 11:28:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:13,148 INFO L225 Difference]: With dead ends: 192 [2025-03-04 11:28:13,148 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 11:28:13,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=597, Invalid=2709, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 11:28:13,149 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 166 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:13,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 122 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 11:28:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 97. [2025-03-04 11:28:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 75 states have internal predecessors, (80), 11 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (47), 16 states have call predecessors, (47), 10 states have call successors, (47) [2025-03-04 11:28:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2025-03-04 11:28:13,164 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 91 [2025-03-04 11:28:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:13,164 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2025-03-04 11:28:13,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.3) internal successors, (99), 30 states have internal predecessors, (99), 10 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (22), 19 states have call predecessors, (22), 10 states have call successors, (22) [2025-03-04 11:28:13,164 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2025-03-04 11:28:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-04 11:28:13,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:13,168 INFO L218 NwaCegarLoop]: trace histogram [33, 32, 26, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 10, 7, 1, 1, 1, 1] [2025-03-04 11:28:13,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 11:28:13,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:13,371 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:13,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2017069360, now seen corresponding path program 4 times [2025-03-04 11:28:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:13,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327220779] [2025-03-04 11:28:13,372 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:13,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:13,383 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 319 statements into 2 equivalence classes. [2025-03-04 11:28:13,397 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 189 of 319 statements. [2025-03-04 11:28:13,398 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:13,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3573 backedges. 377 proven. 976 refuted. 0 times theorem prover too weak. 2220 trivial. 0 not checked. [2025-03-04 11:28:13,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:13,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327220779] [2025-03-04 11:28:13,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327220779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:13,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105300489] [2025-03-04 11:28:13,596 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:13,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:13,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:13,598 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:13,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:28:13,647 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 319 statements into 2 equivalence classes. [2025-03-04 11:28:13,674 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 189 of 319 statements. [2025-03-04 11:28:13,675 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:13,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:13,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:28:13,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3573 backedges. 359 proven. 1338 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2025-03-04 11:28:13,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3573 backedges. 359 proven. 1377 refuted. 0 times theorem prover too weak. 1837 trivial. 0 not checked. [2025-03-04 11:28:14,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105300489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:14,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:14,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 24 [2025-03-04 11:28:14,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782797768] [2025-03-04 11:28:14,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:14,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:28:14,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:14,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:28:14,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:14,679 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 12 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 11:28:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:14,954 INFO L93 Difference]: Finished difference Result 247 states and 397 transitions. [2025-03-04 11:28:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 11:28:14,955 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 12 states have call predecessors, (28), 18 states have call successors, (28) Word has length 319 [2025-03-04 11:28:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:14,956 INFO L225 Difference]: With dead ends: 247 [2025-03-04 11:28:14,956 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 11:28:14,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 625 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 11:28:14,959 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 253 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:14,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 121 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 11:28:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 139. [2025-03-04 11:28:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 111 states have (on average 1.045045045045045) internal successors, (116), 107 states have internal predecessors, (116), 15 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (57), 23 states have call predecessors, (57), 14 states have call successors, (57) [2025-03-04 11:28:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2025-03-04 11:28:14,972 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 319 [2025-03-04 11:28:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:14,973 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2025-03-04 11:28:14,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 12 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 11:28:14,973 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2025-03-04 11:28:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-04 11:28:14,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:14,975 INFO L218 NwaCegarLoop]: trace histogram [36, 34, 29, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 16, 11, 7, 1, 1, 1, 1] [2025-03-04 11:28:14,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:15,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:28:15,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:15,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash 585046834, now seen corresponding path program 5 times [2025-03-04 11:28:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:15,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922067944] [2025-03-04 11:28:15,176 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:15,188 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 345 statements into 27 equivalence classes. [2025-03-04 11:28:15,203 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 197 of 345 statements. [2025-03-04 11:28:15,203 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-04 11:28:15,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4199 backedges. 734 proven. 1144 refuted. 0 times theorem prover too weak. 2321 trivial. 0 not checked. [2025-03-04 11:28:15,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922067944] [2025-03-04 11:28:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922067944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946081364] [2025-03-04 11:28:15,432 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:15,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:15,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:15,435 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:15,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:28:15,484 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 345 statements into 27 equivalence classes. [2025-03-04 11:28:15,519 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 197 of 345 statements. [2025-03-04 11:28:15,520 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-04 11:28:15,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:15,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 11:28:15,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4199 backedges. 740 proven. 1135 refuted. 0 times theorem prover too weak. 2324 trivial. 0 not checked. [2025-03-04 11:28:15,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4199 backedges. 737 proven. 1177 refuted. 0 times theorem prover too weak. 2285 trivial. 0 not checked. [2025-03-04 11:28:16,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946081364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:16,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:16,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 20] total 26 [2025-03-04 11:28:16,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164627260] [2025-03-04 11:28:16,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:16,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:28:16,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:16,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:28:16,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:28:16,608 INFO L87 Difference]: Start difference. First operand 139 states and 188 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 17 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 13 states have call predecessors, (27), 17 states have call successors, (27) [2025-03-04 11:28:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:16,923 INFO L93 Difference]: Finished difference Result 278 states and 427 transitions. [2025-03-04 11:28:16,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:28:16,924 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), 17 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 13 states have call predecessors, (27), 17 states have call successors, (27) Word has length 345 [2025-03-04 11:28:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:16,925 INFO L225 Difference]: With dead ends: 278 [2025-03-04 11:28:16,925 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 11:28:16,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 679 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=519, Invalid=1373, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 11:28:16,928 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 254 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:16,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 121 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 11:28:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2025-03-04 11:28:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 98 states have (on average 1.0510204081632653) internal successors, (103), 94 states have internal predecessors, (103), 14 states have call successors, (14), 11 states have call predecessors, (14), 8 states have return successors, (32), 15 states have call predecessors, (32), 13 states have call successors, (32) [2025-03-04 11:28:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 149 transitions. [2025-03-04 11:28:16,937 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 149 transitions. Word has length 345 [2025-03-04 11:28:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:16,938 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 149 transitions. [2025-03-04 11:28:16,938 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), 17 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 13 states have call predecessors, (27), 17 states have call successors, (27) [2025-03-04 11:28:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2025-03-04 11:28:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-04 11:28:16,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:16,940 INFO L218 NwaCegarLoop]: trace histogram [28, 26, 23, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 9, 5, 1, 1, 1, 1] [2025-03-04 11:28:16,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:28:17,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:28:17,146 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:17,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:17,147 INFO L85 PathProgramCache]: Analyzing trace with hash 303395512, now seen corresponding path program 6 times [2025-03-04 11:28:17,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:17,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201849338] [2025-03-04 11:28:17,147 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:28:17,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:17,153 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 267 statements into 20 equivalence classes. [2025-03-04 11:28:17,178 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 190 of 267 statements. [2025-03-04 11:28:17,178 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-03-04 11:28:17,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2478 backedges. 526 proven. 695 refuted. 0 times theorem prover too weak. 1257 trivial. 0 not checked. [2025-03-04 11:28:17,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:17,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201849338] [2025-03-04 11:28:17,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201849338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:17,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424980062] [2025-03-04 11:28:17,390 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:28:17,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:17,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:17,392 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:17,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:28:17,448 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 267 statements into 20 equivalence classes. [2025-03-04 11:28:17,485 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 190 of 267 statements. [2025-03-04 11:28:17,485 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-03-04 11:28:17,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:17,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:28:17,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2478 backedges. 519 proven. 734 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-04 11:28:17,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2478 backedges. 515 proven. 786 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2025-03-04 11:28:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424980062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:18,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:18,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 18] total 26 [2025-03-04 11:28:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701994245] [2025-03-04 11:28:18,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:18,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:28:18,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:18,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:28:18,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:28:18,567 INFO L87 Difference]: Start difference. First operand 121 states and 149 transitions. Second operand has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 26 states have internal predecessors, (141), 19 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (30), 14 states have call predecessors, (30), 19 states have call successors, (30) [2025-03-04 11:28:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:18,789 INFO L93 Difference]: Finished difference Result 245 states and 326 transitions. [2025-03-04 11:28:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:28:18,789 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 26 states have internal predecessors, (141), 19 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (30), 14 states have call predecessors, (30), 19 states have call successors, (30) Word has length 267 [2025-03-04 11:28:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:18,790 INFO L225 Difference]: With dead ends: 245 [2025-03-04 11:28:18,790 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 11:28:18,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 518 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 11:28:18,792 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 92 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:18,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 195 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 11:28:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-03-04 11:28:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 100 states have internal predecessors, (107), 16 states have call successors, (16), 14 states have call predecessors, (16), 7 states have return successors, (30), 12 states have call predecessors, (30), 15 states have call successors, (30) [2025-03-04 11:28:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2025-03-04 11:28:18,798 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 267 [2025-03-04 11:28:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:18,798 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2025-03-04 11:28:18,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 26 states have internal predecessors, (141), 19 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (30), 14 states have call predecessors, (30), 19 states have call successors, (30) [2025-03-04 11:28:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2025-03-04 11:28:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-04 11:28:18,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:18,800 INFO L218 NwaCegarLoop]: trace histogram [52, 50, 42, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 24, 16, 10, 1, 1, 1, 1] [2025-03-04 11:28:18,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:19,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:28:19,001 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:19,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:19,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2064975301, now seen corresponding path program 7 times [2025-03-04 11:28:19,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:19,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251914283] [2025-03-04 11:28:19,001 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:28:19,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:19,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-04 11:28:19,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-04 11:28:19,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:19,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9038 backedges. 1125 proven. 2452 refuted. 0 times theorem prover too weak. 5461 trivial. 0 not checked. [2025-03-04 11:28:19,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:19,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251914283] [2025-03-04 11:28:19,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251914283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:19,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220902033] [2025-03-04 11:28:19,548 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:28:19,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:19,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:19,550 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:19,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:28:19,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-04 11:28:19,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-04 11:28:19,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:19,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:19,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 11:28:19,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9038 backedges. 1330 proven. 2649 refuted. 0 times theorem prover too weak. 5059 trivial. 0 not checked. [2025-03-04 11:28:19,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9038 backedges. 1330 proven. 2764 refuted. 0 times theorem prover too weak. 4944 trivial. 0 not checked. [2025-03-04 11:28:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220902033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:21,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:21,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 27] total 32 [2025-03-04 11:28:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650920591] [2025-03-04 11:28:21,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:21,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 11:28:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:21,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 11:28:21,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:28:21,626 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 32 states, 32 states have (on average 5.40625) internal successors, (173), 32 states have internal predecessors, (173), 25 states have call successors, (29), 1 states have call predecessors, (29), 13 states have return successors, (38), 15 states have call predecessors, (38), 25 states have call successors, (38) [2025-03-04 11:28:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:22,042 INFO L93 Difference]: Finished difference Result 288 states and 373 transitions. [2025-03-04 11:28:22,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 11:28:22,043 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.40625) internal successors, (173), 32 states have internal predecessors, (173), 25 states have call successors, (29), 1 states have call predecessors, (29), 13 states have return successors, (38), 15 states have call predecessors, (38), 25 states have call successors, (38) Word has length 502 [2025-03-04 11:28:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:22,045 INFO L225 Difference]: With dead ends: 288 [2025-03-04 11:28:22,045 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 11:28:22,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 986 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=824, Invalid=2482, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 11:28:22,047 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 524 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:22,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 186 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:22,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 11:28:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 124. [2025-03-04 11:28:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 98 states have internal predecessors, (102), 16 states have call successors, (16), 12 states have call predecessors, (16), 8 states have return successors, (35), 13 states have call predecessors, (35), 15 states have call successors, (35) [2025-03-04 11:28:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2025-03-04 11:28:22,054 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 502 [2025-03-04 11:28:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:22,055 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2025-03-04 11:28:22,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.40625) internal successors, (173), 32 states have internal predecessors, (173), 25 states have call successors, (29), 1 states have call predecessors, (29), 13 states have return successors, (38), 15 states have call predecessors, (38), 25 states have call successors, (38) [2025-03-04 11:28:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2025-03-04 11:28:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-04 11:28:22,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:22,057 INFO L218 NwaCegarLoop]: trace histogram [41, 40, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1, 1] [2025-03-04 11:28:22,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:22,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:28:22,258 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:22,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash -929567143, now seen corresponding path program 8 times [2025-03-04 11:28:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:22,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443199094] [2025-03-04 11:28:22,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:22,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:22,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-03-04 11:28:22,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-03-04 11:28:22,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:22,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 830 proven. 1470 refuted. 0 times theorem prover too weak. 3328 trivial. 0 not checked. [2025-03-04 11:28:23,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:23,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443199094] [2025-03-04 11:28:23,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443199094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:23,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178735180] [2025-03-04 11:28:23,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:23,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:23,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:23,642 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:23,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:28:23,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-03-04 11:28:23,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-03-04 11:28:23,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:23,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:23,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-04 11:28:23,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 3696 trivial. 0 not checked. [2025-03-04 11:28:24,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3464 trivial. 0 not checked. [2025-03-04 11:28:28,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178735180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:28,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:28,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 29] total 45 [2025-03-04 11:28:28,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634969707] [2025-03-04 11:28:28,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:28,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 11:28:28,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:28,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 11:28:28,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1607, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 11:28:28,881 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand has 46 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 46 states have internal predecessors, (118), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (31), 31 states have call predecessors, (31), 12 states have call successors, (31) [2025-03-04 11:28:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:29,008 INFO L93 Difference]: Finished difference Result 155 states and 207 transitions. [2025-03-04 11:28:29,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 11:28:29,008 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 46 states have internal predecessors, (118), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (31), 31 states have call predecessors, (31), 12 states have call successors, (31) Word has length 398 [2025-03-04 11:28:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:29,010 INFO L225 Difference]: With dead ends: 155 [2025-03-04 11:28:29,010 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 11:28:29,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 780 SyntacticMatches, 51 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2454 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=544, Invalid=1906, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 11:28:29,011 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:29,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 141 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 11:28:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 145. [2025-03-04 11:28:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 116 states have (on average 1.0258620689655173) internal successors, (119), 114 states have internal predecessors, (119), 18 states have call successors, (18), 12 states have call predecessors, (18), 10 states have return successors, (55), 18 states have call predecessors, (55), 17 states have call successors, (55) [2025-03-04 11:28:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 192 transitions. [2025-03-04 11:28:29,019 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 192 transitions. Word has length 398 [2025-03-04 11:28:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:29,019 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 192 transitions. [2025-03-04 11:28:29,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 46 states have internal predecessors, (118), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (31), 31 states have call predecessors, (31), 12 states have call successors, (31) [2025-03-04 11:28:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 192 transitions. [2025-03-04 11:28:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2025-03-04 11:28:29,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:29,026 INFO L218 NwaCegarLoop]: trace histogram [126, 123, 102, 63, 63, 63, 63, 62, 62, 62, 62, 62, 61, 61, 61, 60, 39, 24, 1, 1, 1, 1] [2025-03-04 11:28:29,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:28:29,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:29,230 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:29,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1953987503, now seen corresponding path program 9 times [2025-03-04 11:28:29,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:29,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445973051] [2025-03-04 11:28:29,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:29,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:29,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1223 statements into 98 equivalence classes. [2025-03-04 11:28:29,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) and asserted 832 of 1223 statements. [2025-03-04 11:28:29,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) [2025-03-04 11:28:29,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 54820 backedges. 16724 proven. 5858 refuted. 0 times theorem prover too weak. 32238 trivial. 0 not checked. [2025-03-04 11:28:36,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445973051] [2025-03-04 11:28:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445973051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122127095] [2025-03-04 11:28:36,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:36,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:36,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:36,164 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:36,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:28:36,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1223 statements into 98 equivalence classes. [2025-03-04 11:28:36,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) and asserted 832 of 1223 statements. [2025-03-04 11:28:36,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) [2025-03-04 11:28:36,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:36,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 1560 conjuncts, 165 conjuncts are in the unsatisfiable core [2025-03-04 11:28:36,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 54820 backedges. 16360 proven. 4596 refuted. 0 times theorem prover too weak. 33864 trivial. 0 not checked. [2025-03-04 11:28:37,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 54820 backedges. 17227 proven. 4261 refuted. 0 times theorem prover too weak. 33332 trivial. 0 not checked. [2025-03-04 11:28:54,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122127095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:54,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:54,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 38] total 52 [2025-03-04 11:28:54,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505956334] [2025-03-04 11:28:54,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:54,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-04 11:28:54,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:54,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-04 11:28:54,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=2149, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 11:28:54,827 INFO L87 Difference]: Start difference. First operand 145 states and 192 transitions. Second operand has 53 states, 52 states have (on average 2.769230769230769) internal successors, (144), 53 states have internal predecessors, (144), 14 states have call successors, (16), 1 states have call predecessors, (16), 16 states have return successors, (38), 37 states have call predecessors, (38), 14 states have call successors, (38) [2025-03-04 11:28:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:55,021 INFO L93 Difference]: Finished difference Result 203 states and 303 transitions. [2025-03-04 11:28:55,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 11:28:55,022 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.769230769230769) internal successors, (144), 53 states have internal predecessors, (144), 14 states have call successors, (16), 1 states have call predecessors, (16), 16 states have return successors, (38), 37 states have call predecessors, (38), 14 states have call successors, (38) Word has length 1223 [2025-03-04 11:28:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:55,025 INFO L225 Difference]: With dead ends: 203 [2025-03-04 11:28:55,025 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 11:28:55,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2617 GetRequests, 2415 SyntacticMatches, 143 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6257 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=784, Invalid=2876, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 11:28:55,027 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:55,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 244 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 11:28:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 163. [2025-03-04 11:28:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.023076923076923) internal successors, (133), 128 states have internal predecessors, (133), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (83), 22 states have call predecessors, (83), 19 states have call successors, (83) [2025-03-04 11:28:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 236 transitions. [2025-03-04 11:28:55,040 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 236 transitions. Word has length 1223 [2025-03-04 11:28:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:55,041 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 236 transitions. [2025-03-04 11:28:55,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.769230769230769) internal successors, (144), 53 states have internal predecessors, (144), 14 states have call successors, (16), 1 states have call predecessors, (16), 16 states have return successors, (38), 37 states have call predecessors, (38), 14 states have call successors, (38) [2025-03-04 11:28:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 236 transitions. [2025-03-04 11:28:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2025-03-04 11:28:55,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:55,050 INFO L218 NwaCegarLoop]: trace histogram [142, 140, 115, 71, 71, 71, 71, 70, 70, 70, 70, 70, 70, 70, 70, 69, 44, 27, 1, 1, 1, 1] [2025-03-04 11:28:55,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:28:55,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:28:55,250 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:55,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:55,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1887108380, now seen corresponding path program 10 times [2025-03-04 11:28:55,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:55,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832832123] [2025-03-04 11:28:55,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:55,275 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1385 statements into 2 equivalence classes. [2025-03-04 11:28:55,325 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 821 of 1385 statements. [2025-03-04 11:28:55,325 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:55,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 70397 backedges. 2835 proven. 10659 refuted. 0 times theorem prover too weak. 56903 trivial. 0 not checked. [2025-03-04 11:28:56,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:56,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832832123] [2025-03-04 11:28:56,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832832123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:56,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089898859] [2025-03-04 11:28:56,068 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:56,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:56,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:56,069 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:56,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:28:56,388 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1385 statements into 2 equivalence classes. [2025-03-04 11:28:56,492 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 821 of 1385 statements. [2025-03-04 11:28:56,492 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:56,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:56,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 1717 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 11:28:56,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 70397 backedges. 3362 proven. 12189 refuted. 0 times theorem prover too weak. 54846 trivial. 0 not checked. [2025-03-04 11:28:56,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 70397 backedges. 3362 proven. 12357 refuted. 0 times theorem prover too weak. 54678 trivial. 0 not checked. [2025-03-04 11:28:59,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089898859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:59,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:59,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 31] total 36 [2025-03-04 11:28:59,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272072271] [2025-03-04 11:28:59,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:59,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 11:28:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:59,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 11:28:59,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:28:59,779 INFO L87 Difference]: Start difference. First operand 163 states and 236 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-04 11:29:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:00,225 INFO L93 Difference]: Finished difference Result 394 states and 663 transitions. [2025-03-04 11:29:00,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 11:29:00,225 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 1385 [2025-03-04 11:29:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:00,227 INFO L225 Difference]: With dead ends: 394 [2025-03-04 11:29:00,227 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 11:29:00,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2831 GetRequests, 2751 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-04 11:29:00,230 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 339 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:00,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 225 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 11:29:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2025-03-04 11:29:00,241 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-04 11:29:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 317 transitions. [2025-03-04 11:29:00,242 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 317 transitions. Word has length 1385 [2025-03-04 11:29:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:00,243 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 317 transitions. [2025-03-04 11:29:00,243 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-04 11:29:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 317 transitions. [2025-03-04 11:29:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2356 [2025-03-04 11:29:00,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:00,264 INFO L218 NwaCegarLoop]: trace histogram [241, 239, 195, 120, 120, 120, 120, 120, 120, 120, 120, 120, 119, 119, 119, 118, 75, 46, 1, 1, 1, 1] [2025-03-04 11:29:00,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:00,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:00,465 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:00,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1428976553, now seen corresponding path program 11 times [2025-03-04 11:29:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:00,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412790370] [2025-03-04 11:29:00,466 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:00,514 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2355 statements into 176 equivalence classes. [2025-03-04 11:29:00,620 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) and asserted 1309 of 2355 statements. [2025-03-04 11:29:00,620 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2025-03-04 11:29:00,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 204680 backedges. 17723 proven. 15985 refuted. 0 times theorem prover too weak. 170972 trivial. 0 not checked. [2025-03-04 11:29:02,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:02,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412790370] [2025-03-04 11:29:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412790370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:02,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623731967] [2025-03-04 11:29:02,914 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:02,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:02,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:02,916 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:02,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:29:03,314 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2355 statements into 176 equivalence classes. [2025-03-04 11:29:03,615 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) and asserted 1309 of 2355 statements. [2025-03-04 11:29:03,615 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2025-03-04 11:29:03,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 2416 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 11:29:03,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 204680 backedges. 16224 proven. 15105 refuted. 0 times theorem prover too weak. 173351 trivial. 0 not checked. [2025-03-04 11:29:03,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 204680 backedges. 16224 proven. 15336 refuted. 0 times theorem prover too weak. 173120 trivial. 0 not checked. [2025-03-04 11:29:08,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623731967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:08,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:08,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 35] total 43 [2025-03-04 11:29:08,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520567353] [2025-03-04 11:29:08,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:08,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 11:29:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:08,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 11:29:08,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:29:08,952 INFO L87 Difference]: Start difference. First operand 220 states and 317 transitions. Second operand has 43 states, 43 states have (on average 5.72093023255814) internal successors, (246), 43 states have internal predecessors, (246), 37 states have call successors, (41), 1 states have call predecessors, (41), 20 states have return successors, (57), 21 states have call predecessors, (57), 37 states have call successors, (57) [2025-03-04 11:29:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:09,498 INFO L93 Difference]: Finished difference Result 446 states and 766 transitions. [2025-03-04 11:29:09,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 11:29:09,498 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.72093023255814) internal successors, (246), 43 states have internal predecessors, (246), 37 states have call successors, (41), 1 states have call predecessors, (41), 20 states have return successors, (57), 21 states have call predecessors, (57), 37 states have call successors, (57) Word has length 2355 [2025-03-04 11:29:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:09,500 INFO L225 Difference]: With dead ends: 446 [2025-03-04 11:29:09,500 INFO L226 Difference]: Without dead ends: 231 [2025-03-04 11:29:09,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4777 GetRequests, 4692 SyntacticMatches, 17 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1155, Invalid=3675, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 11:29:09,504 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 626 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:09,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 302 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:29:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-04 11:29:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 175. [2025-03-04 11:29:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 141 states have (on average 1.0212765957446808) internal successors, (144), 139 states have internal predecessors, (144), 23 states have call successors, (23), 17 states have call predecessors, (23), 10 states have return successors, (58), 18 states have call predecessors, (58), 22 states have call successors, (58) [2025-03-04 11:29:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 225 transitions. [2025-03-04 11:29:09,513 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 225 transitions. Word has length 2355 [2025-03-04 11:29:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:09,514 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 225 transitions. [2025-03-04 11:29:09,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.72093023255814) internal successors, (246), 43 states have internal predecessors, (246), 37 states have call successors, (41), 1 states have call predecessors, (41), 20 states have return successors, (57), 21 states have call predecessors, (57), 37 states have call successors, (57) [2025-03-04 11:29:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 225 transitions. [2025-03-04 11:29:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3231 [2025-03-04 11:29:09,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:09,551 INFO L218 NwaCegarLoop]: trace histogram [331, 327, 268, 166, 166, 166, 166, 164, 164, 164, 164, 164, 163, 163, 163, 162, 102, 63, 1, 1, 1, 1] [2025-03-04 11:29:09,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:09,752 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:09,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 493467724, now seen corresponding path program 12 times [2025-03-04 11:29:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581024860] [2025-03-04 11:29:09,753 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:29:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:09,818 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3230 statements into 222 equivalence classes. [2025-03-04 11:29:10,024 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 126 check-sat command(s) and asserted 1863 of 3230 statements. [2025-03-04 11:29:10,024 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 126 check-sat command(s) [2025-03-04 11:29:10,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 385768 backedges. 12461 proven. 32695 refuted. 0 times theorem prover too weak. 340612 trivial. 0 not checked. [2025-03-04 11:29:14,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:14,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581024860] [2025-03-04 11:29:14,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581024860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:14,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351221623] [2025-03-04 11:29:14,022 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:29:14,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:14,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:14,024 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:14,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:29:14,465 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3230 statements into 222 equivalence classes. [2025-03-04 11:29:15,020 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 126 check-sat command(s) and asserted 1863 of 3230 statements. [2025-03-04 11:29:15,020 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 126 check-sat command(s) [2025-03-04 11:29:15,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:15,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 3450 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 11:29:15,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 385768 backedges. 182909 proven. 17113 refuted. 0 times theorem prover too weak. 185746 trivial. 0 not checked. [2025-03-04 11:29:15,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 385768 backedges. 12147 proven. 32446 refuted. 0 times theorem prover too weak. 341175 trivial. 0 not checked. [2025-03-04 11:29:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351221623] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:20,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:20,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 36] total 43 [2025-03-04 11:29:20,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072471442] [2025-03-04 11:29:20,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:20,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 11:29:20,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:20,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 11:29:20,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1521, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:29:20,842 INFO L87 Difference]: Start difference. First operand 175 states and 225 transitions. Second operand has 43 states, 43 states have (on average 5.790697674418604) internal successors, (249), 42 states have internal predecessors, (249), 36 states have call successors, (43), 4 states have call predecessors, (43), 19 states have return successors, (55), 20 states have call predecessors, (55), 34 states have call successors, (55) [2025-03-04 11:29:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:21,670 INFO L93 Difference]: Finished difference Result 429 states and 599 transitions. [2025-03-04 11:29:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-04 11:29:21,670 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.790697674418604) internal successors, (249), 42 states have internal predecessors, (249), 36 states have call successors, (43), 4 states have call predecessors, (43), 19 states have return successors, (55), 20 states have call predecessors, (55), 34 states have call successors, (55) Word has length 3230 [2025-03-04 11:29:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:21,673 INFO L225 Difference]: With dead ends: 429 [2025-03-04 11:29:21,673 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 11:29:21,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6550 GetRequests, 6440 SyntacticMatches, 20 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1884, Invalid=6488, Unknown=0, NotChecked=0, Total=8372 [2025-03-04 11:29:21,677 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 635 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:21,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 286 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:29:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 11:29:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 187. [2025-03-04 11:29:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 150 states have (on average 1.02) internal successors, (153), 149 states have internal predecessors, (153), 25 states have call successors, (25), 18 states have call predecessors, (25), 11 states have return successors, (68), 19 states have call predecessors, (68), 24 states have call successors, (68) [2025-03-04 11:29:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 246 transitions. [2025-03-04 11:29:21,688 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 246 transitions. Word has length 3230 [2025-03-04 11:29:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:21,689 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 246 transitions. [2025-03-04 11:29:21,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.790697674418604) internal successors, (249), 42 states have internal predecessors, (249), 36 states have call successors, (43), 4 states have call predecessors, (43), 19 states have return successors, (55), 20 states have call predecessors, (55), 34 states have call successors, (55) [2025-03-04 11:29:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2025-03-04 11:29:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1733 [2025-03-04 11:29:21,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:21,701 INFO L218 NwaCegarLoop]: trace histogram [177, 176, 143, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 87, 55, 34, 1, 1, 1, 1] [2025-03-04 11:29:21,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 11:29:21,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:21,902 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:21,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:21,903 INFO L85 PathProgramCache]: Analyzing trace with hash 517858667, now seen corresponding path program 13 times [2025-03-04 11:29:21,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:21,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323618270] [2025-03-04 11:29:21,903 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:29:21,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:21,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1732 statements into 1 equivalence classes. [2025-03-04 11:29:22,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1732 of 1732 statements. [2025-03-04 11:29:22,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:22,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat