./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_10-2.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 a6546395432109233bf3e1991428a566548dd822bb23ca198622322bf4db5a8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:28:49,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:28:49,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:28:49,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:28:49,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:28:49,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:28:49,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:28:49,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:28:49,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:28:49,333 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:28:49,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:28:49,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:28:49,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:28:49,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:28:49,334 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:28:49,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:28:49,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:28:49,334 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:28:49,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:28:49,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:28:49,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:28:49,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:28:49,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:28:49,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:28:49,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:49,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:28:49,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:28:49,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:28:49,336 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 -> a6546395432109233bf3e1991428a566548dd822bb23ca198622322bf4db5a8a [2025-03-04 11:28:49,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:28:49,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:28:49,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:28:49,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:28:49,537 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:28:49,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-2.c [2025-03-04 11:28:50,635 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec1156f5/a159663ab47a4d25ad886ab87180d47d/FLAG33c10a0b9 [2025-03-04 11:28:50,862 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:28:50,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-2.c [2025-03-04 11:28:50,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec1156f5/a159663ab47a4d25ad886ab87180d47d/FLAG33c10a0b9 [2025-03-04 11:28:50,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec1156f5/a159663ab47a4d25ad886ab87180d47d [2025-03-04 11:28:50,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:28:50,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:28:50,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:50,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:28:50,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:28:50,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:50" (1/1) ... [2025-03-04 11:28:50,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64478c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:50, skipping insertion in model container [2025-03-04 11:28:50,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:50" (1/1) ... [2025-03-04 11:28:50,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:28:50,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:51,005 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:28:51,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:51,025 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:28:51,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51 WrapperNode [2025-03-04 11:28:51,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:51,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:51,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:28:51,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:28:51,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,049 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-04 11:28:51,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:51,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:28:51,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:28:51,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:28:51,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,069 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:28:51,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:28:51,078 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:28:51,078 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:28:51,078 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:28:51,079 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (1/1) ... [2025-03-04 11:28:51,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:51,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:51,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:28:51,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:28:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:28:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:28:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:28:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:28:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-03-04 11:28:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-03-04 11:28:51,171 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:28:51,172 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:28:51,247 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-03-04 11:28:51,251 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 11:28:51,252 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:28:51,257 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:28:51,258 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:28:51,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:51 BoogieIcfgContainer [2025-03-04 11:28:51,258 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:28:51,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:28:51,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:28:51,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:28:51,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:28:50" (1/3) ... [2025-03-04 11:28:51,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8f4103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:51, skipping insertion in model container [2025-03-04 11:28:51,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:51" (2/3) ... [2025-03-04 11:28:51,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8f4103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:51, skipping insertion in model container [2025-03-04 11:28:51,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:51" (3/3) ... [2025-03-04 11:28:51,265 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_10-2.c [2025-03-04 11:28:51,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:28:51,275 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_10-2.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 11:28:51,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:28:51,319 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;@fab6d0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:28:51,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:28:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:28:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:28:51,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:51,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:51,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:51,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1976054303, now seen corresponding path program 1 times [2025-03-04 11:28:51,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:51,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625821908] [2025-03-04 11:28:51,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:51,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:51,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:28:51,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:28:51,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:51,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:51,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:51,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625821908] [2025-03-04 11:28:51,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625821908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:51,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:51,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:28:51,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156007742] [2025-03-04 11:28:51,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:51,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:28:51,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:51,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:28:51,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:51,465 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:51,493 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-04 11:28:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:28:51,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:28:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:51,499 INFO L225 Difference]: With dead ends: 38 [2025-03-04 11:28:51,499 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 11:28:51,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:51,502 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:51,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 11:28:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-04 11:28:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-04 11:28:51,535 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-03-04 11:28:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:51,536 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 11:28:51,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-04 11:28:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:28:51,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:51,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:51,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:28:51,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:51,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1128141252, now seen corresponding path program 1 times [2025-03-04 11:28:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:51,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367546416] [2025-03-04 11:28:51,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:51,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:28:51,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:28:51,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:51,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:51,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:51,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367546416] [2025-03-04 11:28:51,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367546416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:51,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:51,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:51,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062567524] [2025-03-04 11:28:51,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:51,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:51,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:51,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:51,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:51,618 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:51,673 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-04 11:28:51,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:51,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 11:28:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:51,674 INFO L225 Difference]: With dead ends: 24 [2025-03-04 11:28:51,674 INFO L226 Difference]: Without dead ends: 22 [2025-03-04 11:28:51,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:51,675 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:51,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-04 11:28:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-04 11:28:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-04 11:28:51,679 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2025-03-04 11:28:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:51,679 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-04 11:28:51,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-04 11:28:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:28:51,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:51,680 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:51,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:28:51,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:51,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2023302297, now seen corresponding path program 1 times [2025-03-04 11:28:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:51,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757109315] [2025-03-04 11:28:51,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:51,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:28:51,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:28:51,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:51,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:51,815 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-04 11:28:51,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:51,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757109315] [2025-03-04 11:28:51,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757109315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:51,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:51,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768336052] [2025-03-04 11:28:51,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:51,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:51,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:51,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:51,817 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:51,865 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-03-04 11:28:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:51,865 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 23 [2025-03-04 11:28:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:51,866 INFO L225 Difference]: With dead ends: 34 [2025-03-04 11:28:51,866 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 11:28:51,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:51,866 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:51,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 76 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 11:28:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-04 11:28:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:28:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-04 11:28:51,873 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 23 [2025-03-04 11:28:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:51,873 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 11:28:51,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-04 11:28:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:28:51,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:51,874 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:51,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:28:51,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:51,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:51,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1013164860, now seen corresponding path program 1 times [2025-03-04 11:28:51,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:51,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531669268] [2025-03-04 11:28:51,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:51,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:51,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:28:51,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:28:51,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:51,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:28:51,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:51,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531669268] [2025-03-04 11:28:51,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531669268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:51,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503791900] [2025-03-04 11:28:51,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:51,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:51,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:51,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:51,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:28:52,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:28:52,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:28:52,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:52,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:52,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:52,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:52,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:28:52,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503791900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:52,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:52,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-04 11:28:52,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85055872] [2025-03-04 11:28:52,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:52,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:28:52,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:52,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:28:52,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:28:52,222 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 15 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:28:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:52,698 INFO L93 Difference]: Finished difference Result 142 states and 214 transitions. [2025-03-04 11:28:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:28:52,699 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 24 [2025-03-04 11:28:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:52,700 INFO L225 Difference]: With dead ends: 142 [2025-03-04 11:28:52,700 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 11:28:52,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:28:52,701 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 83 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:52,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 232 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:28:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 11:28:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2025-03-04 11:28:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 71 states have internal predecessors, (76), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (43), 15 states have call predecessors, (43), 11 states have call successors, (43) [2025-03-04 11:28:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-04 11:28:52,715 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 24 [2025-03-04 11:28:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:52,715 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-04 11:28:52,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:28:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-04 11:28:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:28:52,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:52,717 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-04 11:28:52,723 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-04 11:28:52,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:52,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:52,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:52,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1779932149, now seen corresponding path program 2 times [2025-03-04 11:28:52,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:52,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57711325] [2025-03-04 11:28:52,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:52,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:52,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 11:28:52,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:28:52,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:52,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:53,003 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-04 11:28:53,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:53,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57711325] [2025-03-04 11:28:53,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57711325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406030324] [2025-03-04 11:28:53,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:53,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:53,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:53,005 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:53,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:28:53,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 11:28:53,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:28:53,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:53,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:53,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:28:53,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:53,082 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-04 11:28:53,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:53,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406030324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:53,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:53,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 11:28:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536423391] [2025-03-04 11:28:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:53,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:53,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:53,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:53,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:28:53,083 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:53,106 INFO L93 Difference]: Finished difference Result 98 states and 142 transitions. [2025-03-04 11:28:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:53,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-04 11:28:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:53,108 INFO L225 Difference]: With dead ends: 98 [2025-03-04 11:28:53,108 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 11:28:53,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:28:53,109 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:53,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 11:28:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2025-03-04 11:28:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.095890410958904) internal successors, (80), 73 states have internal predecessors, (80), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (43), 17 states have call predecessors, (43), 11 states have call successors, (43) [2025-03-04 11:28:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2025-03-04 11:28:53,125 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 42 [2025-03-04 11:28:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:53,125 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2025-03-04 11:28:53,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2025-03-04 11:28:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 11:28:53,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:53,128 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:53,134 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-04 11:28:53,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:53,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:53,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash -213800611, now seen corresponding path program 1 times [2025-03-04 11:28:53,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:53,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271470764] [2025-03-04 11:28:53,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:53,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:28:53,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:28:53,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:53,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 11:28:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271470764] [2025-03-04 11:28:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271470764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961392339] [2025-03-04 11:28:53,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:53,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:53,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:53,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:53,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:28:53,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:28:53,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:28:53,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:53,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:53,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:28:53,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:53,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:28:53,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961392339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:53,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:53,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 23 [2025-03-04 11:28:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467369382] [2025-03-04 11:28:53,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:53,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:28:53,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:53,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:28:53,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:28:53,697 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 17 states have internal predecessors, (66), 11 states have call successors, (13), 8 states have call predecessors, (13), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:28:54,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:54,198 INFO L93 Difference]: Finished difference Result 336 states and 540 transitions. [2025-03-04 11:28:54,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 11:28:54,198 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 17 states have internal predecessors, (66), 11 states have call successors, (13), 8 states have call predecessors, (13), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2025-03-04 11:28:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:54,200 INFO L225 Difference]: With dead ends: 336 [2025-03-04 11:28:54,200 INFO L226 Difference]: Without dead ends: 251 [2025-03-04 11:28:54,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 11:28:54,203 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 226 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:54,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 457 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:28:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-04 11:28:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 225. [2025-03-04 11:28:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 177 states have (on average 1.0960451977401129) internal successors, (194), 176 states have internal predecessors, (194), 28 states have call successors, (28), 8 states have call predecessors, (28), 18 states have return successors, (94), 40 states have call predecessors, (94), 27 states have call successors, (94) [2025-03-04 11:28:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2025-03-04 11:28:54,245 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 37 [2025-03-04 11:28:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:54,245 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2025-03-04 11:28:54,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 17 states have internal predecessors, (66), 11 states have call successors, (13), 8 states have call predecessors, (13), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:28:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2025-03-04 11:28:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:28:54,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:54,247 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:54,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:54,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:54,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:54,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1080149815, now seen corresponding path program 1 times [2025-03-04 11:28:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943426620] [2025-03-04 11:28:54,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:54,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:28:54,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:28:54,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:54,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-04 11:28:54,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:54,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943426620] [2025-03-04 11:28:54,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943426620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:54,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:54,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:54,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830855105] [2025-03-04 11:28:54,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:54,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:54,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:54,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:54,557 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:54,588 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2025-03-04 11:28:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:54,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2025-03-04 11:28:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:54,590 INFO L225 Difference]: With dead ends: 252 [2025-03-04 11:28:54,590 INFO L226 Difference]: Without dead ends: 251 [2025-03-04 11:28:54,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:54,591 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 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-04 11:28:54,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-04 11:28:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 236. [2025-03-04 11:28:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 186 states have (on average 1.0913978494623655) internal successors, (203), 184 states have internal predecessors, (203), 30 states have call successors, (30), 8 states have call predecessors, (30), 18 states have return successors, (106), 43 states have call predecessors, (106), 29 states have call successors, (106) [2025-03-04 11:28:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 339 transitions. [2025-03-04 11:28:54,615 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 339 transitions. Word has length 56 [2025-03-04 11:28:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:54,615 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 339 transitions. [2025-03-04 11:28:54,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 339 transitions. [2025-03-04 11:28:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 11:28:54,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:54,617 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:54,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:28:54,618 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:54,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1582837461, now seen corresponding path program 1 times [2025-03-04 11:28:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092752235] [2025-03-04 11:28:54,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:54,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:54,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:28:54,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:28:54,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:54,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-03-04 11:28:54,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:54,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092752235] [2025-03-04 11:28:54,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092752235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:54,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770341817] [2025-03-04 11:28:54,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:54,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:54,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:54,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:54,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:28:54,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:28:54,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:28:54,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:54,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:54,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:28:54,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 80 proven. 108 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 11:28:54,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 2 proven. 189 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:28:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770341817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:55,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:55,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 17, 17] total 26 [2025-03-04 11:28:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190972774] [2025-03-04 11:28:55,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:55,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:28:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:55,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:28:55,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:28:55,125 INFO L87 Difference]: Start difference. First operand 236 states and 339 transitions. Second operand has 26 states, 24 states have (on average 3.625) internal successors, (87), 18 states have internal predecessors, (87), 13 states have call successors, (18), 10 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:28:55,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:55,635 INFO L93 Difference]: Finished difference Result 597 states and 926 transitions. [2025-03-04 11:28:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:28:55,635 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.625) internal successors, (87), 18 states have internal predecessors, (87), 13 states have call successors, (18), 10 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) Word has length 74 [2025-03-04 11:28:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:55,637 INFO L225 Difference]: With dead ends: 597 [2025-03-04 11:28:55,637 INFO L226 Difference]: Without dead ends: 382 [2025-03-04 11:28:55,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 125 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 11:28:55,640 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 325 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:55,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 473 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:28:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-04 11:28:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 350. [2025-03-04 11:28:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 276 states have (on average 1.0978260869565217) internal successors, (303), 275 states have internal predecessors, (303), 44 states have call successors, (44), 13 states have call predecessors, (44), 28 states have return successors, (131), 61 states have call predecessors, (131), 43 states have call successors, (131) [2025-03-04 11:28:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 478 transitions. [2025-03-04 11:28:55,667 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 478 transitions. Word has length 74 [2025-03-04 11:28:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:55,667 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 478 transitions. [2025-03-04 11:28:55,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.625) internal successors, (87), 18 states have internal predecessors, (87), 13 states have call successors, (18), 10 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:28:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 478 transitions. [2025-03-04 11:28:55,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:28:55,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:55,669 INFO L218 NwaCegarLoop]: trace histogram [15, 13, 11, 11, 11, 11, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:55,675 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-04 11:28:55,870 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-04 11:28:55,870 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:55,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1714387328, now seen corresponding path program 2 times [2025-03-04 11:28:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:55,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458325469] [2025-03-04 11:28:55,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:55,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-03-04 11:28:55,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:28:55,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:55,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-04 11:28:55,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:55,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458325469] [2025-03-04 11:28:55,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458325469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:55,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409675212] [2025-03-04 11:28:55,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:55,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:55,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:55,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:55,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:28:55,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-03-04 11:28:55,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:28:55,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:55,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:55,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:28:55,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 198 proven. 234 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 11:28:56,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 58 proven. 394 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 11:28:56,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409675212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:56,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:56,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 23, 23] total 27 [2025-03-04 11:28:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378170589] [2025-03-04 11:28:56,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:56,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 11:28:56,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:56,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 11:28:56,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:28:56,522 INFO L87 Difference]: Start difference. First operand 350 states and 478 transitions. Second operand has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 18 states have internal predecessors, (89), 13 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:28:56,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:56,985 INFO L93 Difference]: Finished difference Result 743 states and 1075 transitions. [2025-03-04 11:28:56,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 11:28:56,986 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 18 states have internal predecessors, (89), 13 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 106 [2025-03-04 11:28:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:56,988 INFO L225 Difference]: With dead ends: 743 [2025-03-04 11:28:56,988 INFO L226 Difference]: Without dead ends: 414 [2025-03-04 11:28:56,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 178 SyntacticMatches, 20 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=1168, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 11:28:56,991 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 371 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:56,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 547 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:28:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-04 11:28:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 380. [2025-03-04 11:28:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 300 states have (on average 1.0966666666666667) internal successors, (329), 298 states have internal predecessors, (329), 48 states have call successors, (48), 14 states have call predecessors, (48), 30 states have return successors, (142), 67 states have call predecessors, (142), 47 states have call successors, (142) [2025-03-04 11:28:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 519 transitions. [2025-03-04 11:28:57,020 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 519 transitions. Word has length 106 [2025-03-04 11:28:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:57,020 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 519 transitions. [2025-03-04 11:28:57,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 18 states have internal predecessors, (89), 13 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:28:57,020 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 519 transitions. [2025-03-04 11:28:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 11:28:57,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:57,021 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:57,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:57,226 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-04 11:28:57,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:57,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash 334736119, now seen corresponding path program 1 times [2025-03-04 11:28:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:57,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687779299] [2025-03-04 11:28:57,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:57,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 11:28:57,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 11:28:57,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:57,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 227 proven. 133 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:28:57,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:57,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687779299] [2025-03-04 11:28:57,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687779299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:57,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566048970] [2025-03-04 11:28:57,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:57,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:57,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:57,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:57,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:28:57,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 11:28:57,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 11:28:57,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:57,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:57,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:28:57,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 227 proven. 133 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:28:57,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 227 proven. 133 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:28:57,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566048970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:57,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:57,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 24 [2025-03-04 11:28:57,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686788930] [2025-03-04 11:28:57,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:57,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:28:57,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:57,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:28:57,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:57,890 INFO L87 Difference]: Start difference. First operand 380 states and 519 transitions. Second operand has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 15 states have internal predecessors, (72), 11 states have call successors, (13), 10 states have call predecessors, (13), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:28:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:58,323 INFO L93 Difference]: Finished difference Result 725 states and 1047 transitions. [2025-03-04 11:28:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 11:28:58,323 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 15 states have internal predecessors, (72), 11 states have call successors, (13), 10 states have call predecessors, (13), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 93 [2025-03-04 11:28:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:58,326 INFO L225 Difference]: With dead ends: 725 [2025-03-04 11:28:58,326 INFO L226 Difference]: Without dead ends: 366 [2025-03-04 11:28:58,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 174 SyntacticMatches, 20 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=511, Invalid=1295, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:28:58,330 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 561 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:58,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 175 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-04 11:28:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 340. [2025-03-04 11:28:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 267 states have (on average 1.0936329588014981) internal successors, (292), 269 states have internal predecessors, (292), 43 states have call successors, (43), 14 states have call predecessors, (43), 28 states have return successors, (84), 56 states have call predecessors, (84), 42 states have call successors, (84) [2025-03-04 11:28:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 419 transitions. [2025-03-04 11:28:58,355 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 419 transitions. Word has length 93 [2025-03-04 11:28:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:58,356 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 419 transitions. [2025-03-04 11:28:58,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 15 states have internal predecessors, (72), 11 states have call successors, (13), 10 states have call predecessors, (13), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:28:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 419 transitions. [2025-03-04 11:28:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 11:28:58,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:58,358 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:58,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:58,563 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-04 11:28:58,563 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:58,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:58,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1074906584, now seen corresponding path program 2 times [2025-03-04 11:28:58,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:58,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452286743] [2025-03-04 11:28:58,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:58,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:58,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-04 11:28:58,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 11:28:58,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:58,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 11:28:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:58,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452286743] [2025-03-04 11:28:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452286743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:58,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299421578] [2025-03-04 11:28:58,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:58,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:58,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:58,707 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:58,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:28:58,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-04 11:28:58,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 11:28:58,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:58,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:58,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:28:58,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-04 11:28:58,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-04 11:28:58,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299421578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:58,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:58,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-04 11:28:58,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107242911] [2025-03-04 11:28:58,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:58,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:28:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:58,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:28:58,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:28:58,926 INFO L87 Difference]: Start difference. First operand 340 states and 419 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:28:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:59,021 INFO L93 Difference]: Finished difference Result 350 states and 431 transitions. [2025-03-04 11:28:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:28:59,022 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 87 [2025-03-04 11:28:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:59,024 INFO L225 Difference]: With dead ends: 350 [2025-03-04 11:28:59,024 INFO L226 Difference]: Without dead ends: 348 [2025-03-04 11:28:59,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 165 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-04 11:28:59,024 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:59,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 159 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-04 11:28:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 340. [2025-03-04 11:28:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 267 states have (on average 1.0823970037453183) internal successors, (289), 269 states have internal predecessors, (289), 43 states have call successors, (43), 14 states have call predecessors, (43), 28 states have return successors, (84), 56 states have call predecessors, (84), 42 states have call successors, (84) [2025-03-04 11:28:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 416 transitions. [2025-03-04 11:28:59,048 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 416 transitions. Word has length 87 [2025-03-04 11:28:59,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:59,048 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 416 transitions. [2025-03-04 11:28:59,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:28:59,049 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 416 transitions. [2025-03-04 11:28:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 11:28:59,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:59,051 INFO L218 NwaCegarLoop]: trace histogram [14, 11, 10, 10, 10, 10, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:28:59,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:28:59,251 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-04 11:28:59,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:59,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:59,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1950989099, now seen corresponding path program 3 times [2025-03-04 11:28:59,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:59,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120122702] [2025-03-04 11:28:59,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:59,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:59,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 12 equivalence classes. [2025-03-04 11:28:59,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 104 statements. [2025-03-04 11:28:59,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 11:28:59,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-04 11:28:59,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:59,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120122702] [2025-03-04 11:28:59,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120122702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:59,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656464685] [2025-03-04 11:28:59,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:59,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:59,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:59,310 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:59,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:28:59,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 12 equivalence classes. [2025-03-04 11:28:59,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 104 statements. [2025-03-04 11:28:59,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 11:28:59,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:59,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:59,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-04 11:28:59,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:59,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656464685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:59,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:59,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-04 11:28:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541847743] [2025-03-04 11:28:59,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:59,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:28:59,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:59,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:28:59,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:59,364 INFO L87 Difference]: Start difference. First operand 340 states and 416 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 11:28:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:59,410 INFO L93 Difference]: Finished difference Result 536 states and 688 transitions. [2025-03-04 11:28:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:59,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 104 [2025-03-04 11:28:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:59,412 INFO L225 Difference]: With dead ends: 536 [2025-03-04 11:28:59,413 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 11:28:59,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:28:59,414 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:59,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 11:28:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2025-03-04 11:28:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 170 states have (on average 1.1235294117647059) internal successors, (191), 172 states have internal predecessors, (191), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 11:28:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2025-03-04 11:28:59,431 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 104 [2025-03-04 11:28:59,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:59,431 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2025-03-04 11:28:59,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 11:28:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2025-03-04 11:28:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 11:28:59,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:59,433 INFO L218 NwaCegarLoop]: trace histogram [15, 13, 10, 10, 10, 10, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 11:28:59,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:59,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 11:28:59,634 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:59,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:59,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1753914713, now seen corresponding path program 4 times [2025-03-04 11:28:59,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:59,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715208987] [2025-03-04 11:28:59,634 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:59,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:59,639 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 119 statements into 2 equivalence classes. [2025-03-04 11:28:59,649 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 11:28:59,650 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:59,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2025-03-04 11:28:59,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:59,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715208987] [2025-03-04 11:28:59,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715208987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:59,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031083856] [2025-03-04 11:28:59,833 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:59,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:59,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:59,835 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:59,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:28:59,857 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 119 statements into 2 equivalence classes. [2025-03-04 11:28:59,875 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 11:28:59,875 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:59,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:59,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:28:59,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 29 proven. 42 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-03-04 11:28:59,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2025-03-04 11:29:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031083856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:00,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 13] total 22 [2025-03-04 11:29:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900236783] [2025-03-04 11:29:00,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:00,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:29:00,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:00,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:29:00,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:29:00,278 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (14), 13 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 11:29:00,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:00,315 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2025-03-04 11:29:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:29:00,316 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (14), 13 states have call predecessors, (14), 5 states have call successors, (14) Word has length 119 [2025-03-04 11:29:00,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:00,317 INFO L225 Difference]: With dead ends: 215 [2025-03-04 11:29:00,317 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 11:29:00,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 227 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:29:00,318 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:00,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 104 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 11:29:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-04 11:29:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 170 states have (on average 1.0588235294117647) internal successors, (180), 171 states have internal predecessors, (180), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 11:29:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions. [2025-03-04 11:29:00,326 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 119 [2025-03-04 11:29:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:00,326 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions. [2025-03-04 11:29:00,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (14), 13 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 11:29:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2025-03-04 11:29:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 11:29:00,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:00,327 INFO L218 NwaCegarLoop]: trace histogram [20, 17, 14, 12, 12, 12, 12, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1, 1] [2025-03-04 11:29:00,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 11:29:00,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:29:00,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:00,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash 309160204, now seen corresponding path program 3 times [2025-03-04 11:29:00,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:00,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911306157] [2025-03-04 11:29:00,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:29:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:00,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 173 statements into 17 equivalence classes. [2025-03-04 11:29:00,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 137 of 173 statements. [2025-03-04 11:29:00,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:29:00,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 78 proven. 189 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-03-04 11:29:00,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:00,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911306157] [2025-03-04 11:29:00,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911306157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:00,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9435264] [2025-03-04 11:29:00,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:29:00,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:00,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:00,886 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:00,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:29:00,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 173 statements into 17 equivalence classes. [2025-03-04 11:29:00,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 137 of 173 statements. [2025-03-04 11:29:00,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:29:00,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:00,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 11:29:00,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2025-03-04 11:29:01,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2025-03-04 11:29:01,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9435264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:01,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:01,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 17] total 31 [2025-03-04 11:29:01,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785130568] [2025-03-04 11:29:01,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:01,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 11:29:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:01,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 11:29:01,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:29:01,995 INFO L87 Difference]: Start difference. First operand 214 states and 237 transitions. Second operand has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 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-04 11:29:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:02,065 INFO L93 Difference]: Finished difference Result 215 states and 237 transitions. [2025-03-04 11:29:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:29:02,065 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 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 173 [2025-03-04 11:29:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:02,066 INFO L225 Difference]: With dead ends: 215 [2025-03-04 11:29:02,066 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 11:29:02,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 330 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:29:02,067 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:02,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 118 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 11:29:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-04 11:29:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 170 states have (on average 1.035294117647059) internal successors, (176), 171 states have internal predecessors, (176), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 11:29:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 233 transitions. [2025-03-04 11:29:02,077 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 233 transitions. Word has length 173 [2025-03-04 11:29:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:02,078 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 233 transitions. [2025-03-04 11:29:02,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 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-04 11:29:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 233 transitions. [2025-03-04 11:29:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-04 11:29:02,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:02,082 INFO L218 NwaCegarLoop]: trace histogram [44, 40, 36, 23, 23, 23, 23, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1, 1] [2025-03-04 11:29:02,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:29:02,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:29:02,283 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:02,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:02,283 INFO L85 PathProgramCache]: Analyzing trace with hash -279767691, now seen corresponding path program 4 times [2025-03-04 11:29:02,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:02,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843209084] [2025-03-04 11:29:02,283 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:29:02,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:02,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 416 statements into 2 equivalence classes. [2025-03-04 11:29:02,332 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 416 of 416 statements. [2025-03-04 11:29:02,332 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:29:02,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4239 trivial. 0 not checked. [2025-03-04 11:29:04,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:04,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843209084] [2025-03-04 11:29:04,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843209084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:04,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106942877] [2025-03-04 11:29:04,146 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:29:04,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:04,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:04,148 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:04,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:29:04,200 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 416 statements into 2 equivalence classes. [2025-03-04 11:29:04,258 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 416 of 416 statements. [2025-03-04 11:29:04,258 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:29:04,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:04,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-04 11:29:04,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4239 trivial. 0 not checked. [2025-03-04 11:29:04,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 4007 trivial. 0 not checked. [2025-03-04 11:29:09,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106942877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:09,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:09,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2025-03-04 11:29:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132226373] [2025-03-04 11:29:09,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:09,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-04 11:29:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:09,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 11:29:09,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 11:29:09,526 INFO L87 Difference]: Start difference. First operand 214 states and 233 transitions. Second operand has 41 states, 40 states have (on average 2.625) internal successors, (105), 41 states have internal predecessors, (105), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2025-03-04 11:29:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:09,609 INFO L93 Difference]: Finished difference Result 215 states and 233 transitions. [2025-03-04 11:29:09,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:29:09,609 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.625) internal successors, (105), 41 states have internal predecessors, (105), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) Word has length 416 [2025-03-04 11:29:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:09,611 INFO L225 Difference]: With dead ends: 215 [2025-03-04 11:29:09,611 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 11:29:09,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 810 SyntacticMatches, 62 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 11:29:09,612 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:09,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 196 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:09,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 11:29:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-04 11:29:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 170 states have (on average 1.0176470588235293) internal successors, (173), 171 states have internal predecessors, (173), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 11:29:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 230 transitions. [2025-03-04 11:29:09,620 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 230 transitions. Word has length 416 [2025-03-04 11:29:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:09,621 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 230 transitions. [2025-03-04 11:29:09,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.625) internal successors, (105), 41 states have internal predecessors, (105), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2025-03-04 11:29:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 230 transitions. [2025-03-04 11:29:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2025-03-04 11:29:09,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:09,640 INFO L218 NwaCegarLoop]: trace histogram [110, 108, 89, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1, 1] [2025-03-04 11:29:09,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:09,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:29:09,844 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:09,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash -417071150, now seen corresponding path program 5 times [2025-03-04 11:29:09,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:09,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088932984] [2025-03-04 11:29:09,845 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:09,867 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1071 statements into 76 equivalence classes. [2025-03-04 11:29:09,979 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) and asserted 1071 of 1071 statements. [2025-03-04 11:29:09,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2025-03-04 11:29:09,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 7588 proven. 10182 refuted. 0 times theorem prover too weak. 24164 trivial. 0 not checked. [2025-03-04 11:29:23,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:23,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088932984] [2025-03-04 11:29:23,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088932984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:23,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339522014] [2025-03-04 11:29:23,069 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:23,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:23,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:23,071 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:23,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:29:23,199 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1071 statements into 76 equivalence classes. [2025-03-04 11:29:23,419 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) and asserted 1071 of 1071 statements. [2025-03-04 11:29:23,419 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2025-03-04 11:29:23,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:23,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1998 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-03-04 11:29:23,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 27393 trivial. 0 not checked. [2025-03-04 11:29:24,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 7863 proven. 7392 refuted. 0 times theorem prover too weak. 26679 trivial. 0 not checked. [2025-03-04 11:29:55,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339522014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:55,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:55,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24, 41] total 61 [2025-03-04 11:29:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485438230] [2025-03-04 11:29:55,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:55,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-04 11:29:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:55,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-04 11:29:55,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=2929, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 11:29:55,249 INFO L87 Difference]: Start difference. First operand 214 states and 230 transitions. Second operand has 62 states, 61 states have (on average 2.5901639344262297) internal successors, (158), 62 states have internal predecessors, (158), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (43), 43 states have call predecessors, (43), 16 states have call successors, (43) [2025-03-04 11:29:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:55,358 INFO L93 Difference]: Finished difference Result 214 states and 230 transitions. [2025-03-04 11:29:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 11:29:55,359 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.5901639344262297) internal successors, (158), 62 states have internal predecessors, (158), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (43), 43 states have call predecessors, (43), 16 states have call successors, (43) Word has length 1071 [2025-03-04 11:29:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:55,362 INFO L225 Difference]: With dead ends: 214 [2025-03-04 11:29:55,362 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:29:55,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2359 GetRequests, 2105 SyntacticMatches, 192 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=916, Invalid=3116, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 11:29:55,364 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:55,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:29:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:29:55,365 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-04 11:29:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:29:55,365 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1071 [2025-03-04 11:29:55,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:55,365 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:29:55,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.5901639344262297) internal successors, (158), 62 states have internal predecessors, (158), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (43), 43 states have call predecessors, (43), 16 states have call successors, (43) [2025-03-04 11:29:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:29:55,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:29:55,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-04 11:29:55,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-04 11:29:55,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-04 11:29:55,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-04 11:29:55,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-04 11:29:55,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-04 11:29:55,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:29:55,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:29:55,571 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 2, 1, 1, 1, 1, 1] [2025-03-04 11:29:55,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:29:56,412 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:29:56,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:29:56 BoogieIcfgContainer [2025-03-04 11:29:56,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:29:56,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:29:56,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:29:56,416 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:29:56,417 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:51" (3/4) ... [2025-03-04 11:29:56,418 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:29:56,422 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo [2025-03-04 11:29:56,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:29:56,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:29:56,425 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:29:56,425 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:29:56,471 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:29:56,472 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:29:56,472 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:29:56,472 INFO L158 Benchmark]: Toolchain (without parser) took 65591.60ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 106.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 506.6MB. Max. memory is 16.1GB. [2025-03-04 11:29:56,473 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:56,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.42ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 95.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:29:56,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.28ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:56,473 INFO L158 Benchmark]: Boogie Preprocessor took 27.56ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.4MB in the end (delta: 787.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:56,473 INFO L158 Benchmark]: IcfgBuilder took 179.98ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 82.9MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:29:56,474 INFO L158 Benchmark]: TraceAbstraction took 65155.83ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 81.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 481.4MB. Max. memory is 16.1GB. [2025-03-04 11:29:56,474 INFO L158 Benchmark]: Witness Printer took 55.75ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:56,477 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.25ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.42ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 95.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.28ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.56ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.4MB in the end (delta: 787.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 179.98ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 82.9MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 65155.83ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 81.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 481.4MB. Max. memory is 16.1GB. * Witness Printer took 55.75ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 3.9MB). There was no memory consumed. 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, 32 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 64.3s, OverallIterations: 16, TraceHistogramMax: 110, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1689 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1656 mSDsluCounter, 2984 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2490 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3964 IncrementalHoareTripleChecker+Invalid, 4356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 494 mSDtfsCounter, 3964 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5061 GetRequests, 4369 SyntacticMatches, 327 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11745 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=380occurred in iteration=9, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 172 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 57.0s InterpolantComputationTime, 4786 NumberOfCodeBlocks, 4574 NumberOfCodeBlocksAsserted, 214 NumberOfCheckSat, 6948 ConstructedInterpolants, 0 QuantifiedInterpolants, 16288 SizeOfPredicates, 30 NumberOfNonLiveVariables, 4346 ConjunctsInSsa, 437 ConjunctsInUnsatCore, 38 InterpolantComputations, 6 PerfectInterpolantSequences, 123709/154389 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-04 11:29:56,492 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