./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_7-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17c70baee0bc6a4a26b6403fb6f46125ad9d7f8a7127109634f2327c61aaf5cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:45:41,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:45:41,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:45:41,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:45:41,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:45:41,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:45:41,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:45:41,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:45:41,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:45:41,089 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:45:41,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:45:41,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:45:41,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:45:41,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:45:41,089 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:45:41,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:45:41,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:45:41,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:45:41,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:45:41,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:45:41,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:45:41,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:45:41,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:45:41,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:45:41,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:45:41,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:45:41,091 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:45:41,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:45:41,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:45:41,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:45:41,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:45:41,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:45:41,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:45:41,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:45:41,092 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 -> 17c70baee0bc6a4a26b6403fb6f46125ad9d7f8a7127109634f2327c61aaf5cb [2025-03-17 15:45:41,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:45:41,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:45:41,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:45:41,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:45:41,315 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:45:41,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-1.c [2025-03-17 15:45:42,429 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd2ed5b2/2b7089ab66154811bd03e51dbb05114b/FLAGb1b9cff79 [2025-03-17 15:45:42,651 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:45:42,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-1.c [2025-03-17 15:45:42,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd2ed5b2/2b7089ab66154811bd03e51dbb05114b/FLAGb1b9cff79 [2025-03-17 15:45:43,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd2ed5b2/2b7089ab66154811bd03e51dbb05114b [2025-03-17 15:45:43,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:45:43,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:45:43,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:45:43,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:45:43,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:45:43,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b681047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43, skipping insertion in model container [2025-03-17 15:45:43,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:45:43,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:45:43,123 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:45:43,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:45:43,139 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:45:43,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43 WrapperNode [2025-03-17 15:45:43,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:45:43,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:45:43,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:45:43,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:45:43,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,155 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-17 15:45:43,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:45:43,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:45:43,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:45:43,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:45:43,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,166 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:45:43,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:45:43,170 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:45:43,170 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:45:43,170 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:45:43,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (1/1) ... [2025-03-17 15:45:43,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:45:43,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:43,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:45:43,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:45:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:45:43,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:45:43,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:45:43,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:45:43,208 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-03-17 15:45:43,208 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-03-17 15:45:43,242 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:45:43,244 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:45:43,345 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-03-17 15:45:43,362 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 15:45:43,362 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:45:43,371 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:45:43,372 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:45:43,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:43 BoogieIcfgContainer [2025-03-17 15:45:43,373 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:45:43,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:45:43,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:45:43,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:45:43,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:45:43" (1/3) ... [2025-03-17 15:45:43,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8d4507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:43, skipping insertion in model container [2025-03-17 15:45:43,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43" (2/3) ... [2025-03-17 15:45:43,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8d4507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:43, skipping insertion in model container [2025-03-17 15:45:43,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:43" (3/3) ... [2025-03-17 15:45:43,382 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_7-1.c [2025-03-17 15:45:43,394 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:45:43,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_7-1.c that has 2 procedures, 28 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-17 15:45:43,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:45:43,452 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;@2f2348a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:45:43,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 15:45:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:45:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:45:43,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:43,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:45:43,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:43,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1059215992, now seen corresponding path program 1 times [2025-03-17 15:45:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:43,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687998383] [2025-03-17 15:45:43,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:43,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:43,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:45:43,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:45:43,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:43,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:45:43,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:43,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687998383] [2025-03-17 15:45:43,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687998383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:43,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:45:43,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:45:43,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628453529] [2025-03-17 15:45:43,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:43,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:45:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:43,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:45:43,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:45:43,612 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:45:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:43,638 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-03-17 15:45:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:45:43,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 15:45:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:43,643 INFO L225 Difference]: With dead ends: 33 [2025-03-17 15:45:43,643 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 15:45:43,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:45:43,646 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:43,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 15:45:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-17 15:45:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-17 15:45:43,668 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2025-03-17 15:45:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:43,668 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-17 15:45:43,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:45:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-17 15:45:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:45:43,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:43,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:43,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:45:43,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:43,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:43,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1524042624, now seen corresponding path program 1 times [2025-03-17 15:45:43,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:43,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292145608] [2025-03-17 15:45:43,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:43,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:45:43,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:45:43,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:43,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:45:43,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:43,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292145608] [2025-03-17 15:45:43,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292145608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:43,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:45:43,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:45:43,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710427672] [2025-03-17 15:45:43,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:43,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:45:43,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:43,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:45:43,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:45:43,739 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:45:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:43,805 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-03-17 15:45:43,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:45:43,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 15:45:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:43,806 INFO L225 Difference]: With dead ends: 23 [2025-03-17 15:45:43,806 INFO L226 Difference]: Without dead ends: 21 [2025-03-17 15:45:43,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:45:43,806 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:43,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-17 15:45:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-17 15:45:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-17 15:45:43,810 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2025-03-17 15:45:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:43,810 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-17 15:45:43,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:45:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-03-17 15:45:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 15:45:43,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:43,810 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:43,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:45:43,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:43,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2052325840, now seen corresponding path program 1 times [2025-03-17 15:45:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:43,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508973124] [2025-03-17 15:45:43,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:43,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 15:45:43,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 15:45:43,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:43,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 15:45:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508973124] [2025-03-17 15:45:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508973124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:43,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:45:43,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:45:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370605958] [2025-03-17 15:45:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:43,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:45:43,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:43,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:45:43,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:45:43,944 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:43,978 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2025-03-17 15:45:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:45:43,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-17 15:45:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:43,979 INFO L225 Difference]: With dead ends: 33 [2025-03-17 15:45:43,979 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 15:45:43,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:45:43,980 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:43,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 15:45:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-03-17 15:45:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:45:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-17 15:45:43,986 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2025-03-17 15:45:43,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:43,986 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-17 15:45:43,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-17 15:45:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 15:45:43,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:43,987 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:43,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:45:43,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:43,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:43,987 INFO L85 PathProgramCache]: Analyzing trace with hash -407005887, now seen corresponding path program 1 times [2025-03-17 15:45:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:43,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081460536] [2025-03-17 15:45:43,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:43,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:43,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:45:43,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:45:43,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:43,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 15:45:44,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081460536] [2025-03-17 15:45:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081460536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630063154] [2025-03-17 15:45:44,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:44,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:44,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:44,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:44,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:45:44,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:45:44,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:45:44,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:44,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:44,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:45:44,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:45:44,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:45:44,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630063154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:44,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:44,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-17 15:45:44,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964024890] [2025-03-17 15:45:44,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:44,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 15:45:44,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:44,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 15:45:44,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:45:44,413 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:45:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:44,863 INFO L93 Difference]: Finished difference Result 177 states and 257 transitions. [2025-03-17 15:45:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 15:45:44,864 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2025-03-17 15:45:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:44,866 INFO L225 Difference]: With dead ends: 177 [2025-03-17 15:45:44,866 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 15:45:44,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-17 15:45:44,867 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 159 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:44,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 289 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:45:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 15:45:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 128. [2025-03-17 15:45:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 101 states have internal predecessors, (110), 17 states have call successors, (17), 5 states have call predecessors, (17), 10 states have return successors, (46), 21 states have call predecessors, (46), 16 states have call successors, (46) [2025-03-17 15:45:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 173 transitions. [2025-03-17 15:45:44,892 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 173 transitions. Word has length 29 [2025-03-17 15:45:44,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:44,892 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 173 transitions. [2025-03-17 15:45:44,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:45:44,892 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 173 transitions. [2025-03-17 15:45:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 15:45:44,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:44,893 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:44,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 15:45:45,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:45,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:45,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash -689209331, now seen corresponding path program 2 times [2025-03-17 15:45:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:45,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205011078] [2025-03-17 15:45:45,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:45,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 15:45:45,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:45:45,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:45,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 15:45:45,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:45,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205011078] [2025-03-17 15:45:45,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205011078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:45,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689255525] [2025-03-17 15:45:45,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:45,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:45,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:45,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:45,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:45:45,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 15:45:45,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:45:45,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:45,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:45,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:45:45,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 15:45:45,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:45:45,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689255525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:45,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:45:45,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-17 15:45:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133966097] [2025-03-17 15:45:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:45,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:45:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:45,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:45:45,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:45:45,262 INFO L87 Difference]: Start difference. First operand 128 states and 173 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:45,294 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2025-03-17 15:45:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:45:45,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-17 15:45:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:45,296 INFO L225 Difference]: With dead ends: 151 [2025-03-17 15:45:45,298 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 15:45:45,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:45:45,302 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:45,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 15:45:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2025-03-17 15:45:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.1037735849056605) internal successors, (117), 106 states have internal predecessors, (117), 17 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (55), 24 states have call predecessors, (55), 16 states have call successors, (55) [2025-03-17 15:45:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2025-03-17 15:45:45,321 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 41 [2025-03-17 15:45:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:45,321 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2025-03-17 15:45:45,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2025-03-17 15:45:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 15:45:45,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:45,323 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:45,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 15:45:45,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:45,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:45,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:45,529 INFO L85 PathProgramCache]: Analyzing trace with hash 109347199, now seen corresponding path program 1 times [2025-03-17 15:45:45,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:45,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139042055] [2025-03-17 15:45:45,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:45,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:45:45,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:45:45,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:45,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 15:45:45,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:45,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139042055] [2025-03-17 15:45:45,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139042055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:45,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898455046] [2025-03-17 15:45:45,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:45,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:45,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:45,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:45,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:45:45,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:45:45,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:45:45,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:45,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:45,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 15:45:45,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:45:45,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:45:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898455046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:46,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 21 [2025-03-17 15:45:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454279769] [2025-03-17 15:45:46,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:46,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 15:45:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:46,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 15:45:46,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:45:46,010 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 21 states, 19 states have (on average 3.210526315789474) internal successors, (61), 16 states have internal predecessors, (61), 10 states have call successors, (13), 7 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-17 15:45:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:46,658 INFO L93 Difference]: Finished difference Result 396 states and 604 transitions. [2025-03-17 15:45:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 15:45:46,659 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.210526315789474) internal successors, (61), 16 states have internal predecessors, (61), 10 states have call successors, (13), 7 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 42 [2025-03-17 15:45:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:46,662 INFO L225 Difference]: With dead ends: 396 [2025-03-17 15:45:46,663 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 15:45:46,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 15:45:46,669 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 162 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:46,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 383 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:45:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 15:45:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 231. [2025-03-17 15:45:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 182 states have (on average 1.0934065934065933) internal successors, (199), 180 states have internal predecessors, (199), 29 states have call successors, (29), 8 states have call predecessors, (29), 18 states have return successors, (111), 42 states have call predecessors, (111), 28 states have call successors, (111) [2025-03-17 15:45:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 339 transitions. [2025-03-17 15:45:46,726 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 339 transitions. Word has length 42 [2025-03-17 15:45:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:46,726 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 339 transitions. [2025-03-17 15:45:46,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.210526315789474) internal successors, (61), 16 states have internal predecessors, (61), 10 states have call successors, (13), 7 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-17 15:45:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 339 transitions. [2025-03-17 15:45:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 15:45:46,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:46,729 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:45:46,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:45:46,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:46,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:46,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash 228014093, now seen corresponding path program 1 times [2025-03-17 15:45:46,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:46,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142294548] [2025-03-17 15:45:46,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:46,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:45:46,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:45:46,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:46,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:46,997 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-17 15:45:46,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:46,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142294548] [2025-03-17 15:45:46,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142294548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:46,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:45:46,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:45:46,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788105558] [2025-03-17 15:45:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:46,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:45:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:46,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:45:46,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:45:46,998 INFO L87 Difference]: Start difference. First operand 231 states and 339 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:47,036 INFO L93 Difference]: Finished difference Result 245 states and 361 transitions. [2025-03-17 15:45:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:45:47,037 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 55 [2025-03-17 15:45:47,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:47,038 INFO L225 Difference]: With dead ends: 245 [2025-03-17 15:45:47,038 INFO L226 Difference]: Without dead ends: 244 [2025-03-17 15:45:47,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:45:47,039 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:47,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 80 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:47,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-17 15:45:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2025-03-17 15:45:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 188 states have (on average 1.0904255319148937) internal successors, (205), 185 states have internal predecessors, (205), 30 states have call successors, (30), 8 states have call predecessors, (30), 18 states have return successors, (117), 44 states have call predecessors, (117), 29 states have call successors, (117) [2025-03-17 15:45:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 352 transitions. [2025-03-17 15:45:47,067 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 352 transitions. Word has length 55 [2025-03-17 15:45:47,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:47,068 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 352 transitions. [2025-03-17 15:45:47,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:45:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 352 transitions. [2025-03-17 15:45:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 15:45:47,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:47,070 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] [2025-03-17 15:45:47,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:45:47,070 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:47,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1718104249, now seen corresponding path program 1 times [2025-03-17 15:45:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:47,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900496387] [2025-03-17 15:45:47,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:47,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 15:45:47,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:45:47,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:47,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:47,147 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-17 15:45:47,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:47,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900496387] [2025-03-17 15:45:47,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900496387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:47,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231035059] [2025-03-17 15:45:47,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:47,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:47,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:47,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:47,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:45:47,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 15:45:47,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:45:47,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:47,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:47,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:45:47,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 15:45:47,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 2 proven. 187 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 15:45:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231035059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:47,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:47,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 17, 17] total 21 [2025-03-17 15:45:47,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280003552] [2025-03-17 15:45:47,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:47,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 15:45:47,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:47,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 15:45:47,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:45:47,537 INFO L87 Difference]: Start difference. First operand 238 states and 352 transitions. Second operand has 21 states, 20 states have (on average 3.55) internal successors, (71), 15 states have internal predecessors, (71), 10 states have call successors, (14), 8 states have call predecessors, (14), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:45:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:47,936 INFO L93 Difference]: Finished difference Result 517 states and 795 transitions. [2025-03-17 15:45:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 15:45:47,937 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 15 states have internal predecessors, (71), 10 states have call successors, (14), 8 states have call predecessors, (14), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2025-03-17 15:45:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:47,940 INFO L225 Difference]: With dead ends: 517 [2025-03-17 15:45:47,940 INFO L226 Difference]: Without dead ends: 293 [2025-03-17 15:45:47,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 122 SyntacticMatches, 14 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2025-03-17 15:45:47,942 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 244 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:47,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 320 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:45:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-17 15:45:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 261. [2025-03-17 15:45:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 206 states have (on average 1.0922330097087378) internal successors, (225), 203 states have internal predecessors, (225), 33 states have call successors, (33), 9 states have call predecessors, (33), 20 states have return successors, (118), 48 states have call predecessors, (118), 32 states have call successors, (118) [2025-03-17 15:45:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 376 transitions. [2025-03-17 15:45:47,958 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 376 transitions. Word has length 73 [2025-03-17 15:45:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:47,959 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 376 transitions. [2025-03-17 15:45:47,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 15 states have internal predecessors, (71), 10 states have call successors, (14), 8 states have call predecessors, (14), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:45:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 376 transitions. [2025-03-17 15:45:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 15:45:47,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:47,960 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] [2025-03-17 15:45:47,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:45:48,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:48,164 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:48,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1808287255, now seen corresponding path program 2 times [2025-03-17 15:45:48,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:48,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105005660] [2025-03-17 15:45:48,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:48,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:48,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-17 15:45:48,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:45:48,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:48,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:48,226 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-17 15:45:48,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:48,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105005660] [2025-03-17 15:45:48,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105005660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:48,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377412714] [2025-03-17 15:45:48,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:48,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:48,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:48,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:48,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:45:48,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-17 15:45:48,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:45:48,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:48,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:48,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:45:48,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:48,294 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-17 15:45:48,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:48,338 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-17 15:45:48,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377412714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:48,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:48,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 15:45:48,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497548800] [2025-03-17 15:45:48,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:45:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:48,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:45:48,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:45:48,339 INFO L87 Difference]: Start difference. First operand 261 states and 376 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:45:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:48,390 INFO L93 Difference]: Finished difference Result 282 states and 401 transitions. [2025-03-17 15:45:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:45:48,390 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2025-03-17 15:45:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:48,392 INFO L225 Difference]: With dead ends: 282 [2025-03-17 15:45:48,392 INFO L226 Difference]: Without dead ends: 281 [2025-03-17 15:45:48,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:45:48,393 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:48,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-17 15:45:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 261. [2025-03-17 15:45:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 206 states have (on average 1.0922330097087378) internal successors, (225), 203 states have internal predecessors, (225), 33 states have call successors, (33), 9 states have call predecessors, (33), 20 states have return successors, (118), 48 states have call predecessors, (118), 32 states have call successors, (118) [2025-03-17 15:45:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 376 transitions. [2025-03-17 15:45:48,427 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 376 transitions. Word has length 73 [2025-03-17 15:45:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:48,428 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 376 transitions. [2025-03-17 15:45:48,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:45:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 376 transitions. [2025-03-17 15:45:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 15:45:48,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:48,429 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:45:48,435 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-17 15:45:48,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:48,630 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:48,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:48,630 INFO L85 PathProgramCache]: Analyzing trace with hash 222330037, now seen corresponding path program 1 times [2025-03-17 15:45:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:48,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185658665] [2025-03-17 15:45:48,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:48,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:48,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:45:48,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:45:48,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:48,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 101 proven. 91 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:45:48,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:48,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185658665] [2025-03-17 15:45:48,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185658665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:48,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969543390] [2025-03-17 15:45:48,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:45:48,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:48,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:48,818 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:48,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:45:48,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:45:48,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:45:48,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:45:48,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:48,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:45:48,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 101 proven. 91 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:45:48,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 101 proven. 91 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:45:49,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969543390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:49,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:49,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 18 [2025-03-17 15:45:49,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100044890] [2025-03-17 15:45:49,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:49,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 15:45:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:49,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 15:45:49,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:45:49,092 INFO L87 Difference]: Start difference. First operand 261 states and 376 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 12 states have internal predecessors, (56), 8 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:45:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:49,380 INFO L93 Difference]: Finished difference Result 488 states and 738 transitions. [2025-03-17 15:45:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 15:45:49,381 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 12 states have internal predecessors, (56), 8 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 74 [2025-03-17 15:45:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:49,382 INFO L225 Difference]: With dead ends: 488 [2025-03-17 15:45:49,382 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 15:45:49,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 139 SyntacticMatches, 14 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=265, Invalid=665, Unknown=0, NotChecked=0, Total=930 [2025-03-17 15:45:49,385 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 292 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:49,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 112 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:45:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 15:45:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 221. [2025-03-17 15:45:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 173 states have (on average 1.0867052023121386) internal successors, (188), 174 states have internal predecessors, (188), 28 states have call successors, (28), 9 states have call predecessors, (28), 18 states have return successors, (56), 37 states have call predecessors, (56), 27 states have call successors, (56) [2025-03-17 15:45:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 272 transitions. [2025-03-17 15:45:49,395 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 272 transitions. Word has length 74 [2025-03-17 15:45:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:49,395 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 272 transitions. [2025-03-17 15:45:49,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 12 states have internal predecessors, (56), 8 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:45:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 272 transitions. [2025-03-17 15:45:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 15:45:49,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:49,396 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:45:49,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 15:45:49,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:49,600 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:49,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1105062492, now seen corresponding path program 2 times [2025-03-17 15:45:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:49,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38340412] [2025-03-17 15:45:49,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:49,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:49,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-17 15:45:49,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:45:49,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:49,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 15:45:49,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:49,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38340412] [2025-03-17 15:45:49,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38340412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:49,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197965276] [2025-03-17 15:45:49,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:45:49,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:49,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:49,688 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:49,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:45:49,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-17 15:45:49,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:45:49,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:45:49,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:49,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:45:49,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-17 15:45:49,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 15:45:49,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197965276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:49,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:49,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-17 15:45:49,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348933210] [2025-03-17 15:45:49,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:49,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 15:45:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:49,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 15:45:49,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:45:49,894 INFO L87 Difference]: Start difference. First operand 221 states and 272 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:45:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:49,986 INFO L93 Difference]: Finished difference Result 239 states and 296 transitions. [2025-03-17 15:45:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 15:45:49,987 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 68 [2025-03-17 15:45:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:49,989 INFO L225 Difference]: With dead ends: 239 [2025-03-17 15:45:49,990 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 15:45:49,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:45:49,991 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:49,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:45:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 15:45:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 221. [2025-03-17 15:45:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 173 states have (on average 1.0635838150289016) internal successors, (184), 174 states have internal predecessors, (184), 28 states have call successors, (28), 9 states have call predecessors, (28), 18 states have return successors, (56), 37 states have call predecessors, (56), 27 states have call successors, (56) [2025-03-17 15:45:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2025-03-17 15:45:50,005 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 68 [2025-03-17 15:45:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:50,005 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2025-03-17 15:45:50,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:45:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2025-03-17 15:45:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 15:45:50,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:50,006 INFO L218 NwaCegarLoop]: trace histogram [11, 8, 7, 7, 7, 7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2025-03-17 15:45:50,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 15:45:50,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:50,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:50,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:50,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1137027628, now seen corresponding path program 3 times [2025-03-17 15:45:50,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:50,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889061830] [2025-03-17 15:45:50,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:45:50,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:50,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 9 equivalence classes. [2025-03-17 15:45:50,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 85 statements. [2025-03-17 15:45:50,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 15:45:50,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-17 15:45:50,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:50,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889061830] [2025-03-17 15:45:50,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889061830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:50,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097973705] [2025-03-17 15:45:50,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:45:50,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:50,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:50,245 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:50,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 15:45:50,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 9 equivalence classes. [2025-03-17 15:45:50,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 85 statements. [2025-03-17 15:45:50,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 15:45:50,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:50,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:45:50,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-17 15:45:50,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:45:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097973705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:45:50,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:45:50,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-17 15:45:50,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379764851] [2025-03-17 15:45:50,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:45:50,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:45:50,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:50,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:45:50,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:45:50,292 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-17 15:45:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:50,328 INFO L93 Difference]: Finished difference Result 348 states and 435 transitions. [2025-03-17 15:45:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:45:50,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 85 [2025-03-17 15:45:50,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:50,330 INFO L225 Difference]: With dead ends: 348 [2025-03-17 15:45:50,330 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 15:45:50,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 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-17 15:45:50,331 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:50,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 28 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 15:45:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2025-03-17 15:45:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.0825688073394495) internal successors, (118), 111 states have internal predecessors, (118), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 15:45:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2025-03-17 15:45:50,337 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 85 [2025-03-17 15:45:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:50,337 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2025-03-17 15:45:50,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-17 15:45:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2025-03-17 15:45:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 15:45:50,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:50,338 INFO L218 NwaCegarLoop]: trace histogram [12, 10, 8, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1] [2025-03-17 15:45:50,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 15:45:50,538 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-17 15:45:50,539 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:50,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:50,539 INFO L85 PathProgramCache]: Analyzing trace with hash -150797277, now seen corresponding path program 4 times [2025-03-17 15:45:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:50,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774570787] [2025-03-17 15:45:50,540 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:45:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:50,543 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-03-17 15:45:50,548 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 15:45:50,549 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:45:50,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-17 15:45:50,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:50,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774570787] [2025-03-17 15:45:50,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774570787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:50,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665046862] [2025-03-17 15:45:50,751 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:45:50,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:50,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:50,753 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:50,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 15:45:50,775 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-03-17 15:45:50,793 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 15:45:50,794 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:45:50,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:50,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 15:45:50,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 71 proven. 11 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-17 15:45:50,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 74 proven. 8 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-17 15:45:51,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665046862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:51,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:51,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2025-03-17 15:45:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457343299] [2025-03-17 15:45:51,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:51,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 15:45:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:51,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 15:45:51,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:45:51,102 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (14), 13 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-17 15:45:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:51,155 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2025-03-17 15:45:51,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:45:51,155 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (14), 13 states have call predecessors, (14), 7 states have call successors, (14) Word has length 100 [2025-03-17 15:45:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:51,156 INFO L225 Difference]: With dead ends: 139 [2025-03-17 15:45:51,156 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 15:45:51,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 190 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2025-03-17 15:45:51,157 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:51,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 155 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:45:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 15:45:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-17 15:45:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.036697247706422) internal successors, (113), 110 states have internal predecessors, (113), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 15:45:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2025-03-17 15:45:51,167 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 100 [2025-03-17 15:45:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:51,167 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2025-03-17 15:45:51,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (14), 13 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-17 15:45:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2025-03-17 15:45:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 15:45:51,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:51,169 INFO L218 NwaCegarLoop]: trace histogram [17, 14, 14, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1] [2025-03-17 15:45:51,176 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-17 15:45:51,374 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-17 15:45:51,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:51,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:51,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1484315816, now seen corresponding path program 3 times [2025-03-17 15:45:51,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:51,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144189832] [2025-03-17 15:45:51,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:45:51,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:51,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 154 statements into 14 equivalence classes. [2025-03-17 15:45:51,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 136 of 154 statements. [2025-03-17 15:45:51,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:45:51,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 78 proven. 189 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2025-03-17 15:45:51,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:51,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144189832] [2025-03-17 15:45:51,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144189832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:51,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657254335] [2025-03-17 15:45:51,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:45:51,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:51,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:51,850 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:51,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 15:45:51,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 154 statements into 14 equivalence classes. [2025-03-17 15:45:51,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 136 of 154 statements. [2025-03-17 15:45:51,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:45:51,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:51,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 15:45:51,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2025-03-17 15:45:52,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:45:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-03-17 15:45:53,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657254335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:45:53,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:45:53,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 17] total 31 [2025-03-17 15:45:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592809430] [2025-03-17 15:45:53,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:45:53,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 15:45:53,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:45:53,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 15:45:53,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2025-03-17 15:45:53,013 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 32 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 32 states have internal predecessors, (83), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-17 15:45:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:45:53,094 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2025-03-17 15:45:53,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 15:45:53,094 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 32 states have internal predecessors, (83), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) Word has length 154 [2025-03-17 15:45:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:45:53,095 INFO L225 Difference]: With dead ends: 139 [2025-03-17 15:45:53,095 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 15:45:53,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 292 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-17 15:45:53,096 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:45:53,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:45:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 15:45:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-17 15:45:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 15:45:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2025-03-17 15:45:53,102 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 154 [2025-03-17 15:45:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:45:53,102 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2025-03-17 15:45:53,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 32 states have internal predecessors, (83), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-17 15:45:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2025-03-17 15:45:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-03-17 15:45:53,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:45:53,105 INFO L218 NwaCegarLoop]: trace histogram [41, 40, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1] [2025-03-17 15:45:53,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 15:45:53,309 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-17 15:45:53,309 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:45:53,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:45:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash -634000396, now seen corresponding path program 4 times [2025-03-17 15:45:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:45:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178059020] [2025-03-17 15:45:53,310 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:45:53,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:45:53,318 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 397 statements into 2 equivalence classes. [2025-03-17 15:45:53,341 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 397 of 397 statements. [2025-03-17 15:45:53,341 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:45:53,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 3696 trivial. 0 not checked. [2025-03-17 15:45:55,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:45:55,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178059020] [2025-03-17 15:45:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178059020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:45:55,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387236487] [2025-03-17 15:45:55,252 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:45:55,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:45:55,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:45:55,254 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:45:55,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 15:45:55,306 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 397 statements into 2 equivalence classes. [2025-03-17 15:45:55,366 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 397 of 397 statements. [2025-03-17 15:45:55,367 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:45:55,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:45:55,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-17 15:45:55,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:45:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 3696 trivial. 0 not checked. [2025-03-17 15:45:55,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:46:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3464 trivial. 0 not checked. [2025-03-17 15:46:00,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387236487] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:46:00,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:46:00,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2025-03-17 15:46:00,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387726137] [2025-03-17 15:46:00,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:46:00,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-17 15:46:00,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:00,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-17 15:46:00,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 15:46:00,739 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 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-17 15:46:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:00,789 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2025-03-17 15:46:00,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 15:46:00,790 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 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 397 [2025-03-17 15:46:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:00,790 INFO L225 Difference]: With dead ends: 138 [2025-03-17 15:46:00,790 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:46:00,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 772 SyntacticMatches, 62 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 15:46:00,792 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:00,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:46:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:46:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:46:00,792 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 397 [2025-03-17 15:46:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:00,792 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:46:00,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 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-17 15:46:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:46:00,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:46:00,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 15:46:00,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 15:46:00,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 15:46:00,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 15:46:00,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 15:46:00,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 15:46:00,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 15:46:00,999 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-17 15:46:01,001 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 2, 1, 1, 1, 1, 1] [2025-03-17 15:46:01,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:46:01,597 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:46:01,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:46:01 BoogieIcfgContainer [2025-03-17 15:46:01,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:46:01,601 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:46:01,601 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:46:01,601 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:46:01,602 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:43" (3/4) ... [2025-03-17 15:46:01,603 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:46:01,607 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo [2025-03-17 15:46:01,608 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 15:46:01,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:46:01,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:46:01,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:46:01,658 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:46:01,658 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:46:01,658 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:46:01,659 INFO L158 Benchmark]: Toolchain (without parser) took 18654.12ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 132.8MB in the beginning and 345.3MB in the end (delta: -212.5MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2025-03-17 15:46:01,659 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:46:01,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 134.01ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 122.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:46:01,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.55ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 121.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:46:01,660 INFO L158 Benchmark]: Boogie Preprocessor took 13.58ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 120.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:46:01,661 INFO L158 Benchmark]: IcfgBuilder took 202.95ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 108.6MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:46:01,661 INFO L158 Benchmark]: TraceAbstraction took 18226.09ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 108.2MB in the beginning and 353.5MB in the end (delta: -245.3MB). Peak memory consumption was 263.8MB. Max. memory is 16.1GB. [2025-03-17 15:46:01,661 INFO L158 Benchmark]: Witness Printer took 56.88ms. Allocated memory is still 494.9MB. Free memory was 353.5MB in the beginning and 345.3MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:46:01,663 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.24ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 134.01ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 122.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.55ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 121.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.58ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 120.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 202.95ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 108.6MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18226.09ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 108.2MB in the beginning and 353.5MB in the end (delta: -245.3MB). Peak memory consumption was 263.8MB. Max. memory is 16.1GB. * Witness Printer took 56.88ms. Allocated memory is still 494.9MB. Free memory was 353.5MB in the beginning and 345.3MB in the end (delta: 8.2MB). 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, 28 locations, 35 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 15, TraceHistogramMax: 41, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 982 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 955 mSDsluCounter, 2081 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1698 mSDsCounter, 243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2883 IncrementalHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 243 mSolverCounterUnsat, 383 mSDtfsCounter, 2883 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2407 GetRequests, 2028 SyntacticMatches, 122 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3340 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=8, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 176 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 2362 NumberOfCodeBlocks, 2222 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 3337 ConstructedInterpolants, 0 QuantifiedInterpolants, 7341 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2192 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 35 InterpolantComputations, 6 PerfectInterpolantSequences, 19137/23646 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 15:46:01,678 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