./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_5-1.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 2199d5dae92fc703178378f6dd7dec10a5f129181c51bc9a88c002f6d4f76a67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:45:26,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:45:26,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:45:26,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:45:26,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:45:26,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:45:26,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:45:26,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:45:26,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:45:26,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:45:26,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:45:26,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:45:26,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:45:26,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:45:26,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:45:26,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:45:26,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:45:26,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:45:26,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:45:26,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:45:26,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:45:26,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:45:26,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:45:26,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:45:26,890 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:45:26,890 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:45:26,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:45:26,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:45:26,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:45:26,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:45:26,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:45:26,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:45:26,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:45:26,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:45:26,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:45:26,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:45:26,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:45:26,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:45:26,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:45:26,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:45:26,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:45:26,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:45:26,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:45:26,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:45:26,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:45:26,892 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 -> 2199d5dae92fc703178378f6dd7dec10a5f129181c51bc9a88c002f6d4f76a67 [2025-03-17 15:45:27,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:45:27,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:45:27,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:45:27,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:45:27,114 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:45:27,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_5-1.c [2025-03-17 15:45:28,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efb0152e/f4fd2b2125934efeb7d22da226886d66/FLAGf2163fb3a [2025-03-17 15:45:28,491 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:45:28,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_5-1.c [2025-03-17 15:45:28,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efb0152e/f4fd2b2125934efeb7d22da226886d66/FLAGf2163fb3a [2025-03-17 15:45:28,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efb0152e/f4fd2b2125934efeb7d22da226886d66 [2025-03-17 15:45:28,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:45:28,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:45:28,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:45:28,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:45:28,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:45:28,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165c752e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28, skipping insertion in model container [2025-03-17 15:45:28,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:45:28,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:45:28,935 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:45:28,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:45:28,954 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:45:28,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28 WrapperNode [2025-03-17 15:45:28,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:45:28,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:45:28,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:45:28,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:45:28,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,972 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-17 15:45:28,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:45:28,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:45:28,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:45:28,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:45:28,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,984 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:45:28,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:28,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:45:28,995 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:45:28,996 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:45:28,996 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:45:28,996 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (1/1) ... [2025-03-17 15:45:29,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:45:29,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:29,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:45:29,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:45:29,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:45:29,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:45:29,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:45:29,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:45:29,047 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-03-17 15:45:29,047 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-03-17 15:45:29,090 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:45:29,091 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:45:29,224 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-03-17 15:45:29,233 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 15:45:29,234 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:45:29,243 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:45:29,244 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:45:29,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:29 BoogieIcfgContainer [2025-03-17 15:45:29,245 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:45:29,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:45:29,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:45:29,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:45:29,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:45:28" (1/3) ... [2025-03-17 15:45:29,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3316fce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:29, skipping insertion in model container [2025-03-17 15:45:29,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:28" (2/3) ... [2025-03-17 15:45:29,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3316fce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:29, skipping insertion in model container [2025-03-17 15:45:29,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:29" (3/3) ... [2025-03-17 15:45:29,255 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_5-1.c [2025-03-17 15:45:29,267 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:45:29,268 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_5-1.c that has 2 procedures, 28 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-17 15:45:29,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:45:29,318 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;@4916fd1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:45:29,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 15:45:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:45:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:45:29,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:29,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:45:29,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:29,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1059215992, now seen corresponding path program 1 times [2025-03-17 15:45:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:29,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761728816] [2025-03-17 15:45:29,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:29,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:29,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:45:29,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:45:29,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:29,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:45:29,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:29,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761728816] [2025-03-17 15:45:29,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761728816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:29,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:45:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:45:29,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604130390] [2025-03-17 15:45:29,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:29,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:45:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:29,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:45:29,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:45:29,480 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 23 states have internal predecessors, (26), 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 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:45:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:29,518 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-03-17 15:45:29,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:45:29,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2025-03-17 15:45:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:29,525 INFO L225 Difference]: With dead ends: 33 [2025-03-17 15:45:29,525 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 15:45:29,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:45:29,529 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:29,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 15:45:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-17 15:45:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-17 15:45:29,559 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2025-03-17 15:45:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:29,560 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-17 15:45:29,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:45:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-17 15:45:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:45:29,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:29,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:29,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:45:29,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:29,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1524042624, now seen corresponding path program 1 times [2025-03-17 15:45:29,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:29,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830180472] [2025-03-17 15:45:29,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:29,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:29,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:45:29,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:45:29,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:29,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:45:29,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:29,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830180472] [2025-03-17 15:45:29,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830180472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:29,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:45:29,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:45:29,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209374348] [2025-03-17 15:45:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:29,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:45:29,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:29,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:45:29,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:45:29,627 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:45:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:29,688 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-03-17 15:45:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:45:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 15:45:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:29,689 INFO L225 Difference]: With dead ends: 23 [2025-03-17 15:45:29,689 INFO L226 Difference]: Without dead ends: 21 [2025-03-17 15:45:29,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:45:29,690 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 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-17 15:45:29,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-17 15:45:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-17 15:45:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-17 15:45:29,693 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2025-03-17 15:45:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:29,693 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-17 15:45:29,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:45:29,694 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-03-17 15:45:29,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 15:45:29,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:29,694 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:29,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:45:29,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:29,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2052325840, now seen corresponding path program 1 times [2025-03-17 15:45:29,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:29,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951995530] [2025-03-17 15:45:29,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:29,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:29,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 15:45:29,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 15:45:29,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:29,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 15:45:29,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:29,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951995530] [2025-03-17 15:45:29,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951995530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:29,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:45:29,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:45:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187631966] [2025-03-17 15:45:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:29,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:45:29,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:29,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:45:29,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:45:29,821 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:29,854 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2025-03-17 15:45:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:45:29,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 22 [2025-03-17 15:45:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:29,855 INFO L225 Difference]: With dead ends: 33 [2025-03-17 15:45:29,855 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 15:45:29,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:45:29,856 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:29,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 15:45:29,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-03-17 15:45:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:45:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-17 15:45:29,863 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2025-03-17 15:45:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:29,863 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-17 15:45:29,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-17 15:45:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 15:45:29,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:29,864 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:29,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:45:29,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:29,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:29,865 INFO L85 PathProgramCache]: Analyzing trace with hash -407005887, now seen corresponding path program 1 times [2025-03-17 15:45:29,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:29,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863970325] [2025-03-17 15:45:29,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:29,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:29,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:45:29,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:45:29,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:29,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 15:45:29,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863970325] [2025-03-17 15:45:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863970325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442831526] [2025-03-17 15:45:29,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:29,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:29,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:29,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:29,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:45:30,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:45:30,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:45:30,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:30,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:30,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:45:30,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:45:30,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:45:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442831526] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:30,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:30,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-17 15:45:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272986414] [2025-03-17 15:45:30,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:30,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 15:45:30,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:30,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 15:45:30,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:45:30,294 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:45:30,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:30,737 INFO L93 Difference]: Finished difference Result 177 states and 257 transitions. [2025-03-17 15:45:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 15:45:30,737 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2025-03-17 15:45:30,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:30,739 INFO L225 Difference]: With dead ends: 177 [2025-03-17 15:45:30,739 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 15:45:30,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-17 15:45:30,745 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 159 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:30,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 289 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:45:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 15:45:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 128. [2025-03-17 15:45:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 101 states have internal predecessors, (110), 17 states have call successors, (17), 5 states have call predecessors, (17), 10 states have return successors, (46), 21 states have call predecessors, (46), 16 states have call successors, (46) [2025-03-17 15:45:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 173 transitions. [2025-03-17 15:45:30,773 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 173 transitions. Word has length 29 [2025-03-17 15:45:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:30,774 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 173 transitions. [2025-03-17 15:45:30,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:45:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 173 transitions. [2025-03-17 15:45:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 15:45:30,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:30,776 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:30,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:45:30,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:30,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:30,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash -689209331, now seen corresponding path program 2 times [2025-03-17 15:45:30,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:30,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43104905] [2025-03-17 15:45:30,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:30,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:30,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 15:45:30,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:45:30,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:30,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 15:45:31,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43104905] [2025-03-17 15:45:31,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43104905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123425566] [2025-03-17 15:45:31,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:31,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:31,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:31,126 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:31,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:45:31,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 15:45:31,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:45:31,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:31,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:31,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:45:31,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 15:45:31,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:45:31,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123425566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:31,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:45:31,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-17 15:45:31,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766871106] [2025-03-17 15:45:31,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:31,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:45:31,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:31,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:45:31,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:45:31,219 INFO L87 Difference]: Start difference. First operand 128 states and 173 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:31,250 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2025-03-17 15:45:31,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:45:31,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-17 15:45:31,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:31,252 INFO L225 Difference]: With dead ends: 151 [2025-03-17 15:45:31,252 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 15:45:31,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:45:31,253 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:31,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 15:45:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2025-03-17 15:45:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.1037735849056605) internal successors, (117), 106 states have internal predecessors, (117), 17 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (55), 24 states have call predecessors, (55), 16 states have call successors, (55) [2025-03-17 15:45:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2025-03-17 15:45:31,277 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 41 [2025-03-17 15:45:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:31,278 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2025-03-17 15:45:31,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2025-03-17 15:45:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 15:45:31,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:31,279 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:31,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:45:31,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:31,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:31,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash 109347199, now seen corresponding path program 1 times [2025-03-17 15:45:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:31,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048951504] [2025-03-17 15:45:31,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:31,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:45:31,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:45:31,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:31,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 15:45:31,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:31,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048951504] [2025-03-17 15:45:31,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048951504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:31,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282187171] [2025-03-17 15:45:31,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:31,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:31,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:31,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:31,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:45:31,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:45:31,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:45:31,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:31,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:31,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:45:31,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 15:45:31,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:45:31,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282187171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:31,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:45:31,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-17 15:45:31,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903460289] [2025-03-17 15:45:31,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:31,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:45:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:31,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:45:31,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:45:31,669 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:31,710 INFO L93 Difference]: Finished difference Result 205 states and 325 transitions. [2025-03-17 15:45:31,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:45:31,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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 42 [2025-03-17 15:45:31,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:31,715 INFO L225 Difference]: With dead ends: 205 [2025-03-17 15:45:31,716 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 15:45:31,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:45:31,717 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:31,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 15:45:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 152. [2025-03-17 15:45:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.0924369747899159) internal successors, (130), 118 states have internal predecessors, (130), 19 states have call successors, (19), 5 states have call predecessors, (19), 12 states have return successors, (76), 28 states have call predecessors, (76), 18 states have call successors, (76) [2025-03-17 15:45:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 225 transitions. [2025-03-17 15:45:31,744 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 225 transitions. Word has length 42 [2025-03-17 15:45:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:31,744 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 225 transitions. [2025-03-17 15:45:31,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 225 transitions. [2025-03-17 15:45:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 15:45:31,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:31,747 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:31,753 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-17 15:45:31,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:31,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:31,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash -939337953, now seen corresponding path program 1 times [2025-03-17 15:45:31,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:31,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753518452] [2025-03-17 15:45:31,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:31,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 15:45:31,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:45:31,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:31,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-17 15:45:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753518452] [2025-03-17 15:45:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753518452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:32,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:45:32,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:45:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629387147] [2025-03-17 15:45:32,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:32,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:45:32,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:32,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:45:32,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:45:32,024 INFO L87 Difference]: Start difference. First operand 152 states and 225 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:32,071 INFO L93 Difference]: Finished difference Result 179 states and 269 transitions. [2025-03-17 15:45:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:45:32,072 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 43 [2025-03-17 15:45:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:32,073 INFO L225 Difference]: With dead ends: 179 [2025-03-17 15:45:32,074 INFO L226 Difference]: Without dead ends: 178 [2025-03-17 15:45:32,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:45:32,076 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:32,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 71 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-17 15:45:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 163. [2025-03-17 15:45:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 128 states have (on average 1.0859375) internal successors, (139), 126 states have internal predecessors, (139), 21 states have call successors, (21), 5 states have call predecessors, (21), 12 states have return successors, (88), 31 states have call predecessors, (88), 20 states have call successors, (88) [2025-03-17 15:45:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2025-03-17 15:45:32,105 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 43 [2025-03-17 15:45:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:32,106 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2025-03-17 15:45:32,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2025-03-17 15:45:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 15:45:32,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:32,112 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:32,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:45:32,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:32,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash -903543639, now seen corresponding path program 1 times [2025-03-17 15:45:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:32,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69553786] [2025-03-17 15:45:32,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:32,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:32,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:45:32,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:45:32,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:32,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-17 15:45:32,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:32,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69553786] [2025-03-17 15:45:32,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69553786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:32,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935692384] [2025-03-17 15:45:32,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:32,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:32,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:32,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:32,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:45:32,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:45:32,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:45:32,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:32,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:32,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 15:45:32,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 46 proven. 63 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:45:32,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 46 proven. 63 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:45:32,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935692384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:32,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:32,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 17 [2025-03-17 15:45:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950391247] [2025-03-17 15:45:32,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:32,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 15:45:32,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:32,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 15:45:32,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:45:32,496 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 8 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:45:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:32,785 INFO L93 Difference]: Finished difference Result 294 states and 466 transitions. [2025-03-17 15:45:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 15:45:32,786 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 8 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2025-03-17 15:45:32,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:32,788 INFO L225 Difference]: With dead ends: 294 [2025-03-17 15:45:32,788 INFO L226 Difference]: Without dead ends: 145 [2025-03-17 15:45:32,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 102 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2025-03-17 15:45:32,792 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 224 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:32,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 80 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:45:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-17 15:45:32,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2025-03-17 15:45:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 95 states have (on average 1.0736842105263158) internal successors, (102), 97 states have internal predecessors, (102), 16 states have call successors, (16), 5 states have call predecessors, (16), 10 states have return successors, (30), 20 states have call predecessors, (30), 15 states have call successors, (30) [2025-03-17 15:45:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2025-03-17 15:45:32,803 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 61 [2025-03-17 15:45:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:32,804 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2025-03-17 15:45:32,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 8 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:45:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2025-03-17 15:45:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 15:45:32,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:32,805 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:45:32,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:45:33,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:33,006 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:33,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:33,006 INFO L85 PathProgramCache]: Analyzing trace with hash 728302546, now seen corresponding path program 1 times [2025-03-17 15:45:33,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:33,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601678523] [2025-03-17 15:45:33,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:33,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:33,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 15:45:33,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 15:45:33,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:33,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-17 15:45:33,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:33,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601678523] [2025-03-17 15:45:33,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601678523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:33,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27032255] [2025-03-17 15:45:33,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:33,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:33,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:33,118 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:33,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:45:33,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 15:45:33,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 15:45:33,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:33,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:33,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:45:33,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-17 15:45:33,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-17 15:45:33,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27032255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:33,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-17 15:45:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067087449] [2025-03-17 15:45:33,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:33,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 15:45:33,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:33,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 15:45:33,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:45:33,358 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:45:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:33,438 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2025-03-17 15:45:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 15:45:33,438 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 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 56 [2025-03-17 15:45:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:33,439 INFO L225 Difference]: With dead ends: 133 [2025-03-17 15:45:33,439 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 15:45:33,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:45:33,440 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:33,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 108 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 15:45:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2025-03-17 15:45:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 97 states have internal predecessors, (100), 16 states have call successors, (16), 5 states have call predecessors, (16), 10 states have return successors, (30), 20 states have call predecessors, (30), 15 states have call successors, (30) [2025-03-17 15:45:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2025-03-17 15:45:33,462 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 56 [2025-03-17 15:45:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:33,462 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2025-03-17 15:45:33,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:45:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2025-03-17 15:45:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 15:45:33,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:33,463 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2025-03-17 15:45:33,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:45:33,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:33,664 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:33,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:33,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1239168666, now seen corresponding path program 2 times [2025-03-17 15:45:33,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:33,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422572962] [2025-03-17 15:45:33,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:33,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:33,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-17 15:45:33,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:45:33,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:33,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 51 proven. 69 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 15:45:33,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:33,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422572962] [2025-03-17 15:45:33,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422572962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:33,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483264508] [2025-03-17 15:45:33,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:33,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:33,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:33,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:33,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:45:33,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-17 15:45:33,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:45:33,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:33,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:33,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:45:33,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-03-17 15:45:33,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-17 15:45:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483264508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:34,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:34,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 5] total 21 [2025-03-17 15:45:34,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456318858] [2025-03-17 15:45:34,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:34,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 15:45:34,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:34,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 15:45:34,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:45:34,092 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 18 states have internal predecessors, (69), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 15:45:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:34,632 INFO L93 Difference]: Finished difference Result 232 states and 285 transitions. [2025-03-17 15:45:34,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 15:45:34,633 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 18 states have internal predecessors, (69), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) Word has length 73 [2025-03-17 15:45:34,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:34,633 INFO L225 Difference]: With dead ends: 232 [2025-03-17 15:45:34,633 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 15:45:34,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=534, Invalid=1722, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 15:45:34,635 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 177 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:34,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 58 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:45:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 15:45:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 80. [2025-03-17 15:45:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.032258064516129) internal successors, (64), 64 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-17 15:45:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2025-03-17 15:45:34,641 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 73 [2025-03-17 15:45:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:34,641 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2025-03-17 15:45:34,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 18 states have internal predecessors, (69), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 15:45:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2025-03-17 15:45:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 15:45:34,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:34,642 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1] [2025-03-17 15:45:34,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 15:45:34,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:34,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:34,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash 730752086, now seen corresponding path program 2 times [2025-03-17 15:45:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:34,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692486421] [2025-03-17 15:45:34,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:34,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-03-17 15:45:34,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 15:45:34,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:34,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 78 proven. 189 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2025-03-17 15:45:35,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:35,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692486421] [2025-03-17 15:45:35,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692486421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:35,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577451598] [2025-03-17 15:45:35,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:35,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:35,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:35,333 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:35,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:45:35,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-03-17 15:45:35,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 15:45:35,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:35,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:35,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 15:45:35,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2025-03-17 15:45:35,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-17 15:45:36,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577451598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:36,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:36,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 17] total 31 [2025-03-17 15:45:36,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397284697] [2025-03-17 15:45:36,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:36,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 15:45:36,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:36,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 15:45:36,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2025-03-17 15:45:36,673 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 32 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 32 states have internal predecessors, (83), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-17 15:45:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:36,738 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2025-03-17 15:45:36,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 15:45:36,739 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 32 states have internal predecessors, (83), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) Word has length 142 [2025-03-17 15:45:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:36,739 INFO L225 Difference]: With dead ends: 105 [2025-03-17 15:45:36,739 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:45:36,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 268 SyntacticMatches, 13 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 15:45:36,740 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:36,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 188 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:36,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:45:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:45:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:45:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:45:36,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2025-03-17 15:45:36,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:36,741 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:45:36,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 32 states have internal predecessors, (83), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-17 15:45:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:45:36,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:45:36,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 15:45:36,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 15:45:36,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 15:45:36,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 15:45:36,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 15:45:36,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 15:45:36,750 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-17 15:45:36,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:36,947 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:45:36,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:45:37,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:45:37,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:45:37 BoogieIcfgContainer [2025-03-17 15:45:37,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:45:37,679 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:45:37,679 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:45:37,679 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:45:37,679 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:29" (3/4) ... [2025-03-17 15:45:37,681 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:45:37,684 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo [2025-03-17 15:45:37,686 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 15:45:37,686 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:45:37,687 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:45:37,687 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:45:37,733 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:45:37,734 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:45:37,734 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:45:37,734 INFO L158 Benchmark]: Toolchain (without parser) took 8911.83ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 106.1MB in the beginning and 185.2MB in the end (delta: -79.1MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB. [2025-03-17 15:45:37,734 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:45:37,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 130.10ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 95.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:45:37,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.76ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.2MB in the end (delta: 975.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:45:37,735 INFO L158 Benchmark]: Boogie Preprocessor took 21.38ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.7MB in the end (delta: 446.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:45:37,735 INFO L158 Benchmark]: IcfgBuilder took 249.81ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 82.4MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:45:37,736 INFO L158 Benchmark]: TraceAbstraction took 8430.85ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 81.4MB in the beginning and 189.4MB in the end (delta: -108.0MB). Peak memory consumption was 166.5MB. Max. memory is 16.1GB. [2025-03-17 15:45:37,736 INFO L158 Benchmark]: Witness Printer took 55.17ms. Allocated memory is still 343.9MB. Free memory was 189.4MB in the beginning and 185.2MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:45:37,737 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 130.10ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 95.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.76ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.2MB in the end (delta: 975.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.38ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.7MB in the end (delta: 446.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 249.81ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 82.4MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8430.85ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 81.4MB in the beginning and 189.4MB in the end (delta: -108.0MB). Peak memory consumption was 166.5MB. Max. memory is 16.1GB. * Witness Printer took 55.17ms. Allocated memory is still 343.9MB. Free memory was 189.4MB in the beginning and 185.2MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 35 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 634 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 617 mSDsluCounter, 1014 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 803 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1490 IncrementalHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 211 mSDtfsCounter, 1490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 939 GetRequests, 739 SyntacticMatches, 30 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=7, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 177 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 966 NumberOfCodeBlocks, 966 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1304 ConstructedInterpolants, 0 QuantifiedInterpolants, 2910 SizeOfPredicates, 8 NumberOfNonLiveVariables, 967 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 2747/3532 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 15:45:37,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE