./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:29:00,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:29:00,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:29:00,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:29:00,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:29:00,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:29:00,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:29:00,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:29:00,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:29:00,645 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:29:00,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:29:00,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:29:00,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:29:00,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:29:00,646 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:29:00,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:29:00,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:29:00,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:29:00,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:29:00,647 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:29:00,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:29:00,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:29:00,648 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:29:00,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:29:00,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:29:00,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:29:00,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:29:00,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:29:00,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:29:00,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:29:00,648 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 -> 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 [2025-03-04 11:29:00,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:29:00,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:29:00,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:29:00,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:29:00,842 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:29:00,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2025-03-04 11:29:01,946 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e04c31d/e9f71ea7289c436197aa2e832b42a379/FLAG4b2e3d9d9 [2025-03-04 11:29:02,160 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:29:02,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2025-03-04 11:29:02,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e04c31d/e9f71ea7289c436197aa2e832b42a379/FLAG4b2e3d9d9 [2025-03-04 11:29:02,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e04c31d/e9f71ea7289c436197aa2e832b42a379 [2025-03-04 11:29:02,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:29:02,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:29:02,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:29:02,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:29:02,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:29:02,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02, skipping insertion in model container [2025-03-04 11:29:02,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:29:02,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:29:02,320 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:29:02,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:29:02,336 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:29:02,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02 WrapperNode [2025-03-04 11:29:02,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:29:02,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:29:02,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:29:02,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:29:02,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,361 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-04 11:29:02,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:29:02,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:29:02,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:29:02,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:29:02,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,376 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:29:02,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:29:02,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:29:02,382 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:29:02,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:29:02,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:29:02,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:02,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:29:02,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:29:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:29:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:29:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-03-04 11:29:02,430 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-03-04 11:29:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-03-04 11:29:02,430 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-03-04 11:29:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:29:02,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:29:02,471 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:29:02,472 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:29:02,559 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2025-03-04 11:29:02,588 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2025-03-04 11:29:02,602 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-04 11:29:02,602 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:29:02,612 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:29:02,612 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:29:02,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:29:02 BoogieIcfgContainer [2025-03-04 11:29:02,612 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:29:02,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:29:02,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:29:02,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:29:02,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:29:02" (1/3) ... [2025-03-04 11:29:02,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d9b739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:29:02, skipping insertion in model container [2025-03-04 11:29:02,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (2/3) ... [2025-03-04 11:29:02,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d9b739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:29:02, skipping insertion in model container [2025-03-04 11:29:02,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:29:02" (3/3) ... [2025-03-04 11:29:02,621 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2025-03-04 11:29:02,632 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:29:02,633 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_2calls_5-1.c that has 3 procedures, 53 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-04 11:29:02,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:29:02,677 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;@5a653a22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:29:02,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 11:29:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 45 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:29:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:29:02,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:02,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:02,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:02,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1954105288, now seen corresponding path program 1 times [2025-03-04 11:29:02,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:02,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689670048] [2025-03-04 11:29:02,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:02,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:02,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:29:02,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:29:02,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:02,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:02,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689670048] [2025-03-04 11:29:02,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689670048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:02,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:02,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:29:02,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929517882] [2025-03-04 11:29:02,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:02,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:29:02,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:02,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:29:02,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:29:02,808 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 45 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:02,841 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-03-04 11:29:02,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:29:02,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:29:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:02,847 INFO L225 Difference]: With dead ends: 59 [2025-03-04 11:29:02,847 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 11:29:02,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:29:02,850 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 11 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:02,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 92 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 11:29:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-04 11:29:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 36 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:29:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-04 11:29:02,876 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 7 [2025-03-04 11:29:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:02,876 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-04 11:29:02,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-04 11:29:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:29:02,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:02,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:02,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:29:02,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:02,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:02,878 INFO L85 PathProgramCache]: Analyzing trace with hash -447721764, now seen corresponding path program 1 times [2025-03-04 11:29:02,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:02,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790166629] [2025-03-04 11:29:02,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:02,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:02,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:29:02,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:29:02,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:02,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:02,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:02,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790166629] [2025-03-04 11:29:02,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790166629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:02,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:02,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:02,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140259022] [2025-03-04 11:29:02,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:02,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:02,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:02,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:02,924 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:02,980 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-03-04 11:29:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:02,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 11:29:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:02,982 INFO L225 Difference]: With dead ends: 64 [2025-03-04 11:29:02,982 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 11:29:02,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:29:02,983 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:02,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 11:29:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-04 11:29:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 46 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:29:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-03-04 11:29:02,992 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 8 [2025-03-04 11:29:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:02,992 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-03-04 11:29:02,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-03-04 11:29:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 11:29:02,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:02,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:02,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:29:02,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:02,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:02,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2145956475, now seen corresponding path program 1 times [2025-03-04 11:29:02,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:02,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272384111] [2025-03-04 11:29:02,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:02,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:02,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 11:29:03,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 11:29:03,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:03,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:03,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:03,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272384111] [2025-03-04 11:29:03,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272384111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:03,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:03,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:29:03,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509787475] [2025-03-04 11:29:03,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:03,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:29:03,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:03,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:29:03,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:29:03,039 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:03,059 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-03-04 11:29:03,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:29:03,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 11:29:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:03,060 INFO L225 Difference]: With dead ends: 58 [2025-03-04 11:29:03,060 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 11:29:03,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:29:03,061 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:03,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 72 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:03,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 11:29:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-04 11:29:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 44 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:29:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-03-04 11:29:03,068 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 13 [2025-03-04 11:29:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:03,068 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-03-04 11:29:03,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-03-04 11:29:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:29:03,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:03,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:03,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:29:03,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:03,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:03,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2100141288, now seen corresponding path program 1 times [2025-03-04 11:29:03,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:03,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168805865] [2025-03-04 11:29:03,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:03,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:03,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:29:03,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:29:03,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:03,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:03,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:03,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168805865] [2025-03-04 11:29:03,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168805865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:03,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:03,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:29:03,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144030922] [2025-03-04 11:29:03,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:03,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:29:03,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:03,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:29:03,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:29:03,176 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:03,295 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-03-04 11:29:03,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:29:03,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 11:29:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:03,297 INFO L225 Difference]: With dead ends: 58 [2025-03-04 11:29:03,298 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 11:29:03,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:29:03,299 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:03,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 102 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 11:29:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-03-04 11:29:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 40 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:29:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-04 11:29:03,306 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 14 [2025-03-04 11:29:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:03,306 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-04 11:29:03,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-04 11:29:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:29:03,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:03,307 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:03,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:29:03,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:03,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:03,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1831817774, now seen corresponding path program 1 times [2025-03-04 11:29:03,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:03,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482098139] [2025-03-04 11:29:03,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:03,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:03,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:29:03,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:29:03,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:03,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:29:03,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:03,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482098139] [2025-03-04 11:29:03,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482098139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:03,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:03,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806283686] [2025-03-04 11:29:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:03,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:03,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:03,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:03,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:03,399 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:03,429 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-03-04 11:29:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:03,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-04 11:29:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:03,431 INFO L225 Difference]: With dead ends: 74 [2025-03-04 11:29:03,431 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 11:29:03,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:03,432 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:03,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 11:29:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-03-04 11:29:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-04 11:29:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-03-04 11:29:03,438 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 23 [2025-03-04 11:29:03,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:03,438 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-03-04 11:29:03,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-03-04 11:29:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:29:03,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:03,443 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:03,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:29:03,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:03,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash -631666365, now seen corresponding path program 1 times [2025-03-04 11:29:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:03,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000908952] [2025-03-04 11:29:03,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:03,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:29:03,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:29:03,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:03,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:29:03,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:03,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000908952] [2025-03-04 11:29:03,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000908952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:03,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756991865] [2025-03-04 11:29:03,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:03,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:03,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:03,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:03,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:29:03,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:29:03,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:29:03,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:03,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:29:03,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:03,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:03,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756991865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:03,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:03,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-03-04 11:29:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56972468] [2025-03-04 11:29:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:03,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:29:03,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:03,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:29:03,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:29:03,653 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:03,744 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2025-03-04 11:29:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:29:03,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-04 11:29:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:03,745 INFO L225 Difference]: With dead ends: 117 [2025-03-04 11:29:03,745 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 11:29:03,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:29:03,746 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:03,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 176 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 11:29:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-04 11:29:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.2) internal successors, (54), 49 states have internal predecessors, (54), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 11:29:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2025-03-04 11:29:03,755 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 24 [2025-03-04 11:29:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:03,755 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-03-04 11:29:03,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2025-03-04 11:29:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:29:03,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:03,756 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:03,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:29:03,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 11:29:03,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:03,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2003454357, now seen corresponding path program 1 times [2025-03-04 11:29:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:03,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071601974] [2025-03-04 11:29:03,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:03,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:03,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:29:03,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:29:03,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:03,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:29:04,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:04,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071601974] [2025-03-04 11:29:04,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071601974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:04,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:04,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737130206] [2025-03-04 11:29:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:04,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:04,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:04,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:04,016 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:04,045 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2025-03-04 11:29:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:04,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-04 11:29:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:04,046 INFO L225 Difference]: With dead ends: 75 [2025-03-04 11:29:04,047 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 11:29:04,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:04,047 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:04,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 148 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 11:29:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2025-03-04 11:29:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 56 states have internal predecessors, (61), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-04 11:29:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-03-04 11:29:04,057 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 29 [2025-03-04 11:29:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:04,057 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-03-04 11:29:04,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-03-04 11:29:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:29:04,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:04,058 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:04,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:29:04,058 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:04,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:04,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1424432597, now seen corresponding path program 1 times [2025-03-04 11:29:04,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:04,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983229608] [2025-03-04 11:29:04,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:04,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:04,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:29:04,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:29:04,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:04,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:29:04,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983229608] [2025-03-04 11:29:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983229608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844568423] [2025-03-04 11:29:04,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:04,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:04,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:04,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:04,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:29:04,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:29:04,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:29:04,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:04,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:04,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:04,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:04,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:29:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844568423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:04,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:04,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 11:29:04,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679557620] [2025-03-04 11:29:04,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:04,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:29:04,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:04,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:29:04,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:29:04,379 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 19 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:29:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:04,722 INFO L93 Difference]: Finished difference Result 192 states and 253 transitions. [2025-03-04 11:29:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:29:04,722 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2025-03-04 11:29:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:04,723 INFO L225 Difference]: With dead ends: 192 [2025-03-04 11:29:04,723 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 11:29:04,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:29:04,725 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 122 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:04,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 651 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:29:04,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 11:29:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2025-03-04 11:29:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 92 states have internal predecessors, (103), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (28), 16 states have call predecessors, (28), 14 states have call successors, (28) [2025-03-04 11:29:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2025-03-04 11:29:04,737 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 30 [2025-03-04 11:29:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:04,737 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2025-03-04 11:29:04,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:29:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2025-03-04 11:29:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:29:04,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:04,738 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:04,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:29:04,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 11:29:04,939 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:04,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:04,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2119279126, now seen corresponding path program 2 times [2025-03-04 11:29:04,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:04,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459738833] [2025-03-04 11:29:04,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:04,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:04,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 11:29:04,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:29:04,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:04,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:29:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459738833] [2025-03-04 11:29:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459738833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778107075] [2025-03-04 11:29:05,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:05,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:05,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:05,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:05,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:29:05,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 11:29:05,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:29:05,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:05,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:29:05,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:29:05,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:05,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778107075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:05,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:05,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 11:29:05,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613726200] [2025-03-04 11:29:05,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:05,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:05,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:05,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:05,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:29:05,096 INFO L87 Difference]: Start difference. First operand 115 states and 146 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:05,119 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2025-03-04 11:29:05,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:05,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-04 11:29:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:05,121 INFO L225 Difference]: With dead ends: 127 [2025-03-04 11:29:05,121 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 11:29:05,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:29:05,121 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:05,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 140 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 11:29:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2025-03-04 11:29:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 95 states have internal predecessors, (109), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (28), 19 states have call predecessors, (28), 14 states have call successors, (28) [2025-03-04 11:29:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2025-03-04 11:29:05,137 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 152 transitions. Word has length 42 [2025-03-04 11:29:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:05,138 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 152 transitions. [2025-03-04 11:29:05,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 152 transitions. [2025-03-04 11:29:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 11:29:05,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:05,140 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:05,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:05,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:05,340 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:05,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:05,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1273143481, now seen corresponding path program 1 times [2025-03-04 11:29:05,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:05,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282098998] [2025-03-04 11:29:05,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:05,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:05,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:29:05,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:29:05,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:05,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:29:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282098998] [2025-03-04 11:29:05,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282098998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132082492] [2025-03-04 11:29:05,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:05,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:05,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:05,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:05,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:29:05,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:29:05,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:29:05,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:05,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:29:05,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:29:05,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:05,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132082492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:05,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:05,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 11:29:05,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723989532] [2025-03-04 11:29:05,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:05,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:29:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:05,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:29:05,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:29:05,477 INFO L87 Difference]: Start difference. First operand 121 states and 152 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:05,503 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2025-03-04 11:29:05,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:29:05,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-04 11:29:05,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:05,505 INFO L225 Difference]: With dead ends: 149 [2025-03-04 11:29:05,505 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 11:29:05,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:29:05,505 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:05,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 114 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 11:29:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2025-03-04 11:29:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 103 states have (on average 1.145631067961165) internal successors, (118), 103 states have internal predecessors, (118), 17 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (34), 22 states have call predecessors, (34), 16 states have call successors, (34) [2025-03-04 11:29:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 169 transitions. [2025-03-04 11:29:05,513 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 169 transitions. Word has length 43 [2025-03-04 11:29:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:05,514 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 169 transitions. [2025-03-04 11:29:05,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions. [2025-03-04 11:29:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:29:05,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:05,514 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:05,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:05,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:05,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:05,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:05,719 INFO L85 PathProgramCache]: Analyzing trace with hash -846190875, now seen corresponding path program 1 times [2025-03-04 11:29:05,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:05,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632170143] [2025-03-04 11:29:05,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:05,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:05,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:29:05,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:29:05,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:05,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 11:29:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632170143] [2025-03-04 11:29:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632170143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:05,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:05,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533347873] [2025-03-04 11:29:05,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:05,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:05,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:05,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:05,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:05,771 INFO L87 Difference]: Start difference. First operand 132 states and 169 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:05,802 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2025-03-04 11:29:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:05,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-03-04 11:29:05,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:05,804 INFO L225 Difference]: With dead ends: 148 [2025-03-04 11:29:05,804 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 11:29:05,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:05,804 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:05,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 154 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 11:29:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2025-03-04 11:29:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 100 states have (on average 1.15) internal successors, (115), 100 states have internal predecessors, (115), 16 states have call successors, (16), 6 states have call predecessors, (16), 8 states have return successors, (31), 21 states have call predecessors, (31), 15 states have call successors, (31) [2025-03-04 11:29:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 162 transitions. [2025-03-04 11:29:05,813 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 162 transitions. Word has length 44 [2025-03-04 11:29:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:05,813 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 162 transitions. [2025-03-04 11:29:05,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2025-03-04 11:29:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:29:05,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:05,814 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:05,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:29:05,814 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:05,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash -630583103, now seen corresponding path program 1 times [2025-03-04 11:29:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66897249] [2025-03-04 11:29:05,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:05,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:05,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:29:05,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:29:05,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:05,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 11:29:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66897249] [2025-03-04 11:29:05,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66897249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437544542] [2025-03-04 11:29:05,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:05,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:05,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:05,896 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:05,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:29:05,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:29:05,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:29:05,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:05,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:29:05,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:29:06,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:29:06,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437544542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:06,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:06,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 17 [2025-03-04 11:29:06,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242048151] [2025-03-04 11:29:06,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:06,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:29:06,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:06,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:29:06,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:29:06,186 INFO L87 Difference]: Start difference. First operand 128 states and 162 transitions. Second operand has 17 states, 16 states have (on average 4.25) internal successors, (68), 12 states have internal predecessors, (68), 8 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:29:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:06,505 INFO L93 Difference]: Finished difference Result 274 states and 368 transitions. [2025-03-04 11:29:06,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:29:06,506 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 12 states have internal predecessors, (68), 8 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 57 [2025-03-04 11:29:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:06,506 INFO L225 Difference]: With dead ends: 274 [2025-03-04 11:29:06,506 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 11:29:06,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:29:06,508 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 116 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:06,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 292 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 11:29:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2025-03-04 11:29:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 1.125) internal successors, (135), 121 states have internal predecessors, (135), 19 states have call successors, (19), 8 states have call predecessors, (19), 11 states have return successors, (35), 24 states have call predecessors, (35), 18 states have call successors, (35) [2025-03-04 11:29:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 189 transitions. [2025-03-04 11:29:06,521 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 189 transitions. Word has length 57 [2025-03-04 11:29:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:06,521 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 189 transitions. [2025-03-04 11:29:06,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 12 states have internal predecessors, (68), 8 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:29:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2025-03-04 11:29:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:29:06,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:06,522 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:06,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:06,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 11:29:06,723 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:06,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash 612165549, now seen corresponding path program 1 times [2025-03-04 11:29:06,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:06,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026664605] [2025-03-04 11:29:06,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:06,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:29:06,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:29:06,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:06,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:29:06,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026664605] [2025-03-04 11:29:06,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026664605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580578434] [2025-03-04 11:29:06,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:06,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:06,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:06,775 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:06,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:29:06,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:29:06,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:29:06,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:06,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:06,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:29:06,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:29:06,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:29:07,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580578434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:07,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:07,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15, 15] total 31 [2025-03-04 11:29:07,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598460159] [2025-03-04 11:29:07,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:07,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 11:29:07,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:07,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 11:29:07,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:29:07,175 INFO L87 Difference]: Start difference. First operand 154 states and 189 transitions. Second operand has 31 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 21 states have internal predecessors, (89), 14 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:29:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:07,673 INFO L93 Difference]: Finished difference Result 307 states and 389 transitions. [2025-03-04 11:29:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:29:07,674 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 21 states have internal predecessors, (89), 14 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2025-03-04 11:29:07,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:07,675 INFO L225 Difference]: With dead ends: 307 [2025-03-04 11:29:07,675 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 11:29:07,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1700, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 11:29:07,676 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 253 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:07,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 446 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:29:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 11:29:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2025-03-04 11:29:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.1203007518796992) internal successors, (149), 135 states have internal predecessors, (149), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (33), 26 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-04 11:29:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 203 transitions. [2025-03-04 11:29:07,684 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 203 transitions. Word has length 48 [2025-03-04 11:29:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:07,684 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 203 transitions. [2025-03-04 11:29:07,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 21 states have internal predecessors, (89), 14 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:29:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 203 transitions. [2025-03-04 11:29:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:29:07,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:07,685 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:07,690 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-04 11:29:07,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:07,886 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:07,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash 78284898, now seen corresponding path program 1 times [2025-03-04 11:29:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:07,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506321187] [2025-03-04 11:29:07,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:07,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:29:07,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:29:07,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:07,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:29:07,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:07,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506321187] [2025-03-04 11:29:07,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506321187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:07,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:07,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:07,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505633170] [2025-03-04 11:29:07,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:07,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:07,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:07,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:07,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:07,923 INFO L87 Difference]: Start difference. First operand 171 states and 203 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:29:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:07,942 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2025-03-04 11:29:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:07,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2025-03-04 11:29:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:07,943 INFO L225 Difference]: With dead ends: 176 [2025-03-04 11:29:07,944 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 11:29:07,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:07,944 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:07,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 140 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 11:29:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2025-03-04 11:29:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 136 states have internal predecessors, (150), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (33), 27 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-04 11:29:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2025-03-04 11:29:07,951 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 55 [2025-03-04 11:29:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:07,952 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2025-03-04 11:29:07,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:29:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2025-03-04 11:29:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:29:07,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:07,953 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:07,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:29:07,953 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:07,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1315847725, now seen corresponding path program 1 times [2025-03-04 11:29:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:07,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371812980] [2025-03-04 11:29:07,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:07,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:07,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:29:07,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:29:07,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:07,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:29:07,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:07,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371812980] [2025-03-04 11:29:07,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371812980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:07,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:07,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:07,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722466656] [2025-03-04 11:29:07,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:07,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:07,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:07,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:07,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:07,994 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:29:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:08,017 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2025-03-04 11:29:08,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:08,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-03-04 11:29:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:08,019 INFO L225 Difference]: With dead ends: 178 [2025-03-04 11:29:08,019 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 11:29:08,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:08,021 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:08,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 117 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 11:29:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2025-03-04 11:29:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 136 states have internal predecessors, (150), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (33), 27 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-04 11:29:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2025-03-04 11:29:08,032 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 56 [2025-03-04 11:29:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:08,032 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2025-03-04 11:29:08,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:29:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2025-03-04 11:29:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:29:08,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:08,033 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:08,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:29:08,033 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:08,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1868135450, now seen corresponding path program 1 times [2025-03-04 11:29:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:08,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735554476] [2025-03-04 11:29:08,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:08,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:29:08,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:29:08,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:29:08,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:08,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735554476] [2025-03-04 11:29:08,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735554476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:08,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:08,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:08,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598944092] [2025-03-04 11:29:08,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:08,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:08,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:08,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:08,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:08,081 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:29:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:08,111 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2025-03-04 11:29:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:08,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-03-04 11:29:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:08,112 INFO L225 Difference]: With dead ends: 178 [2025-03-04 11:29:08,113 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 11:29:08,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:08,114 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:08,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 140 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 11:29:08,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 169. [2025-03-04 11:29:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 132 states have (on average 1.106060606060606) internal successors, (146), 133 states have internal predecessors, (146), 20 states have call successors, (20), 9 states have call predecessors, (20), 13 states have return successors, (32), 26 states have call predecessors, (32), 19 states have call successors, (32) [2025-03-04 11:29:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2025-03-04 11:29:08,123 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 56 [2025-03-04 11:29:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:08,123 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2025-03-04 11:29:08,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:29:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2025-03-04 11:29:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:29:08,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:08,124 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:08,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 11:29:08,124 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:08,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:08,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2136573803, now seen corresponding path program 1 times [2025-03-04 11:29:08,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:08,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261457353] [2025-03-04 11:29:08,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:08,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:29:08,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:29:08,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:29:08,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261457353] [2025-03-04 11:29:08,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261457353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134428735] [2025-03-04 11:29:08,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:08,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:08,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:08,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:29:08,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:29:08,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:29:08,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:08,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:29:08,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:29:08,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134428735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:08,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:08,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2025-03-04 11:29:08,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639389480] [2025-03-04 11:29:08,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:08,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:29:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:08,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:29:08,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:29:08,316 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:29:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:08,377 INFO L93 Difference]: Finished difference Result 204 states and 244 transitions. [2025-03-04 11:29:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:29:08,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 57 [2025-03-04 11:29:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:08,378 INFO L225 Difference]: With dead ends: 204 [2025-03-04 11:29:08,378 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 11:29:08,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:29:08,379 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:08,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 241 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 11:29:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 179. [2025-03-04 11:29:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.1079136690647482) internal successors, (154), 141 states have internal predecessors, (154), 21 states have call successors, (21), 9 states have call predecessors, (21), 15 states have return successors, (39), 28 states have call predecessors, (39), 20 states have call successors, (39) [2025-03-04 11:29:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 214 transitions. [2025-03-04 11:29:08,390 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 214 transitions. Word has length 57 [2025-03-04 11:29:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:08,391 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 214 transitions. [2025-03-04 11:29:08,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:29:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 214 transitions. [2025-03-04 11:29:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 11:29:08,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:08,391 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:08,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:08,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:08,592 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:08,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:08,592 INFO L85 PathProgramCache]: Analyzing trace with hash -819029127, now seen corresponding path program 1 times [2025-03-04 11:29:08,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:08,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829629880] [2025-03-04 11:29:08,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:08,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 11:29:08,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 11:29:08,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 11:29:08,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:08,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829629880] [2025-03-04 11:29:08,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829629880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:08,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:08,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:08,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643969432] [2025-03-04 11:29:08,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:08,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:08,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:08,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:08,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:08,635 INFO L87 Difference]: Start difference. First operand 179 states and 214 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:29:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:08,657 INFO L93 Difference]: Finished difference Result 187 states and 222 transitions. [2025-03-04 11:29:08,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:08,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2025-03-04 11:29:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:08,658 INFO L225 Difference]: With dead ends: 187 [2025-03-04 11:29:08,658 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 11:29:08,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:08,659 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:08,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 11:29:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2025-03-04 11:29:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.0935251798561152) internal successors, (152), 141 states have internal predecessors, (152), 21 states have call successors, (21), 9 states have call predecessors, (21), 15 states have return successors, (39), 28 states have call predecessors, (39), 20 states have call successors, (39) [2025-03-04 11:29:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 212 transitions. [2025-03-04 11:29:08,670 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 212 transitions. Word has length 61 [2025-03-04 11:29:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:08,670 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 212 transitions. [2025-03-04 11:29:08,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:29:08,670 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 212 transitions. [2025-03-04 11:29:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 11:29:08,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:08,671 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:08,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 11:29:08,672 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:08,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash 865568913, now seen corresponding path program 1 times [2025-03-04 11:29:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:08,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431427974] [2025-03-04 11:29:08,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:08,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:29:08,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:29:08,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 11:29:08,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:08,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431427974] [2025-03-04 11:29:08,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431427974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:08,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571207836] [2025-03-04 11:29:08,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:08,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:08,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:08,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:29:08,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:29:08,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:29:08,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:08,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:08,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 11:29:08,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:29:09,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571207836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:09,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:09,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 25 [2025-03-04 11:29:09,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862064910] [2025-03-04 11:29:09,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:09,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 11:29:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:09,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 11:29:09,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:29:09,132 INFO L87 Difference]: Start difference. First operand 179 states and 212 transitions. Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 22 states have internal predecessors, (84), 10 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:29:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:09,739 INFO L93 Difference]: Finished difference Result 332 states and 390 transitions. [2025-03-04 11:29:09,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 11:29:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 22 states have internal predecessors, (84), 10 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) Word has length 74 [2025-03-04 11:29:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:09,740 INFO L225 Difference]: With dead ends: 332 [2025-03-04 11:29:09,740 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 11:29:09,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 11:29:09,742 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 132 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:09,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 291 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:29:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 11:29:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 166. [2025-03-04 11:29:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.0859375) internal successors, (139), 132 states have internal predecessors, (139), 20 states have call successors, (20), 9 states have call predecessors, (20), 14 states have return successors, (33), 24 states have call predecessors, (33), 19 states have call successors, (33) [2025-03-04 11:29:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2025-03-04 11:29:09,749 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 74 [2025-03-04 11:29:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:09,749 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2025-03-04 11:29:09,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 22 states have internal predecessors, (84), 10 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:29:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2025-03-04 11:29:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 11:29:09,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:09,750 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:09,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:09,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:09,950 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:09,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1573359769, now seen corresponding path program 1 times [2025-03-04 11:29:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167119661] [2025-03-04 11:29:09,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:09,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 11:29:09,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:29:09,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:09,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 11:29:10,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:10,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167119661] [2025-03-04 11:29:10,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167119661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:10,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758364949] [2025-03-04 11:29:10,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:10,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:10,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:10,044 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:10,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:29:10,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 11:29:10,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:29:10,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:10,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:10,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:29:10,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:29:10,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 11:29:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758364949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:10,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:10,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-04 11:29:10,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312306588] [2025-03-04 11:29:10,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:10,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:29:10,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:10,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:29:10,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:29:10,263 INFO L87 Difference]: Start difference. First operand 166 states and 192 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:29:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:10,425 INFO L93 Difference]: Finished difference Result 283 states and 324 transitions. [2025-03-04 11:29:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:29:10,425 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 70 [2025-03-04 11:29:10,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:10,426 INFO L225 Difference]: With dead ends: 283 [2025-03-04 11:29:10,426 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 11:29:10,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:29:10,427 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 79 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:10,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 293 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 11:29:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166. [2025-03-04 11:29:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.0859375) internal successors, (139), 132 states have internal predecessors, (139), 20 states have call successors, (20), 9 states have call predecessors, (20), 14 states have return successors, (31), 24 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-04 11:29:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 190 transitions. [2025-03-04 11:29:10,449 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 190 transitions. Word has length 70 [2025-03-04 11:29:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:10,449 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 190 transitions. [2025-03-04 11:29:10,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:29:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 190 transitions. [2025-03-04 11:29:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 11:29:10,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:10,451 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:10,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:10,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:10,652 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:10,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1909073672, now seen corresponding path program 1 times [2025-03-04 11:29:10,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:10,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326107431] [2025-03-04 11:29:10,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:10,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:10,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 11:29:10,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 11:29:10,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:10,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:29:10,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:10,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326107431] [2025-03-04 11:29:10,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326107431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:10,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148160969] [2025-03-04 11:29:10,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:10,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:10,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:10,719 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:10,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:29:10,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 11:29:10,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 11:29:10,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:10,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:10,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:10,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:29:10,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:29:10,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148160969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:10,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:10,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2025-03-04 11:29:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378471763] [2025-03-04 11:29:10,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:10,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:29:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:10,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:29:10,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:29:10,869 INFO L87 Difference]: Start difference. First operand 166 states and 190 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:29:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:10,947 INFO L93 Difference]: Finished difference Result 266 states and 301 transitions. [2025-03-04 11:29:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:29:10,948 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2025-03-04 11:29:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:10,948 INFO L225 Difference]: With dead ends: 266 [2025-03-04 11:29:10,948 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 11:29:10,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:29:10,949 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 66 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:10,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 214 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 11:29:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2025-03-04 11:29:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 126 states have (on average 1.0873015873015872) internal successors, (137), 131 states have internal predecessors, (137), 20 states have call successors, (20), 9 states have call predecessors, (20), 14 states have return successors, (30), 23 states have call predecessors, (30), 19 states have call successors, (30) [2025-03-04 11:29:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 187 transitions. [2025-03-04 11:29:10,958 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 187 transitions. Word has length 71 [2025-03-04 11:29:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:10,958 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 187 transitions. [2025-03-04 11:29:10,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:29:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2025-03-04 11:29:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 11:29:10,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:10,959 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:10,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:29:11,160 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,SelfDestructingSolverStorable20 [2025-03-04 11:29:11,160 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:11,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1673098567, now seen corresponding path program 1 times [2025-03-04 11:29:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:11,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889326996] [2025-03-04 11:29:11,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:11,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 11:29:11,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:29:11,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:11,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 17 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:29:11,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:11,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889326996] [2025-03-04 11:29:11,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889326996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:11,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888841006] [2025-03-04 11:29:11,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:11,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:11,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:11,317 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:11,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:29:11,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 11:29:11,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:29:11,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:11,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:11,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:29:11,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 11:29:11,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 11:29:11,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888841006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:11,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:11,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 11] total 30 [2025-03-04 11:29:11,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190306099] [2025-03-04 11:29:11,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:11,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 11:29:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:11,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 11:29:11,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:29:11,835 INFO L87 Difference]: Start difference. First operand 164 states and 187 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 27 states have internal predecessors, (102), 13 states have call successors, (16), 4 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-04 11:29:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:12,672 INFO L93 Difference]: Finished difference Result 324 states and 377 transitions. [2025-03-04 11:29:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 11:29:12,675 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 27 states have internal predecessors, (102), 13 states have call successors, (16), 4 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) Word has length 75 [2025-03-04 11:29:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:12,676 INFO L225 Difference]: With dead ends: 324 [2025-03-04 11:29:12,676 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 11:29:12,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=471, Invalid=3311, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 11:29:12,679 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 174 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:12,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 350 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:29:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 11:29:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 166. [2025-03-04 11:29:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 127 states have (on average 1.078740157480315) internal successors, (137), 133 states have internal predecessors, (137), 20 states have call successors, (20), 9 states have call predecessors, (20), 15 states have return successors, (30), 23 states have call predecessors, (30), 19 states have call successors, (30) [2025-03-04 11:29:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2025-03-04 11:29:12,690 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 75 [2025-03-04 11:29:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:12,690 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2025-03-04 11:29:12,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 27 states have internal predecessors, (102), 13 states have call successors, (16), 4 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-04 11:29:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2025-03-04 11:29:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 11:29:12,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:12,695 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:12,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:29:12,896 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,SelfDestructingSolverStorable21 [2025-03-04 11:29:12,896 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:12,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1729310121, now seen corresponding path program 1 times [2025-03-04 11:29:12,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:12,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180181491] [2025-03-04 11:29:12,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:12,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:12,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 11:29:12,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 11:29:12,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:12,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 11:29:12,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180181491] [2025-03-04 11:29:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180181491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559120703] [2025-03-04 11:29:12,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:12,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:12,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:12,967 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:12,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:29:12,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 11:29:13,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 11:29:13,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:13,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:13,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:29:13,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:29:13,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:29:13,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559120703] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:13,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:13,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 15 [2025-03-04 11:29:13,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747571342] [2025-03-04 11:29:13,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:13,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:29:13,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:13,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:29:13,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:29:13,283 INFO L87 Difference]: Start difference. First operand 166 states and 187 transitions. Second operand has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 11:29:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:13,442 INFO L93 Difference]: Finished difference Result 273 states and 311 transitions. [2025-03-04 11:29:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:29:13,443 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) Word has length 88 [2025-03-04 11:29:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:13,444 INFO L225 Difference]: With dead ends: 273 [2025-03-04 11:29:13,444 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 11:29:13,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 163 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:29:13,446 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 107 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:13,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 212 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 11:29:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-03-04 11:29:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 116 states have (on average 1.0689655172413792) internal successors, (124), 122 states have internal predecessors, (124), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (25), 20 states have call predecessors, (25), 17 states have call successors, (25) [2025-03-04 11:29:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2025-03-04 11:29:13,454 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 88 [2025-03-04 11:29:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:13,455 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2025-03-04 11:29:13,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 11:29:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2025-03-04 11:29:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 11:29:13,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:13,456 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:13,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:13,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 11:29:13,661 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:13,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:13,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1757801908, now seen corresponding path program 2 times [2025-03-04 11:29:13,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:13,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207485858] [2025-03-04 11:29:13,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:13,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 11:29:13,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 11:29:13,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:13,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:29:13,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:13,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207485858] [2025-03-04 11:29:13,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207485858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:13,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041694815] [2025-03-04 11:29:13,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:13,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:13,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:13,846 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:13,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:29:13,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 11:29:13,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 11:29:13,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:13,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:13,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:29:13,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:29:14,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:29:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041694815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:14,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 34 [2025-03-04 11:29:14,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224504084] [2025-03-04 11:29:14,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:14,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 11:29:14,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:14,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 11:29:14,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 11:29:14,413 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 35 states have internal predecessors, (95), 10 states have call successors, (12), 1 states have call predecessors, (12), 13 states have return successors, (21), 21 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-04 11:29:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:14,663 INFO L93 Difference]: Finished difference Result 187 states and 213 transitions. [2025-03-04 11:29:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 11:29:14,664 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 35 states have internal predecessors, (95), 10 states have call successors, (12), 1 states have call predecessors, (12), 13 states have return successors, (21), 21 states have call predecessors, (21), 10 states have call successors, (21) Word has length 89 [2025-03-04 11:29:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:14,665 INFO L225 Difference]: With dead ends: 187 [2025-03-04 11:29:14,665 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 11:29:14,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 154 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=1721, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 11:29:14,666 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:14,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 576 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 11:29:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 150. [2025-03-04 11:29:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 120 states have internal predecessors, (122), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (25), 20 states have call predecessors, (25), 17 states have call successors, (25) [2025-03-04 11:29:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2025-03-04 11:29:14,673 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 89 [2025-03-04 11:29:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:14,674 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2025-03-04 11:29:14,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 35 states have internal predecessors, (95), 10 states have call successors, (12), 1 states have call predecessors, (12), 13 states have return successors, (21), 21 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-04 11:29:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2025-03-04 11:29:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 11:29:14,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:14,675 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:14,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:14,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 11:29:14,875 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:14,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1342715685, now seen corresponding path program 1 times [2025-03-04 11:29:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:14,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720673336] [2025-03-04 11:29:14,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:14,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:14,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:29:14,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:29:14,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:14,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:29:15,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:15,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720673336] [2025-03-04 11:29:15,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720673336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:15,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115130839] [2025-03-04 11:29:15,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:15,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:15,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:15,061 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:15,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:29:15,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:29:15,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:29:15,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:15,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:15,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:29:15,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-04 11:29:15,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:29:15,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115130839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:15,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:15,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 33 [2025-03-04 11:29:15,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842376807] [2025-03-04 11:29:15,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:15,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 11:29:15,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:15,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 11:29:15,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:29:15,572 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 34 states have internal predecessors, (93), 9 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (20), 20 states have call predecessors, (20), 9 states have call successors, (20) [2025-03-04 11:29:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:15,693 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2025-03-04 11:29:15,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 11:29:15,693 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 34 states have internal predecessors, (93), 9 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (20), 20 states have call predecessors, (20), 9 states have call successors, (20) Word has length 90 [2025-03-04 11:29:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:15,694 INFO L225 Difference]: With dead ends: 171 [2025-03-04 11:29:15,694 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 11:29:15,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=1212, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 11:29:15,695 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:15,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 474 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 11:29:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 124. [2025-03-04 11:29:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 100 states have internal predecessors, (100), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2025-03-04 11:29:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2025-03-04 11:29:15,701 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 90 [2025-03-04 11:29:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:15,702 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2025-03-04 11:29:15,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 34 states have internal predecessors, (93), 9 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (20), 20 states have call predecessors, (20), 9 states have call successors, (20) [2025-03-04 11:29:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2025-03-04 11:29:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 11:29:15,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:15,703 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:15,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:15,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:15,907 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:15,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash 949222217, now seen corresponding path program 1 times [2025-03-04 11:29:15,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:15,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891752481] [2025-03-04 11:29:15,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:15,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 11:29:15,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 11:29:15,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:15,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 68 proven. 27 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:29:15,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:15,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891752481] [2025-03-04 11:29:15,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891752481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:15,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620740159] [2025-03-04 11:29:15,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:15,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:15,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:15,986 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:15,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:29:16,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 11:29:16,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 11:29:16,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:16,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:16,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:16,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 68 proven. 27 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:29:16,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 68 proven. 27 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:29:16,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620740159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:16,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:16,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2025-03-04 11:29:16,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194326744] [2025-03-04 11:29:16,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:16,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:29:16,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:16,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:29:16,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:29:16,284 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:29:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:16,403 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2025-03-04 11:29:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:29:16,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 124 [2025-03-04 11:29:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:16,404 INFO L225 Difference]: With dead ends: 137 [2025-03-04 11:29:16,404 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 11:29:16,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 242 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:29:16,405 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 60 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:16,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 138 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 11:29:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 11:29:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 98 states have internal predecessors, (98), 15 states have call successors, (15), 9 states have call predecessors, (15), 11 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2025-03-04 11:29:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2025-03-04 11:29:16,413 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 124 [2025-03-04 11:29:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:16,414 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2025-03-04 11:29:16,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:29:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2025-03-04 11:29:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 11:29:16,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:16,415 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:29:16,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:29:16,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 11:29:16,619 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:16,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:16,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1239986378, now seen corresponding path program 2 times [2025-03-04 11:29:16,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:16,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981883408] [2025-03-04 11:29:16,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:16,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 11:29:16,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 11:29:16,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:16,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 45 proven. 85 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-04 11:29:16,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:16,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981883408] [2025-03-04 11:29:16,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981883408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:16,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646846165] [2025-03-04 11:29:16,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:16,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:16,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:16,957 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:16,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:29:16,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 11:29:17,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 11:29:17,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:17,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:17,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 11:29:17,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 45 proven. 59 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 11:29:17,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 74 proven. 54 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-04 11:29:18,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646846165] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:18,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:18,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 22] total 44 [2025-03-04 11:29:18,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638212283] [2025-03-04 11:29:18,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:18,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 11:29:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:18,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 11:29:18,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1724, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 11:29:18,071 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 11 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2025-03-04 11:29:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:18,204 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2025-03-04 11:29:18,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 11:29:18,204 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 11 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) Word has length 143 [2025-03-04 11:29:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:18,205 INFO L225 Difference]: With dead ends: 147 [2025-03-04 11:29:18,205 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:29:18,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 257 SyntacticMatches, 13 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=1879, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 11:29:18,206 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:18,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 561 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:29:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:29:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:29:18,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2025-03-04 11:29:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:18,207 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:29:18,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 11 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2025-03-04 11:29:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:29:18,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:29:18,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-04 11:29:18,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-04 11:29:18,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-04 11:29:18,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-04 11:29:18,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-04 11:29:18,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-04 11:29:18,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-04 11:29:18,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-04 11:29:18,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-04 11:29:18,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-04 11:29:18,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-04 11:29:18,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-04 11:29:18,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:18,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 11:29:18,413 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:18,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:29:20,219 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:29:20,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:29:20 BoogieIcfgContainer [2025-03-04 11:29:20,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:29:20,224 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:29:20,224 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:29:20,224 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:29:20,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:29:02" (3/4) ... [2025-03-04 11:29:20,226 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:29:20,231 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo2 [2025-03-04 11:29:20,231 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo1 [2025-03-04 11:29:20,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:29:20,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:29:20,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:29:20,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:29:20,288 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:29:20,288 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:29:20,289 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:29:20,290 INFO L158 Benchmark]: Toolchain (without parser) took 18100.53ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 112.1MB in the beginning and 285.3MB in the end (delta: -173.2MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2025-03-04 11:29:20,290 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:20,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.83ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 101.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:29:20,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.51ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.2MB in the end (delta: 952.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:20,290 INFO L158 Benchmark]: Boogie Preprocessor took 19.36ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.3MB in the end (delta: 951.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:20,291 INFO L158 Benchmark]: IcfgBuilder took 230.11ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 86.8MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:29:20,291 INFO L158 Benchmark]: TraceAbstraction took 17608.96ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 85.9MB in the beginning and 293.3MB in the end (delta: -207.4MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. [2025-03-04 11:29:20,291 INFO L158 Benchmark]: Witness Printer took 65.14ms. Allocated memory is still 369.1MB. Free memory was 293.3MB in the beginning and 285.3MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:29:20,293 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.83ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 101.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.51ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.2MB in the end (delta: 952.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.36ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.3MB in the end (delta: 951.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 230.11ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 86.8MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17608.96ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 85.9MB in the beginning and 293.3MB in the end (delta: -207.4MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. * Witness Printer took 65.14ms. Allocated memory is still 369.1MB. Free memory was 293.3MB in the beginning and 285.3MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: 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 3 procedures, 53 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 27, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1363 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1308 mSDsluCounter, 6524 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5545 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6214 IncrementalHoareTripleChecker+Invalid, 6602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 979 mSDtfsCounter, 6214 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2420 GetRequests, 1911 SyntacticMatches, 69 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4449 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=17, InterpolantAutomatonStates: 328, 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, 27 MinimizatonAttempts, 299 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2616 NumberOfCodeBlocks, 2616 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3520 ConstructedInterpolants, 0 QuantifiedInterpolants, 7299 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2391 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 55 InterpolantComputations, 15 PerfectInterpolantSequences, 3109/3915 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 11:29:20,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE