./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-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_6-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 e0068f83ad7eb3861b59041e8ebf2a38df44c3a60c0fafaf2450f6b793a60fbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:29:13,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:29:13,150 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:13,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:29:13,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:29:13,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:29:13,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:29:13,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:29:13,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:29:13,170 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:29:13,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:29:13,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:29:13,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:29:13,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:29:13,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:29:13,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:29:13,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:29:13,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:29:13,172 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 -> e0068f83ad7eb3861b59041e8ebf2a38df44c3a60c0fafaf2450f6b793a60fbe [2025-03-04 11:29:13,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:29:13,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:29:13,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:29:13,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:29:13,403 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:29:13,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2025-03-04 11:29:14,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c34cf18a8/f32a6b54c3b24322b67b9b7849fa34a2/FLAG5a3cdcf29 [2025-03-04 11:29:14,791 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:29:14,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2025-03-04 11:29:14,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c34cf18a8/f32a6b54c3b24322b67b9b7849fa34a2/FLAG5a3cdcf29 [2025-03-04 11:29:15,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c34cf18a8/f32a6b54c3b24322b67b9b7849fa34a2 [2025-03-04 11:29:15,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:29:15,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:29:15,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:29:15,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:29:15,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:29:15,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:29:15" (1/1) ... [2025-03-04 11:29:15,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799be85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:15, skipping insertion in model container [2025-03-04 11:29:15,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:29:15" (1/1) ... [2025-03-04 11:29:15,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:29:15,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:29:15,250 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:29:15,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:29:15,274 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:29:15,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:15 WrapperNode [2025-03-04 11:29:15,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:29:15,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:29:15,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:29:15,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:29:15,280 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:15" (1/1) ... [2025-03-04 11:29:15,284 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:15" (1/1) ... [2025-03-04 11:29:15,294 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-04 11:29:15,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:29:15,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:29:15,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:29:15,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:29:15,302 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:15" (1/1) ... [2025-03-04 11:29:15,302 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:15" (1/1) ... [2025-03-04 11:29:15,305 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:15" (1/1) ... [2025-03-04 11:29:15,318 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:15,318 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:15" (1/1) ... [2025-03-04 11:29:15,319 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:15" (1/1) ... [2025-03-04 11:29:15,320 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:15" (1/1) ... [2025-03-04 11:29:15,321 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:15" (1/1) ... [2025-03-04 11:29:15,321 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:15" (1/1) ... [2025-03-04 11:29:15,322 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:15" (1/1) ... [2025-03-04 11:29:15,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:29:15,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:29:15,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:29:15,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:29:15,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:15" (1/1) ... [2025-03-04 11:29:15,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:29:15,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:15,351 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:15,353 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:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:29:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:29:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-03-04 11:29:15,371 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-03-04 11:29:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-03-04 11:29:15,371 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-03-04 11:29:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:29:15,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:29:15,406 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:29:15,407 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:29:15,484 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2025-03-04 11:29:15,510 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2025-03-04 11:29:15,516 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-04 11:29:15,516 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:29:15,523 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:29:15,523 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:29:15,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:29:15 BoogieIcfgContainer [2025-03-04 11:29:15,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:29:15,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:29:15,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:29:15,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:29:15,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:29:15" (1/3) ... [2025-03-04 11:29:15,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77455805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:29:15, skipping insertion in model container [2025-03-04 11:29:15,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:15" (2/3) ... [2025-03-04 11:29:15,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77455805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:29:15, skipping insertion in model container [2025-03-04 11:29:15,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:29:15" (3/3) ... [2025-03-04 11:29:15,530 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2025-03-04 11:29:15,539 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:29:15,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_2calls_6-1.c that has 3 procedures, 53 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-04 11:29:15,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:29:15,585 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;@4c3f3be5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:29:15,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 11:29:15,588 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:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:29:15,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:15,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:15,593 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:15,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:15,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1954105288, now seen corresponding path program 1 times [2025-03-04 11:29:15,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:15,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885460907] [2025-03-04 11:29:15,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:15,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:15,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:29:15,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:29:15,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:15,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:15,717 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:15,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:15,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885460907] [2025-03-04 11:29:15,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885460907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:15,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:15,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:29:15,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525966600] [2025-03-04 11:29:15,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:15,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:29:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:15,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:29:15,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:29:15,738 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:15,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:15,770 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-03-04 11:29:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:29:15,773 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:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:15,777 INFO L225 Difference]: With dead ends: 59 [2025-03-04 11:29:15,777 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 11:29:15,779 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:15,780 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:15,781 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:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 11:29:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-04 11:29:15,801 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:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-04 11:29:15,804 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 7 [2025-03-04 11:29:15,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:15,805 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-04 11:29:15,805 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:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-04 11:29:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:29:15,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:15,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:15,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:29:15,806 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:15,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:15,806 INFO L85 PathProgramCache]: Analyzing trace with hash -447721764, now seen corresponding path program 1 times [2025-03-04 11:29:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732260418] [2025-03-04 11:29:15,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:15,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:29:15,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:29:15,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:15,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:15,850 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:15,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:15,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732260418] [2025-03-04 11:29:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732260418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:15,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366214671] [2025-03-04 11:29:15,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:15,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:15,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:15,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:15,852 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:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:15,913 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-03-04 11:29:15,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:15,915 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:15,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:15,915 INFO L225 Difference]: With dead ends: 64 [2025-03-04 11:29:15,915 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 11:29:15,915 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:15,916 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:15,916 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:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 11:29:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-04 11:29:15,922 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:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-03-04 11:29:15,925 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 8 [2025-03-04 11:29:15,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:15,925 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-03-04 11:29:15,926 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:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-03-04 11:29:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 11:29:15,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:15,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:15,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:29:15,926 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:15,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2145956475, now seen corresponding path program 1 times [2025-03-04 11:29:15,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:15,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522433333] [2025-03-04 11:29:15,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:15,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:15,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 11:29:15,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 11:29:15,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:15,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:15,964 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:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:15,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522433333] [2025-03-04 11:29:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522433333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:29:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987929363] [2025-03-04 11:29:15,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:15,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:29:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:15,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:29:15,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:29:15,966 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:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:15,985 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-03-04 11:29:15,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:29:15,985 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:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:15,986 INFO L225 Difference]: With dead ends: 58 [2025-03-04 11:29:15,986 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 11:29:15,986 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:15,987 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:15,987 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:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 11:29:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-04 11:29:15,992 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:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-03-04 11:29:15,993 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 13 [2025-03-04 11:29:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:15,993 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-03-04 11:29:15,994 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:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-03-04 11:29:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:29:15,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:15,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:15,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:29:15,994 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:15,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:15,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2100141288, now seen corresponding path program 1 times [2025-03-04 11:29:15,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:15,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326836815] [2025-03-04 11:29:15,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:15,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:15,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:29:16,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:29:16,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:16,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:16,080 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:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:16,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326836815] [2025-03-04 11:29:16,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326836815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:16,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:29:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954055424] [2025-03-04 11:29:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:16,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:29:16,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:16,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:29:16,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:29:16,081 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:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:16,182 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-03-04 11:29:16,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:29:16,183 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:16,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:16,183 INFO L225 Difference]: With dead ends: 58 [2025-03-04 11:29:16,183 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 11:29:16,184 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:16,184 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:16,185 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:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 11:29:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-03-04 11:29:16,193 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:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-04 11:29:16,196 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 14 [2025-03-04 11:29:16,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:16,196 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-04 11:29:16,196 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:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-04 11:29:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:29:16,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:16,197 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:16,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:29:16,197 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:16,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1831817774, now seen corresponding path program 1 times [2025-03-04 11:29:16,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:16,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650655180] [2025-03-04 11:29:16,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:16,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:29:16,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:29:16,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:16,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:16,310 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:16,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:16,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650655180] [2025-03-04 11:29:16,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650655180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:16,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:16,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:16,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921812798] [2025-03-04 11:29:16,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:16,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:16,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:16,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:16,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:16,312 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:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:16,349 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-03-04 11:29:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:16,350 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:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:16,351 INFO L225 Difference]: With dead ends: 74 [2025-03-04 11:29:16,351 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 11:29:16,352 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:16,352 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:16,352 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:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 11:29:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-03-04 11:29:16,360 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:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-03-04 11:29:16,361 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 23 [2025-03-04 11:29:16,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:16,361 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-03-04 11:29:16,361 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:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-03-04 11:29:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:29:16,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:16,364 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:16,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:29:16,365 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:16,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:16,365 INFO L85 PathProgramCache]: Analyzing trace with hash -631666365, now seen corresponding path program 1 times [2025-03-04 11:29:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:16,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070405339] [2025-03-04 11:29:16,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:16,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:16,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:29:16,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:29:16,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:16,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:16,420 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:16,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:16,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070405339] [2025-03-04 11:29:16,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070405339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:16,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891129375] [2025-03-04 11:29:16,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:16,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:16,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:16,423 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:16,425 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:16,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:29:16,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:29:16,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:16,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:16,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:29:16,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:16,535 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:16,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:16,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891129375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:16,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:16,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-03-04 11:29:16,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141809010] [2025-03-04 11:29:16,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:16,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:29:16,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:16,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:29:16,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:29:16,536 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:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:16,652 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2025-03-04 11:29:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:29:16,653 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:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:16,653 INFO L225 Difference]: With dead ends: 117 [2025-03-04 11:29:16,653 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 11:29:16,654 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:16,654 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:16,654 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:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 11:29:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-04 11:29:16,659 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:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2025-03-04 11:29:16,659 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 24 [2025-03-04 11:29:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:16,659 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-03-04 11:29:16,659 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:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2025-03-04 11:29:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:29:16,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:16,660 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:16,665 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:16,860 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:16,860 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:16,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:16,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2003454357, now seen corresponding path program 1 times [2025-03-04 11:29:16,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:16,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036643252] [2025-03-04 11:29:16,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:16,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:16,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:29:16,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:29:16,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:16,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:16,929 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:16,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:16,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036643252] [2025-03-04 11:29:16,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036643252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:16,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:16,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943702288] [2025-03-04 11:29:16,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:16,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:16,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:16,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:16,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:16,931 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:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:16,962 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2025-03-04 11:29:16,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:16,962 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:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:16,963 INFO L225 Difference]: With dead ends: 75 [2025-03-04 11:29:16,963 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 11:29:16,963 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:16,964 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:16,964 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:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 11:29:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2025-03-04 11:29:16,972 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:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-03-04 11:29:16,973 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 29 [2025-03-04 11:29:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:16,973 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-03-04 11:29:16,973 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:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-03-04 11:29:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:29:16,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:16,974 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:16,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:29:16,974 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:16,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:16,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1424432597, now seen corresponding path program 1 times [2025-03-04 11:29:16,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:16,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898094929] [2025-03-04 11:29:16,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:16,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:16,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:29:16,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:29:16,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:16,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:17,051 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:17,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898094929] [2025-03-04 11:29:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898094929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101158182] [2025-03-04 11:29:17,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:17,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:17,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:17,054 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:17,055 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:17,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:29:17,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:29:17,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:17,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:17,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:17,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:17,168 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:17,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:17,312 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:17,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101158182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:17,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:17,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 11:29:17,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219547694] [2025-03-04 11:29:17,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:17,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:29:17,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:17,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:29:17,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:29:17,313 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:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:17,676 INFO L93 Difference]: Finished difference Result 192 states and 253 transitions. [2025-03-04 11:29:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:29:17,677 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:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:17,678 INFO L225 Difference]: With dead ends: 192 [2025-03-04 11:29:17,678 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 11:29:17,679 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:17,679 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 122 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:17,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 640 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:29:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 11:29:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2025-03-04 11:29:17,691 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, (27), 16 states have call predecessors, (27), 14 states have call successors, (27) [2025-03-04 11:29:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2025-03-04 11:29:17,693 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 30 [2025-03-04 11:29:17,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:17,693 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2025-03-04 11:29:17,693 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:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2025-03-04 11:29:17,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:29:17,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:17,696 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:17,701 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:17,899 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:17,899 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:17,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2119279126, now seen corresponding path program 2 times [2025-03-04 11:29:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:17,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895223333] [2025-03-04 11:29:17,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:17,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 11:29:17,912 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:17,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:17,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:17,990 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:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895223333] [2025-03-04 11:29:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895223333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940139355] [2025-03-04 11:29:17,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:17,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:17,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:17,994 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:17,994 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:18,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 11:29:18,025 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:18,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:18,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:18,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:29:18,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:18,072 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:18,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:18,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940139355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:18,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:18,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 11:29:18,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562175088] [2025-03-04 11:29:18,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:18,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:18,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:18,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:18,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:29:18,073 INFO L87 Difference]: Start difference. First operand 115 states and 145 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:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:18,094 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2025-03-04 11:29:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:18,094 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:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:18,095 INFO L225 Difference]: With dead ends: 124 [2025-03-04 11:29:18,095 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 11:29:18,096 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:18,096 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:18,096 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:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 11:29:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-03-04 11:29:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 94 states have internal predecessors, (107), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (27), 18 states have call predecessors, (27), 14 states have call successors, (27) [2025-03-04 11:29:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 149 transitions. [2025-03-04 11:29:18,105 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 149 transitions. Word has length 42 [2025-03-04 11:29:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:18,105 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 149 transitions. [2025-03-04 11:29:18,105 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:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 149 transitions. [2025-03-04 11:29:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 11:29:18,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:18,106 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:18,112 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:18,311 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:18,311 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:18,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:18,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1273143481, now seen corresponding path program 1 times [2025-03-04 11:29:18,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:18,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959365051] [2025-03-04 11:29:18,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:18,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:18,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:29:18,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:29:18,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:18,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:18,379 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:18,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:18,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959365051] [2025-03-04 11:29:18,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959365051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:18,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232472346] [2025-03-04 11:29:18,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:18,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:18,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:18,382 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:18,384 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:18,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:29:18,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:29:18,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:18,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:18,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:29:18,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:18,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:29:18,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232472346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:18,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:18,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 18 [2025-03-04 11:29:18,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514331746] [2025-03-04 11:29:18,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:18,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:29:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:18,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:29:18,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:29:18,705 INFO L87 Difference]: Start difference. First operand 119 states and 149 transitions. Second operand has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 14 states have internal predecessors, (61), 8 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:29:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:19,030 INFO L93 Difference]: Finished difference Result 287 states and 363 transitions. [2025-03-04 11:29:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:29:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 14 states have internal predecessors, (61), 8 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2025-03-04 11:29:19,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:19,033 INFO L225 Difference]: With dead ends: 287 [2025-03-04 11:29:19,033 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 11:29:19,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:29:19,034 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 113 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:19,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 650 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:19,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 11:29:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 162. [2025-03-04 11:29:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 127 states have internal predecessors, (146), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (40), 26 states have call predecessors, (40), 20 states have call successors, (40) [2025-03-04 11:29:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 207 transitions. [2025-03-04 11:29:19,054 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 207 transitions. Word has length 43 [2025-03-04 11:29:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:19,054 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 207 transitions. [2025-03-04 11:29:19,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 14 states have internal predecessors, (61), 8 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:29:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 207 transitions. [2025-03-04 11:29:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:29:19,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:19,055 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:19,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:29:19,258 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:19,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:19,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1523564695, now seen corresponding path program 1 times [2025-03-04 11:29:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881071969] [2025-03-04 11:29:19,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:19,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:29:19,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:29:19,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:19,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:19,315 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:19,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:19,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881071969] [2025-03-04 11:29:19,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881071969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:19,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070842680] [2025-03-04 11:29:19,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:19,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:19,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:19,317 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:19,322 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:19,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:29:19,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:29:19,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:19,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:29:19,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:19,380 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:19,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:19,426 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:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070842680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:19,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:19,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-04 11:29:19,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654649905] [2025-03-04 11:29:19,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:19,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:29:19,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:19,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:29:19,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:29:19,427 INFO L87 Difference]: Start difference. First operand 162 states and 207 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:29:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:19,515 INFO L93 Difference]: Finished difference Result 181 states and 237 transitions. [2025-03-04 11:29:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:29:19,515 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2025-03-04 11:29:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:19,516 INFO L225 Difference]: With dead ends: 181 [2025-03-04 11:29:19,516 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 11:29:19,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:29:19,517 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:19,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 300 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 11:29:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2025-03-04 11:29:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 130 states have (on average 1.146153846153846) internal successors, (149), 130 states have internal predecessors, (149), 21 states have call successors, (21), 8 states have call predecessors, (21), 11 states have return successors, (45), 27 states have call predecessors, (45), 20 states have call successors, (45) [2025-03-04 11:29:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2025-03-04 11:29:19,527 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 48 [2025-03-04 11:29:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:19,527 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2025-03-04 11:29:19,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:29:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2025-03-04 11:29:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 11:29:19,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:19,528 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, 1] [2025-03-04 11:29:19,534 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:19,729 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,SelfDestructingSolverStorable10 [2025-03-04 11:29:19,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:19,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1797262843, now seen corresponding path program 1 times [2025-03-04 11:29:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284420169] [2025-03-04 11:29:19,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:19,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:29:19,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:29:19,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:19,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:19,781 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:19,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:19,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284420169] [2025-03-04 11:29:19,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284420169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:19,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018732001] [2025-03-04 11:29:19,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:19,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:19,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:19,784 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:19,785 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:19,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:29:19,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:29:19,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:19,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:19,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:29:19,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:19,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:29:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018732001] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:20,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15, 15] total 20 [2025-03-04 11:29:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971530139] [2025-03-04 11:29:20,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:20,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:29:20,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:20,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:29:20,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:29:20,105 INFO L87 Difference]: Start difference. First operand 166 states and 215 transitions. Second operand has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 15 states have internal predecessors, (65), 9 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:29:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:20,445 INFO L93 Difference]: Finished difference Result 358 states and 465 transitions. [2025-03-04 11:29:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 11:29:20,445 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 15 states have internal predecessors, (65), 9 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 49 [2025-03-04 11:29:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:20,447 INFO L225 Difference]: With dead ends: 358 [2025-03-04 11:29:20,447 INFO L226 Difference]: Without dead ends: 213 [2025-03-04 11:29:20,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:29:20,450 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 144 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:20,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 716 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:29:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-04 11:29:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2025-03-04 11:29:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 153 states have (on average 1.1372549019607843) internal successors, (174), 151 states have internal predecessors, (174), 25 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (55), 33 states have call predecessors, (55), 24 states have call successors, (55) [2025-03-04 11:29:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 254 transitions. [2025-03-04 11:29:20,464 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 254 transitions. Word has length 49 [2025-03-04 11:29:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:20,464 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 254 transitions. [2025-03-04 11:29:20,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 15 states have internal predecessors, (65), 9 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:29:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2025-03-04 11:29:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 11:29:20,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:20,465 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:20,471 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:20,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:20,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:20,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash 379226588, now seen corresponding path program 1 times [2025-03-04 11:29:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635493399] [2025-03-04 11:29:20,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:20,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:29:20,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:29:20,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:20,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 11:29:20,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:20,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635493399] [2025-03-04 11:29:20,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635493399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:20,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:20,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:20,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442395672] [2025-03-04 11:29:20,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:20,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:20,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:20,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:20,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:20,739 INFO L87 Difference]: Start difference. First operand 194 states and 254 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:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:20,766 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2025-03-04 11:29:20,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:20,766 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 50 [2025-03-04 11:29:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:20,768 INFO L225 Difference]: With dead ends: 208 [2025-03-04 11:29:20,768 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 11:29:20,768 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:20,768 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:20,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 122 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 11:29:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2025-03-04 11:29:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 150 states have (on average 1.14) internal successors, (171), 148 states have internal predecessors, (171), 24 states have call successors, (24), 9 states have call predecessors, (24), 12 states have return successors, (52), 32 states have call predecessors, (52), 23 states have call successors, (52) [2025-03-04 11:29:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2025-03-04 11:29:20,778 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 50 [2025-03-04 11:29:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:20,778 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2025-03-04 11:29:20,778 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:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2025-03-04 11:29:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 11:29:20,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:20,779 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:20,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 11:29:20,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:20,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1048367559, now seen corresponding path program 1 times [2025-03-04 11:29:20,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:20,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978328503] [2025-03-04 11:29:20,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:20,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:20,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:29:20,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:29:20,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:20,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 11:29:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978328503] [2025-03-04 11:29:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978328503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:20,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:20,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510575534] [2025-03-04 11:29:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:20,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:20,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:20,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:20,841 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:29:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:20,865 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2025-03-04 11:29:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:20,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2025-03-04 11:29:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:20,867 INFO L225 Difference]: With dead ends: 206 [2025-03-04 11:29:20,867 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:29:20,867 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:20,867 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:20,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 131 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:29:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2025-03-04 11:29:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 147 states have (on average 1.1428571428571428) internal successors, (168), 145 states have internal predecessors, (168), 23 states have call successors, (23), 9 states have call predecessors, (23), 12 states have return successors, (49), 31 states have call predecessors, (49), 22 states have call successors, (49) [2025-03-04 11:29:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 240 transitions. [2025-03-04 11:29:20,880 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 240 transitions. Word has length 65 [2025-03-04 11:29:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:20,880 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 240 transitions. [2025-03-04 11:29:20,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:29:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 240 transitions. [2025-03-04 11:29:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 11:29:20,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:20,881 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2025-03-04 11:29:20,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:29:20,881 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:20,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1127055372, now seen corresponding path program 1 times [2025-03-04 11:29:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:20,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233022410] [2025-03-04 11:29:20,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:20,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 11:29:20,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 11:29:20,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:20,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:29:21,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:21,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233022410] [2025-03-04 11:29:21,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233022410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:21,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232944962] [2025-03-04 11:29:21,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:21,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:21,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:21,041 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:21,043 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:21,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 11:29:21,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 11:29:21,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:21,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:21,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:29:21,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:29:21,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:29:21,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232944962] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:21,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:21,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 16 [2025-03-04 11:29:21,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053377501] [2025-03-04 11:29:21,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:21,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:29:21,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:21,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:29:21,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:29:21,263 INFO L87 Difference]: Start difference. First operand 186 states and 240 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 11 states have internal predecessors, (56), 7 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:29:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:21,500 INFO L93 Difference]: Finished difference Result 422 states and 575 transitions. [2025-03-04 11:29:21,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:29:21,500 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 11 states have internal predecessors, (56), 7 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 69 [2025-03-04 11:29:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:21,502 INFO L225 Difference]: With dead ends: 422 [2025-03-04 11:29:21,502 INFO L226 Difference]: Without dead ends: 257 [2025-03-04 11:29:21,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 130 SyntacticMatches, 12 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:29:21,503 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 185 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:21,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 246 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-04 11:29:21,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2025-03-04 11:29:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 198 states have (on average 1.1464646464646464) internal successors, (227), 194 states have internal predecessors, (227), 31 states have call successors, (31), 12 states have call predecessors, (31), 16 states have return successors, (61), 42 states have call predecessors, (61), 30 states have call successors, (61) [2025-03-04 11:29:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 319 transitions. [2025-03-04 11:29:21,519 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 319 transitions. Word has length 69 [2025-03-04 11:29:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:21,519 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 319 transitions. [2025-03-04 11:29:21,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 11 states have internal predecessors, (56), 7 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:29:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 319 transitions. [2025-03-04 11:29:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 11:29:21,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:21,520 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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:21,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:29:21,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:21,721 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:21,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1460580902, now seen corresponding path program 1 times [2025-03-04 11:29:21,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813337316] [2025-03-04 11:29:21,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:21,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:21,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 11:29:21,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 11:29:21,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:21,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 11:29:21,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:21,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813337316] [2025-03-04 11:29:21,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813337316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:21,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:21,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516457475] [2025-03-04 11:29:21,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:21,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:21,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:21,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:21,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:21,766 INFO L87 Difference]: Start difference. First operand 249 states and 319 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:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:21,786 INFO L93 Difference]: Finished difference Result 271 states and 344 transitions. [2025-03-04 11:29:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:21,787 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 62 [2025-03-04 11:29:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:21,788 INFO L225 Difference]: With dead ends: 271 [2025-03-04 11:29:21,788 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 11:29:21,788 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:21,789 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:21,789 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:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 11:29:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2025-03-04 11:29:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 205 states have (on average 1.1414634146341462) internal successors, (234), 200 states have internal predecessors, (234), 31 states have call successors, (31), 12 states have call predecessors, (31), 17 states have return successors, (62), 44 states have call predecessors, (62), 30 states have call successors, (62) [2025-03-04 11:29:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 327 transitions. [2025-03-04 11:29:21,801 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 327 transitions. Word has length 62 [2025-03-04 11:29:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:21,801 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 327 transitions. [2025-03-04 11:29:21,802 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:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 327 transitions. [2025-03-04 11:29:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 11:29:21,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:21,802 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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:21,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 11:29:21,803 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:21,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:21,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1933183666, now seen corresponding path program 1 times [2025-03-04 11:29:21,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:21,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716244712] [2025-03-04 11:29:21,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:21,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:21,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 11:29:21,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 11:29:21,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:21,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 11:29:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716244712] [2025-03-04 11:29:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716244712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107654579] [2025-03-04 11:29:21,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:21,903 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:21,904 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:21,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 11:29:21,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 11:29:21,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:21,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:21,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:29:21,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-04 11:29:22,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107654579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:22,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2025-03-04 11:29:22,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265776384] [2025-03-04 11:29:22,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:22,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:29:22,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:22,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:29:22,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:29:22,007 INFO L87 Difference]: Start difference. First operand 257 states and 327 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:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:22,067 INFO L93 Difference]: Finished difference Result 334 states and 443 transitions. [2025-03-04 11:29:22,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:29:22,068 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 63 [2025-03-04 11:29:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:22,069 INFO L225 Difference]: With dead ends: 334 [2025-03-04 11:29:22,069 INFO L226 Difference]: Without dead ends: 333 [2025-03-04 11:29:22,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 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:22,070 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:22,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 174 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-04 11:29:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 287. [2025-03-04 11:29:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 229 states have (on average 1.1441048034934498) internal successors, (262), 222 states have internal predecessors, (262), 33 states have call successors, (33), 12 states have call predecessors, (33), 21 states have return successors, (80), 52 states have call predecessors, (80), 32 states have call successors, (80) [2025-03-04 11:29:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 375 transitions. [2025-03-04 11:29:22,083 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 375 transitions. Word has length 63 [2025-03-04 11:29:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:22,083 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 375 transitions. [2025-03-04 11:29:22,083 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:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 375 transitions. [2025-03-04 11:29:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 11:29:22,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:22,085 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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:22,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:29:22,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:29:22,285 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:22,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash 568523168, now seen corresponding path program 1 times [2025-03-04 11:29:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:22,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254484820] [2025-03-04 11:29:22,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:22,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:22,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:29:22,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:29:22,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:22,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 11:29:22,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:22,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254484820] [2025-03-04 11:29:22,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254484820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:22,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132361851] [2025-03-04 11:29:22,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:22,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:22,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:22,332 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:22,333 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:22,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:29:22,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:29:22,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:22,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:22,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:29:22,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 87 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:29:22,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 39 proven. 46 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:29:22,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132361851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:22,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:22,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 15, 15] total 18 [2025-03-04 11:29:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361164749] [2025-03-04 11:29:22,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:22,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:29:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:22,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:29:22,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:29:22,655 INFO L87 Difference]: Start difference. First operand 287 states and 375 transitions. Second operand has 18 states, 17 states have (on average 5.0) internal successors, (85), 12 states have internal predecessors, (85), 9 states have call successors, (18), 8 states have call predecessors, (18), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 11:29:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:22,942 INFO L93 Difference]: Finished difference Result 372 states and 476 transitions. [2025-03-04 11:29:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:29:22,942 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.0) internal successors, (85), 12 states have internal predecessors, (85), 9 states have call successors, (18), 8 states have call predecessors, (18), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 81 [2025-03-04 11:29:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:22,943 INFO L225 Difference]: With dead ends: 372 [2025-03-04 11:29:22,944 INFO L226 Difference]: Without dead ends: 310 [2025-03-04 11:29:22,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 140 SyntacticMatches, 13 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2025-03-04 11:29:22,945 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 192 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:22,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 248 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-04 11:29:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 295. [2025-03-04 11:29:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 235 states have (on average 1.1404255319148937) internal successors, (268), 228 states have internal predecessors, (268), 34 states have call successors, (34), 13 states have call predecessors, (34), 22 states have return successors, (84), 53 states have call predecessors, (84), 33 states have call successors, (84) [2025-03-04 11:29:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 386 transitions. [2025-03-04 11:29:22,957 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 386 transitions. Word has length 81 [2025-03-04 11:29:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:22,957 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 386 transitions. [2025-03-04 11:29:22,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.0) internal successors, (85), 12 states have internal predecessors, (85), 9 states have call successors, (18), 8 states have call predecessors, (18), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 11:29:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 386 transitions. [2025-03-04 11:29:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:29:22,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:22,958 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:22,964 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:23,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:29:23,162 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:23,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:23,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1700037159, now seen corresponding path program 1 times [2025-03-04 11:29:23,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:23,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146251215] [2025-03-04 11:29:23,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:23,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:23,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:29:23,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:29:23,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:23,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:29:23,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:23,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146251215] [2025-03-04 11:29:23,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146251215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:23,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:23,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:23,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018499065] [2025-03-04 11:29:23,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:23,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:23,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:23,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:23,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:23,205 INFO L87 Difference]: Start difference. First operand 295 states and 386 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:23,232 INFO L93 Difference]: Finished difference Result 307 states and 403 transitions. [2025-03-04 11:29:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:23,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 66 [2025-03-04 11:29:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:23,234 INFO L225 Difference]: With dead ends: 307 [2025-03-04 11:29:23,234 INFO L226 Difference]: Without dead ends: 306 [2025-03-04 11:29:23,234 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:23,234 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 145 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:23,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 145 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:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-04 11:29:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 297. [2025-03-04 11:29:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 237 states have (on average 1.130801687763713) internal successors, (268), 229 states have internal predecessors, (268), 34 states have call successors, (34), 13 states have call predecessors, (34), 22 states have return successors, (84), 54 states have call predecessors, (84), 33 states have call successors, (84) [2025-03-04 11:29:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 386 transitions. [2025-03-04 11:29:23,247 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 386 transitions. Word has length 66 [2025-03-04 11:29:23,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:23,247 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 386 transitions. [2025-03-04 11:29:23,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2025-03-04 11:29:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 11:29:23,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:23,248 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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:23,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 11:29:23,248 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:23,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash -440515929, now seen corresponding path program 1 times [2025-03-04 11:29:23,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:23,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629304672] [2025-03-04 11:29:23,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:23,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 11:29:23,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 11:29:23,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:23,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-04 11:29:23,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:23,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629304672] [2025-03-04 11:29:23,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629304672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:23,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250150435] [2025-03-04 11:29:23,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:23,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:23,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:23,286 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:23,287 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:23,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 11:29:23,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 11:29:23,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:23,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:23,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:29:23,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 71 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:29:23,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 36 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:29:23,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250150435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:23,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:23,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 17, 17] total 21 [2025-03-04 11:29:23,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555075850] [2025-03-04 11:29:23,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:23,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:29:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:23,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:29:23,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:29:23,621 INFO L87 Difference]: Start difference. First operand 297 states and 386 transitions. Second operand has 21 states, 20 states have (on average 4.25) internal successors, (85), 15 states have internal predecessors, (85), 10 states have call successors, (16), 8 states have call predecessors, (16), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:29:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:24,009 INFO L93 Difference]: Finished difference Result 596 states and 811 transitions. [2025-03-04 11:29:24,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:29:24,010 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 15 states have internal predecessors, (85), 10 states have call successors, (16), 8 states have call predecessors, (16), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 73 [2025-03-04 11:29:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:24,011 INFO L225 Difference]: With dead ends: 596 [2025-03-04 11:29:24,011 INFO L226 Difference]: Without dead ends: 347 [2025-03-04 11:29:24,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 123 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:29:24,013 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 262 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:24,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 351 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:29:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-04 11:29:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 320. [2025-03-04 11:29:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 254 states have (on average 1.1299212598425197) internal successors, (287), 248 states have internal predecessors, (287), 37 states have call successors, (37), 14 states have call predecessors, (37), 25 states have return successors, (90), 57 states have call predecessors, (90), 36 states have call successors, (90) [2025-03-04 11:29:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 414 transitions. [2025-03-04 11:29:24,026 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 414 transitions. Word has length 73 [2025-03-04 11:29:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:24,026 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 414 transitions. [2025-03-04 11:29:24,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 15 states have internal predecessors, (85), 10 states have call successors, (16), 8 states have call predecessors, (16), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:29:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 414 transitions. [2025-03-04 11:29:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 11:29:24,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:24,027 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:24,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:24,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:24,228 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:24,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:24,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1161544385, now seen corresponding path program 1 times [2025-03-04 11:29:24,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:24,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428732980] [2025-03-04 11:29:24,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:24,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:24,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 11:29:24,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 11:29:24,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:24,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:29:24,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:24,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428732980] [2025-03-04 11:29:24,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428732980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:24,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:24,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:24,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390840375] [2025-03-04 11:29:24,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:24,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:24,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:24,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:24,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:24,263 INFO L87 Difference]: Start difference. First operand 320 states and 414 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:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:24,286 INFO L93 Difference]: Finished difference Result 330 states and 426 transitions. [2025-03-04 11:29:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:24,286 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 67 [2025-03-04 11:29:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:24,288 INFO L225 Difference]: With dead ends: 330 [2025-03-04 11:29:24,288 INFO L226 Difference]: Without dead ends: 329 [2025-03-04 11:29:24,288 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:24,289 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 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:24,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 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:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-04 11:29:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 321. [2025-03-04 11:29:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 255 states have (on average 1.1215686274509804) internal successors, (286), 249 states have internal predecessors, (286), 37 states have call successors, (37), 14 states have call predecessors, (37), 25 states have return successors, (90), 57 states have call predecessors, (90), 36 states have call successors, (90) [2025-03-04 11:29:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 413 transitions. [2025-03-04 11:29:24,303 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 413 transitions. Word has length 67 [2025-03-04 11:29:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:24,303 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 413 transitions. [2025-03-04 11:29:24,303 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:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 413 transitions. [2025-03-04 11:29:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:29:24,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:24,304 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 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:24,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:29:24,304 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:24,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:24,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1480624147, now seen corresponding path program 1 times [2025-03-04 11:29:24,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:24,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226250107] [2025-03-04 11:29:24,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:24,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:24,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:29:24,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:29:24,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:24,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 26 proven. 42 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 11:29:24,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:24,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226250107] [2025-03-04 11:29:24,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226250107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:24,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704556470] [2025-03-04 11:29:24,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:24,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:24,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:24,447 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:24,449 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:24,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:29:24,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:29:24,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:24,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:24,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:24,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-04 11:29:24,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-04 11:29:24,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704556470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:24,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:24,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 7] total 27 [2025-03-04 11:29:24,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602821502] [2025-03-04 11:29:24,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:24,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 11:29:24,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:24,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 11:29:24,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:29:24,754 INFO L87 Difference]: Start difference. First operand 321 states and 413 transitions. Second operand has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 23 states have internal predecessors, (89), 11 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:29:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:25,466 INFO L93 Difference]: Finished difference Result 648 states and 870 transitions. [2025-03-04 11:29:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 11:29:25,469 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 23 states have internal predecessors, (89), 11 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) Word has length 80 [2025-03-04 11:29:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:25,471 INFO L225 Difference]: With dead ends: 648 [2025-03-04 11:29:25,471 INFO L226 Difference]: Without dead ends: 390 [2025-03-04 11:29:25,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=2392, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 11:29:25,475 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 216 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:25,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 324 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:29:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-04 11:29:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 308. [2025-03-04 11:29:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 242 states have (on average 1.0991735537190082) internal successors, (266), 243 states have internal predecessors, (266), 36 states have call successors, (36), 14 states have call predecessors, (36), 26 states have return successors, (75), 50 states have call predecessors, (75), 35 states have call successors, (75) [2025-03-04 11:29:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 377 transitions. [2025-03-04 11:29:25,499 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 377 transitions. Word has length 80 [2025-03-04 11:29:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:25,499 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 377 transitions. [2025-03-04 11:29:25,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 23 states have internal predecessors, (89), 11 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:29:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 377 transitions. [2025-03-04 11:29:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 11:29:25,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:25,500 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1] [2025-03-04 11:29:25,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:25,701 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:25,701 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1332435488, now seen corresponding path program 1 times [2025-03-04 11:29:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461275228] [2025-03-04 11:29:25,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:25,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 11:29:25,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:29:25,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:25,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 11:29:25,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:25,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461275228] [2025-03-04 11:29:25,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461275228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:25,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:25,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482864665] [2025-03-04 11:29:25,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:25,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:25,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:25,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:25,739 INFO L87 Difference]: Start difference. First operand 308 states and 377 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:29:25,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:25,767 INFO L93 Difference]: Finished difference Result 326 states and 402 transitions. [2025-03-04 11:29:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:25,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2025-03-04 11:29:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:25,769 INFO L225 Difference]: With dead ends: 326 [2025-03-04 11:29:25,769 INFO L226 Difference]: Without dead ends: 325 [2025-03-04 11:29:25,769 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:25,770 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:25,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-04 11:29:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 312. [2025-03-04 11:29:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 246 states have (on average 1.0975609756097562) internal successors, (270), 245 states have internal predecessors, (270), 36 states have call successors, (36), 14 states have call predecessors, (36), 26 states have return successors, (75), 52 states have call predecessors, (75), 35 states have call successors, (75) [2025-03-04 11:29:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 381 transitions. [2025-03-04 11:29:25,781 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 381 transitions. Word has length 75 [2025-03-04 11:29:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:25,782 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 381 transitions. [2025-03-04 11:29:25,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:29:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 381 transitions. [2025-03-04 11:29:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 11:29:25,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:25,782 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 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:25,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 11:29:25,783 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:25,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1644172824, now seen corresponding path program 1 times [2025-03-04 11:29:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:25,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199749505] [2025-03-04 11:29:25,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:25,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:25,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 11:29:25,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 11:29:25,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:25,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 43 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 11:29:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199749505] [2025-03-04 11:29:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199749505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766064911] [2025-03-04 11:29:25,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:25,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:25,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:25,876 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:25,878 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:25,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 11:29:25,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 11:29:25,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:25,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:25,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:29:25,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 31 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:29:25,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 43 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 11:29:26,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766064911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:26,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:26,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2025-03-04 11:29:26,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690620067] [2025-03-04 11:29:26,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:26,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:29:26,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:26,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:29:26,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:29:26,145 INFO L87 Difference]: Start difference. First operand 312 states and 381 transitions. Second operand has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 12 states have internal predecessors, (69), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:29:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:26,334 INFO L93 Difference]: Finished difference Result 587 states and 719 transitions. [2025-03-04 11:29:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:29:26,334 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 12 states have internal predecessors, (69), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 76 [2025-03-04 11:29:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:26,336 INFO L225 Difference]: With dead ends: 587 [2025-03-04 11:29:26,336 INFO L226 Difference]: Without dead ends: 330 [2025-03-04 11:29:26,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 145 SyntacticMatches, 9 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:29:26,337 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 124 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:26,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 306 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-04 11:29:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 310. [2025-03-04 11:29:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 245 states have (on average 1.0938775510204082) internal successors, (268), 243 states have internal predecessors, (268), 36 states have call successors, (36), 14 states have call predecessors, (36), 25 states have return successors, (70), 52 states have call predecessors, (70), 35 states have call successors, (70) [2025-03-04 11:29:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 374 transitions. [2025-03-04 11:29:26,349 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 374 transitions. Word has length 76 [2025-03-04 11:29:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:26,349 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 374 transitions. [2025-03-04 11:29:26,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 12 states have internal predecessors, (69), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:29:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 374 transitions. [2025-03-04 11:29:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 11:29:26,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:26,350 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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:26,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:29:26,550 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,SelfDestructingSolverStorable23 [2025-03-04 11:29:26,550 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:26,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:26,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1116648256, now seen corresponding path program 1 times [2025-03-04 11:29:26,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:26,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793664440] [2025-03-04 11:29:26,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:26,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:26,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 11:29:26,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 11:29:26,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:26,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:29:26,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:26,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793664440] [2025-03-04 11:29:26,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793664440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:26,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257180227] [2025-03-04 11:29:26,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:26,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:26,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:26,635 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:26,637 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:26,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 11:29:26,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 11:29:26,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:26,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:26,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:29:26,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:29:26,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:29:26,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257180227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:26,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:26,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 12 [2025-03-04 11:29:26,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779807036] [2025-03-04 11:29:26,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:26,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:29:26,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:26,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:29:26,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:29:26,804 INFO L87 Difference]: Start difference. First operand 310 states and 374 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 9 states have internal predecessors, (57), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:29:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:26,944 INFO L93 Difference]: Finished difference Result 551 states and 663 transitions. [2025-03-04 11:29:26,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:29:26,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 9 states have internal predecessors, (57), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 77 [2025-03-04 11:29:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:26,946 INFO L225 Difference]: With dead ends: 551 [2025-03-04 11:29:26,946 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 11:29:26,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 148 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:29:26,947 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:26,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 323 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 11:29:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 308. [2025-03-04 11:29:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 243 states have (on average 1.0946502057613168) internal successors, (266), 242 states have internal predecessors, (266), 36 states have call successors, (36), 14 states have call predecessors, (36), 25 states have return successors, (69), 51 states have call predecessors, (69), 35 states have call successors, (69) [2025-03-04 11:29:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 371 transitions. [2025-03-04 11:29:26,960 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 371 transitions. Word has length 77 [2025-03-04 11:29:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:26,961 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 371 transitions. [2025-03-04 11:29:26,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 9 states have internal predecessors, (57), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:29:26,961 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 371 transitions. [2025-03-04 11:29:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 11:29:26,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:26,962 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 11:29:26,969 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:27,162 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,SelfDestructingSolverStorable24 [2025-03-04 11:29:27,163 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:27,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:27,163 INFO L85 PathProgramCache]: Analyzing trace with hash -334744524, now seen corresponding path program 1 times [2025-03-04 11:29:27,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:27,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86365688] [2025-03-04 11:29:27,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:27,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:27,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:29:27,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:29:27,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:27,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 51 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:29:27,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:27,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86365688] [2025-03-04 11:29:27,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86365688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:27,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659124907] [2025-03-04 11:29:27,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:27,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:27,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:27,320 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:27,322 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:27,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:29:27,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:29:27,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:27,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:27,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:29:27,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-04 11:29:27,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 11:29:27,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659124907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:27,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:27,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 11] total 32 [2025-03-04 11:29:27,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709456103] [2025-03-04 11:29:27,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:27,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 11:29:27,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:27,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 11:29:27,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:29:27,816 INFO L87 Difference]: Start difference. First operand 308 states and 371 transitions. Second operand has 32 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 28 states have internal predecessors, (107), 14 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-04 11:29:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:29,033 INFO L93 Difference]: Finished difference Result 763 states and 1021 transitions. [2025-03-04 11:29:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 11:29:29,033 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 28 states have internal predecessors, (107), 14 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) Word has length 81 [2025-03-04 11:29:29,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:29,035 INFO L225 Difference]: With dead ends: 763 [2025-03-04 11:29:29,035 INFO L226 Difference]: Without dead ends: 483 [2025-03-04 11:29:29,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=779, Invalid=5227, Unknown=0, NotChecked=0, Total=6006 [2025-03-04 11:29:29,038 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 283 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:29,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 375 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:29:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-04 11:29:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 357. [2025-03-04 11:29:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 282 states have (on average 1.0886524822695036) internal successors, (307), 277 states have internal predecessors, (307), 41 states have call successors, (41), 14 states have call predecessors, (41), 30 states have return successors, (128), 65 states have call predecessors, (128), 40 states have call successors, (128) [2025-03-04 11:29:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 476 transitions. [2025-03-04 11:29:29,054 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 476 transitions. Word has length 81 [2025-03-04 11:29:29,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:29,054 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 476 transitions. [2025-03-04 11:29:29,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 28 states have internal predecessors, (107), 14 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-04 11:29:29,054 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 476 transitions. [2025-03-04 11:29:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 11:29:29,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:29,056 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:29,062 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:29,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:29,260 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:29,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1211093050, now seen corresponding path program 1 times [2025-03-04 11:29:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:29,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123994018] [2025-03-04 11:29:29,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:29,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 11:29:29,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 11:29:29,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:29,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-04 11:29:29,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:29,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123994018] [2025-03-04 11:29:29,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123994018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:29,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794688930] [2025-03-04 11:29:29,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:29,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:29,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:29,309 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:29,310 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:29,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 11:29:29,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 11:29:29,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:29,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:29,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:29:29,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 33 proven. 52 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:29:29,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 33 proven. 52 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:29:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794688930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:29,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 17 [2025-03-04 11:29:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716738307] [2025-03-04 11:29:29,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:29,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:29:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:29,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:29:29,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:29:29,614 INFO L87 Difference]: Start difference. First operand 357 states and 476 transitions. Second operand has 17 states, 16 states have (on average 5.25) internal successors, (84), 14 states have internal predecessors, (84), 10 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 11:29:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:29,818 INFO L93 Difference]: Finished difference Result 665 states and 936 transitions. [2025-03-04 11:29:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:29:29,819 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.25) internal successors, (84), 14 states have internal predecessors, (84), 10 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) Word has length 94 [2025-03-04 11:29:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:29,820 INFO L225 Difference]: With dead ends: 665 [2025-03-04 11:29:29,820 INFO L226 Difference]: Without dead ends: 363 [2025-03-04 11:29:29,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 173 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:29:29,822 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 118 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:29,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 401 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-04 11:29:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 357. [2025-03-04 11:29:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 282 states have (on average 1.0886524822695036) internal successors, (307), 277 states have internal predecessors, (307), 41 states have call successors, (41), 14 states have call predecessors, (41), 30 states have return successors, (127), 65 states have call predecessors, (127), 40 states have call successors, (127) [2025-03-04 11:29:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 475 transitions. [2025-03-04 11:29:29,836 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 475 transitions. Word has length 94 [2025-03-04 11:29:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:29,836 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 475 transitions. [2025-03-04 11:29:29,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.25) internal successors, (84), 14 states have internal predecessors, (84), 10 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 11:29:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 475 transitions. [2025-03-04 11:29:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 11:29:29,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:29,837 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:29,847 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:30,037 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,SelfDestructingSolverStorable26 [2025-03-04 11:29:30,038 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:30,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1777062964, now seen corresponding path program 2 times [2025-03-04 11:29:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:30,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525567549] [2025-03-04 11:29:30,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:30,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 11:29:30,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:29:30,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:30,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-04 11:29:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525567549] [2025-03-04 11:29:30,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525567549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:30,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782208925] [2025-03-04 11:29:30,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:30,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:30,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:30,230 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:30,231 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:30,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 11:29:30,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:29:30,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:30,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:30,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:29:30,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-04 11:29:30,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-04 11:29:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782208925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:30,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:30,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 34 [2025-03-04 11:29:30,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031981155] [2025-03-04 11:29:30,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:30,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 11:29:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:30,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 11:29:30,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 11:29:30,781 INFO L87 Difference]: Start difference. First operand 357 states and 475 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:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:31,181 INFO L93 Difference]: Finished difference Result 662 states and 938 transitions. [2025-03-04 11:29:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 11:29:31,181 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 95 [2025-03-04 11:29:31,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:31,184 INFO L225 Difference]: With dead ends: 662 [2025-03-04 11:29:31,184 INFO L226 Difference]: Without dead ends: 659 [2025-03-04 11:29:31,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=402, Invalid=2568, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:29:31,185 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:31,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 559 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-04 11:29:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 420. [2025-03-04 11:29:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 330 states have (on average 1.0636363636363637) internal successors, (351), 329 states have internal predecessors, (351), 47 states have call successors, (47), 14 states have call predecessors, (47), 39 states have return successors, (186), 76 states have call predecessors, (186), 46 states have call successors, (186) [2025-03-04 11:29:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 584 transitions. [2025-03-04 11:29:31,205 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 584 transitions. Word has length 95 [2025-03-04 11:29:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:31,205 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 584 transitions. [2025-03-04 11:29:31,206 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:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 584 transitions. [2025-03-04 11:29:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 11:29:31,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:31,207 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 11:29:31,213 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:31,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,SelfDestructingSolverStorable27 [2025-03-04 11:29:31,411 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:31,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash -745622956, now seen corresponding path program 1 times [2025-03-04 11:29:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:31,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21439525] [2025-03-04 11:29:31,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:31,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:31,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 11:29:31,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:29:31,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:31,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-04 11:29:31,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:31,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21439525] [2025-03-04 11:29:31,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21439525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:31,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695235483] [2025-03-04 11:29:31,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:31,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:31,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:31,593 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:31,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:29:31,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 11:29:31,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:29:31,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:31,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:31,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:29:31,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-04 11:29:31,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-04 11:29:32,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695235483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:32,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:32,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 33 [2025-03-04 11:29:32,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730032995] [2025-03-04 11:29:32,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:32,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 11:29:32,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:32,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 11:29:32,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:29:32,110 INFO L87 Difference]: Start difference. First operand 420 states and 584 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:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:32,310 INFO L93 Difference]: Finished difference Result 576 states and 776 transitions. [2025-03-04 11:29:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 11:29:32,310 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 96 [2025-03-04 11:29:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:32,312 INFO L225 Difference]: With dead ends: 576 [2025-03-04 11:29:32,312 INFO L226 Difference]: Without dead ends: 574 [2025-03-04 11:29:32,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 169 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=267, Invalid=1625, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 11:29:32,313 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:32,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 595 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-04 11:29:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 416. [2025-03-04 11:29:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 326 states have (on average 1.039877300613497) internal successors, (339), 327 states have internal predecessors, (339), 45 states have call successors, (45), 14 states have call predecessors, (45), 41 states have return successors, (178), 74 states have call predecessors, (178), 44 states have call successors, (178) [2025-03-04 11:29:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 562 transitions. [2025-03-04 11:29:32,333 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 562 transitions. Word has length 96 [2025-03-04 11:29:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:32,333 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 562 transitions. [2025-03-04 11:29:32,333 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:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 562 transitions. [2025-03-04 11:29:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 11:29:32,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:32,335 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 11:29:32,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 11:29:32,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 11:29:32,535 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:32,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1835470347, now seen corresponding path program 1 times [2025-03-04 11:29:32,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:32,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796599029] [2025-03-04 11:29:32,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:32,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 11:29:32,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 11:29:32,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:32,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 85 proven. 143 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-04 11:29:32,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:32,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796599029] [2025-03-04 11:29:32,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796599029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:32,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239250809] [2025-03-04 11:29:32,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:32,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:32,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:32,714 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:32,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:29:32,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 11:29:32,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 11:29:32,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:32,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:32,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 11:29:32,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 65 proven. 91 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-03-04 11:29:33,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 91 proven. 83 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-04 11:29:34,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239250809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:34,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:34,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 26] total 51 [2025-03-04 11:29:34,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610627415] [2025-03-04 11:29:34,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:34,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 11:29:34,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:34,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 11:29:34,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2325, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 11:29:34,486 INFO L87 Difference]: Start difference. First operand 416 states and 562 transitions. Second operand has 51 states, 50 states have (on average 3.52) internal successors, (176), 49 states have internal predecessors, (176), 19 states have call successors, (25), 3 states have call predecessors, (25), 14 states have return successors, (38), 33 states have call predecessors, (38), 17 states have call successors, (38) [2025-03-04 11:29:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:36,195 INFO L93 Difference]: Finished difference Result 1043 states and 1430 transitions. [2025-03-04 11:29:36,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-04 11:29:36,196 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.52) internal successors, (176), 49 states have internal predecessors, (176), 19 states have call successors, (25), 3 states have call predecessors, (25), 14 states have return successors, (38), 33 states have call predecessors, (38), 17 states have call successors, (38) Word has length 167 [2025-03-04 11:29:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:36,198 INFO L225 Difference]: With dead ends: 1043 [2025-03-04 11:29:36,199 INFO L226 Difference]: Without dead ends: 548 [2025-03-04 11:29:36,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 284 SyntacticMatches, 16 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4308 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1523, Invalid=12049, Unknown=0, NotChecked=0, Total=13572 [2025-03-04 11:29:36,204 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 205 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 2247 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:36,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 532 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2247 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:29:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-04 11:29:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 335. [2025-03-04 11:29:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 262 states have (on average 1.0305343511450382) internal successors, (270), 266 states have internal predecessors, (270), 38 states have call successors, (38), 14 states have call predecessors, (38), 33 states have return successors, (100), 54 states have call predecessors, (100), 37 states have call successors, (100) [2025-03-04 11:29:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 408 transitions. [2025-03-04 11:29:36,226 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 408 transitions. Word has length 167 [2025-03-04 11:29:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:36,226 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 408 transitions. [2025-03-04 11:29:36,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.52) internal successors, (176), 49 states have internal predecessors, (176), 19 states have call successors, (25), 3 states have call predecessors, (25), 14 states have return successors, (38), 33 states have call predecessors, (38), 17 states have call successors, (38) [2025-03-04 11:29:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 408 transitions. [2025-03-04 11:29:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 11:29:36,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:36,228 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:36,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 11:29:36,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:36,429 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:36,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:36,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1072225293, now seen corresponding path program 2 times [2025-03-04 11:29:36,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:36,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243823976] [2025-03-04 11:29:36,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:36,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:36,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-04 11:29:36,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 11:29:36,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:36,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 120 proven. 68 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 11:29:36,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:36,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243823976] [2025-03-04 11:29:36,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243823976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:36,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147750608] [2025-03-04 11:29:36,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:36,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:36,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:36,605 INFO L229 MonitoredProcess]: Starting monitored process 20 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:36,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 11:29:36,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-04 11:29:36,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 11:29:36,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:36,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:36,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:29:36,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 118 proven. 69 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-04 11:29:36,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 118 proven. 70 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 11:29:37,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147750608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:37,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:37,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 17 [2025-03-04 11:29:37,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463940192] [2025-03-04 11:29:37,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:37,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:29:37,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:37,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:29:37,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:29:37,010 INFO L87 Difference]: Start difference. First operand 335 states and 408 transitions. Second operand has 17 states, 16 states have (on average 5.6875) internal successors, (91), 15 states have internal predecessors, (91), 9 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 11:29:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:37,165 INFO L93 Difference]: Finished difference Result 585 states and 730 transitions. [2025-03-04 11:29:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:29:37,166 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.6875) internal successors, (91), 15 states have internal predecessors, (91), 9 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 150 [2025-03-04 11:29:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:37,167 INFO L225 Difference]: With dead ends: 585 [2025-03-04 11:29:37,167 INFO L226 Difference]: Without dead ends: 325 [2025-03-04 11:29:37,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 290 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:29:37,169 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 80 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:37,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 238 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-04 11:29:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 292. [2025-03-04 11:29:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.0263157894736843) internal successors, (234), 233 states have internal predecessors, (234), 34 states have call successors, (34), 14 states have call predecessors, (34), 29 states have return successors, (72), 44 states have call predecessors, (72), 33 states have call successors, (72) [2025-03-04 11:29:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 340 transitions. [2025-03-04 11:29:37,184 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 340 transitions. Word has length 150 [2025-03-04 11:29:37,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:37,184 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 340 transitions. [2025-03-04 11:29:37,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.6875) internal successors, (91), 15 states have internal predecessors, (91), 9 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 11:29:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 340 transitions. [2025-03-04 11:29:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-04 11:29:37,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:37,187 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1] [2025-03-04 11:29:37,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:37,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:37,387 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:37,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash -344235816, now seen corresponding path program 2 times [2025-03-04 11:29:37,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:37,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496040780] [2025-03-04 11:29:37,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:37,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 11:29:37,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 11:29:37,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:37,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 129 proven. 47 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-03-04 11:29:37,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:37,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496040780] [2025-03-04 11:29:37,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496040780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:37,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047834874] [2025-03-04 11:29:37,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:37,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:37,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:37,480 INFO L229 MonitoredProcess]: Starting monitored process 21 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:37,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 11:29:37,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 11:29:37,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 11:29:37,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:37,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:37,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:29:37,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 180 proven. 54 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-04 11:29:37,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 180 proven. 56 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-03-04 11:29:37,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047834874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:37,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:37,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 15 [2025-03-04 11:29:37,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598072054] [2025-03-04 11:29:37,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:37,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:29:37,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:37,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:29:37,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:29:37,944 INFO L87 Difference]: Start difference. First operand 292 states and 340 transitions. Second operand has 15 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 9 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-04 11:29:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:38,100 INFO L93 Difference]: Finished difference Result 377 states and 449 transitions. [2025-03-04 11:29:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:29:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 9 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14) Word has length 202 [2025-03-04 11:29:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:38,103 INFO L225 Difference]: With dead ends: 377 [2025-03-04 11:29:38,103 INFO L226 Difference]: Without dead ends: 325 [2025-03-04 11:29:38,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 393 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:29:38,103 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 71 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:38,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 243 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-04 11:29:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 315. [2025-03-04 11:29:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 246 states have (on average 1.0284552845528456) internal successors, (253), 251 states have internal predecessors, (253), 38 states have call successors, (38), 15 states have call predecessors, (38), 30 states have return successors, (79), 48 states have call predecessors, (79), 37 states have call successors, (79) [2025-03-04 11:29:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 370 transitions. [2025-03-04 11:29:38,121 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 370 transitions. Word has length 202 [2025-03-04 11:29:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:38,121 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 370 transitions. [2025-03-04 11:29:38,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 9 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-04 11:29:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 370 transitions. [2025-03-04 11:29:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-04 11:29:38,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:38,124 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 12, 10, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 1, 1, 1, 1] [2025-03-04 11:29:38,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:38,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-04 11:29:38,325 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:38,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:38,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1464769157, now seen corresponding path program 3 times [2025-03-04 11:29:38,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:38,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574086156] [2025-03-04 11:29:38,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:29:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:38,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 258 statements into 9 equivalence classes. [2025-03-04 11:29:38,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 258 statements. [2025-03-04 11:29:38,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 11:29:38,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 178 proven. 3 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2025-03-04 11:29:38,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:38,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574086156] [2025-03-04 11:29:38,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574086156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:38,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978021487] [2025-03-04 11:29:38,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:29:38,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:38,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:38,360 INFO L229 MonitoredProcess]: Starting monitored process 22 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:38,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 11:29:38,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 258 statements into 9 equivalence classes. [2025-03-04 11:29:38,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 258 statements. [2025-03-04 11:29:38,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 11:29:38,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:38,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:29:38,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2025-03-04 11:29:38,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:38,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978021487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:38,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:38,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-04 11:29:38,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195079374] [2025-03-04 11:29:38,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:38,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:29:38,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:38,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:29:38,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:29:38,450 INFO L87 Difference]: Start difference. First operand 315 states and 370 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:29:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:38,495 INFO L93 Difference]: Finished difference Result 465 states and 552 transitions. [2025-03-04 11:29:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:29:38,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 258 [2025-03-04 11:29:38,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:38,498 INFO L225 Difference]: With dead ends: 465 [2025-03-04 11:29:38,498 INFO L226 Difference]: Without dead ends: 251 [2025-03-04 11:29:38,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:29:38,499 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:38,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 82 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-04 11:29:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 237. [2025-03-04 11:29:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 186 states have (on average 1.032258064516129) internal successors, (192), 190 states have internal predecessors, (192), 29 states have call successors, (29), 15 states have call predecessors, (29), 21 states have return successors, (47), 31 states have call predecessors, (47), 28 states have call successors, (47) [2025-03-04 11:29:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 268 transitions. [2025-03-04 11:29:38,516 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 268 transitions. Word has length 258 [2025-03-04 11:29:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:38,517 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 268 transitions. [2025-03-04 11:29:38,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:29:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 268 transitions. [2025-03-04 11:29:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-04 11:29:38,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:38,519 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 12, 11, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1] [2025-03-04 11:29:38,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 11:29:38,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 11:29:38,720 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:38,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1397572001, now seen corresponding path program 4 times [2025-03-04 11:29:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:38,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897682467] [2025-03-04 11:29:38,720 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:29:38,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:38,726 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 259 statements into 2 equivalence classes. [2025-03-04 11:29:38,731 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 154 of 259 statements. [2025-03-04 11:29:38,734 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:29:38,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 115 proven. 203 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-03-04 11:29:38,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:38,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897682467] [2025-03-04 11:29:38,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897682467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:38,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532890707] [2025-03-04 11:29:38,805 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:29:38,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:38,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:38,807 INFO L229 MonitoredProcess]: Starting monitored process 23 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:38,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 11:29:38,861 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 259 statements into 2 equivalence classes. [2025-03-04 11:29:38,882 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 154 of 259 statements. [2025-03-04 11:29:38,882 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:29:38,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:38,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:29:38,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 665 proven. 58 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 11:29:38,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 115 proven. 204 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2025-03-04 11:29:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532890707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:39,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:39,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 13 [2025-03-04 11:29:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227398324] [2025-03-04 11:29:39,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:39,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:29:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:39,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:29:39,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:29:39,230 INFO L87 Difference]: Start difference. First operand 237 states and 268 transitions. Second operand has 13 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 8 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 11:29:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:39,347 INFO L93 Difference]: Finished difference Result 404 states and 457 transitions. [2025-03-04 11:29:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:29:39,348 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 8 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) Word has length 259 [2025-03-04 11:29:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:39,349 INFO L225 Difference]: With dead ends: 404 [2025-03-04 11:29:39,349 INFO L226 Difference]: Without dead ends: 256 [2025-03-04 11:29:39,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 511 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:29:39,350 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:39,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 166 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-04 11:29:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 237. [2025-03-04 11:29:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 186 states have (on average 1.032258064516129) internal successors, (192), 190 states have internal predecessors, (192), 29 states have call successors, (29), 15 states have call predecessors, (29), 21 states have return successors, (46), 31 states have call predecessors, (46), 28 states have call successors, (46) [2025-03-04 11:29:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 267 transitions. [2025-03-04 11:29:39,360 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 267 transitions. Word has length 259 [2025-03-04 11:29:39,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:39,360 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 267 transitions. [2025-03-04 11:29:39,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 8 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 11:29:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 267 transitions. [2025-03-04 11:29:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-04 11:29:39,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:39,362 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 12, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 1, 1, 1, 1] [2025-03-04 11:29:39,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:39,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:39,563 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:39,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1749072466, now seen corresponding path program 5 times [2025-03-04 11:29:39,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:39,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851768723] [2025-03-04 11:29:39,563 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:39,569 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 259 statements into 9 equivalence classes. [2025-03-04 11:29:39,583 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 187 of 259 statements. [2025-03-04 11:29:39,584 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-04 11:29:39,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 223 proven. 312 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2025-03-04 11:29:39,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851768723] [2025-03-04 11:29:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851768723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464035806] [2025-03-04 11:29:39,732 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:39,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:39,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:39,734 INFO L229 MonitoredProcess]: Starting monitored process 24 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:39,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 11:29:39,798 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 259 statements into 9 equivalence classes. [2025-03-04 11:29:39,827 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 187 of 259 statements. [2025-03-04 11:29:39,827 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-04 11:29:39,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:39,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:29:39,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 219 proven. 311 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-03-04 11:29:39,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 223 proven. 314 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2025-03-04 11:29:40,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464035806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:40,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:40,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2025-03-04 11:29:40,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094009127] [2025-03-04 11:29:40,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:40,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:29:40,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:40,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:29:40,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:29:40,496 INFO L87 Difference]: Start difference. First operand 237 states and 267 transitions. Second operand has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 16 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) [2025-03-04 11:29:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:40,783 INFO L93 Difference]: Finished difference Result 431 states and 500 transitions. [2025-03-04 11:29:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:29:40,784 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 16 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) Word has length 259 [2025-03-04 11:29:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:40,785 INFO L225 Difference]: With dead ends: 431 [2025-03-04 11:29:40,785 INFO L226 Difference]: Without dead ends: 263 [2025-03-04 11:29:40,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 506 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=929, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:29:40,787 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 171 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:40,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 350 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:40,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-04 11:29:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 258. [2025-03-04 11:29:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 203 states have (on average 1.0344827586206897) internal successors, (210), 206 states have internal predecessors, (210), 31 states have call successors, (31), 16 states have call predecessors, (31), 23 states have return successors, (51), 35 states have call predecessors, (51), 30 states have call successors, (51) [2025-03-04 11:29:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 292 transitions. [2025-03-04 11:29:40,799 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 292 transitions. Word has length 259 [2025-03-04 11:29:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:40,799 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 292 transitions. [2025-03-04 11:29:40,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 16 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) [2025-03-04 11:29:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 292 transitions. [2025-03-04 11:29:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-04 11:29:40,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:40,801 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 12, 11, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 1, 1, 1, 1] [2025-03-04 11:29:40,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 11:29:41,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:41,002 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:41,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 371324459, now seen corresponding path program 6 times [2025-03-04 11:29:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:41,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485571783] [2025-03-04 11:29:41,002 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:29:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:41,008 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 260 statements into 9 equivalence classes. [2025-03-04 11:29:41,026 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 227 of 260 statements. [2025-03-04 11:29:41,027 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-04 11:29:41,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 300 proven. 49 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2025-03-04 11:29:41,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485571783] [2025-03-04 11:29:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485571783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598589766] [2025-03-04 11:29:41,102 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:29:41,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:41,103 INFO L229 MonitoredProcess]: Starting monitored process 25 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:41,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 11:29:41,162 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 260 statements into 9 equivalence classes. [2025-03-04 11:29:41,209 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 227 of 260 statements. [2025-03-04 11:29:41,210 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-04 11:29:41,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:41,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:41,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 532 proven. 6 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-03-04 11:29:41,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 300 proven. 49 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2025-03-04 11:29:41,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598589766] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:41,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:41,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-04 11:29:41,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701789784] [2025-03-04 11:29:41,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:41,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:29:41,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:41,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:29:41,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:29:41,664 INFO L87 Difference]: Start difference. First operand 258 states and 292 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 6 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-04 11:29:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:41,747 INFO L93 Difference]: Finished difference Result 435 states and 503 transitions. [2025-03-04 11:29:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:29:41,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 6 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 260 [2025-03-04 11:29:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:41,749 INFO L225 Difference]: With dead ends: 435 [2025-03-04 11:29:41,749 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 11:29:41,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 514 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:29:41,750 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 70 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:41,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 123 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 11:29:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-03-04 11:29:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 199 states have (on average 1.035175879396985) internal successors, (206), 202 states have internal predecessors, (206), 31 states have call successors, (31), 16 states have call predecessors, (31), 22 states have return successors, (47), 34 states have call predecessors, (47), 30 states have call successors, (47) [2025-03-04 11:29:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2025-03-04 11:29:41,761 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 260 [2025-03-04 11:29:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:41,762 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2025-03-04 11:29:41,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 6 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-04 11:29:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2025-03-04 11:29:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-04 11:29:41,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:41,763 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1] [2025-03-04 11:29:41,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 11:29:41,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 11:29:41,964 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:41,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash -506430284, now seen corresponding path program 7 times [2025-03-04 11:29:41,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:41,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305210921] [2025-03-04 11:29:41,965 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:29:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:41,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-04 11:29:41,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-04 11:29:41,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:41,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 149 proven. 248 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-03-04 11:29:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305210921] [2025-03-04 11:29:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305210921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013447990] [2025-03-04 11:29:42,542 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:29:42,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:42,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:42,544 INFO L229 MonitoredProcess]: Starting monitored process 26 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:42,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 11:29:42,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-04 11:29:42,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-04 11:29:42,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:42,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:42,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 11:29:42,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 148 proven. 181 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2025-03-04 11:29:42,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 218 proven. 160 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2025-03-04 11:29:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013447990] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:44,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:44,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24, 29] total 56 [2025-03-04 11:29:44,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058480174] [2025-03-04 11:29:44,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:44,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-04 11:29:44,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:44,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-04 11:29:44,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=2797, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 11:29:44,899 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand has 57 states, 56 states have (on average 2.6785714285714284) internal successors, (150), 57 states have internal predecessors, (150), 14 states have call successors, (16), 1 states have call predecessors, (16), 18 states have return successors, (37), 37 states have call predecessors, (37), 14 states have call successors, (37) [2025-03-04 11:29:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:45,132 INFO L93 Difference]: Finished difference Result 309 states and 344 transitions. [2025-03-04 11:29:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 11:29:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.6785714285714284) internal successors, (150), 57 states have internal predecessors, (150), 14 states have call successors, (16), 1 states have call predecessors, (16), 18 states have return successors, (37), 37 states have call predecessors, (37), 14 states have call successors, (37) Word has length 241 [2025-03-04 11:29:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:45,134 INFO L225 Difference]: With dead ends: 309 [2025-03-04 11:29:45,134 INFO L226 Difference]: Without dead ends: 287 [2025-03-04 11:29:45,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 447 SyntacticMatches, 27 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3096 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=527, Invalid=3633, Unknown=0, NotChecked=0, Total=4160 [2025-03-04 11:29:45,135 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:45,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 616 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-04 11:29:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 269. [2025-03-04 11:29:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 212 states have (on average 1.0235849056603774) internal successors, (217), 214 states have internal predecessors, (217), 33 states have call successors, (33), 16 states have call predecessors, (33), 23 states have return successors, (49), 38 states have call predecessors, (49), 32 states have call successors, (49) [2025-03-04 11:29:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 299 transitions. [2025-03-04 11:29:45,155 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 299 transitions. Word has length 241 [2025-03-04 11:29:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:45,155 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 299 transitions. [2025-03-04 11:29:45,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.6785714285714284) internal successors, (150), 57 states have internal predecessors, (150), 14 states have call successors, (16), 1 states have call predecessors, (16), 18 states have return successors, (37), 37 states have call predecessors, (37), 14 states have call successors, (37) [2025-03-04 11:29:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 299 transitions. [2025-03-04 11:29:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-04 11:29:45,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:45,156 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:45,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 11:29:45,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 11:29:45,357 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:45,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1956054149, now seen corresponding path program 8 times [2025-03-04 11:29:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:45,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587871774] [2025-03-04 11:29:45,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:45,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 244 statements into 2 equivalence classes. [2025-03-04 11:29:45,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 244 of 244 statements. [2025-03-04 11:29:45,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:45,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 100 proven. 273 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2025-03-04 11:29:45,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587871774] [2025-03-04 11:29:45,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587871774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622154932] [2025-03-04 11:29:45,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:45,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:45,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:45,487 INFO L229 MonitoredProcess]: Starting monitored process 27 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:45,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 11:29:45,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 244 statements into 2 equivalence classes. [2025-03-04 11:29:45,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 244 of 244 statements. [2025-03-04 11:29:45,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:45,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:45,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:29:45,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 578 proven. 115 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-04 11:29:45,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 104 proven. 275 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2025-03-04 11:29:46,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622154932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:46,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:46,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 15 [2025-03-04 11:29:46,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816980489] [2025-03-04 11:29:46,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:46,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:29:46,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:46,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:29:46,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:29:46,038 INFO L87 Difference]: Start difference. First operand 269 states and 299 transitions. Second operand has 15 states, 14 states have (on average 8.5) internal successors, (119), 14 states have internal predecessors, (119), 10 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-04 11:29:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:46,158 INFO L93 Difference]: Finished difference Result 427 states and 475 transitions. [2025-03-04 11:29:46,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:29:46,158 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.5) internal successors, (119), 14 states have internal predecessors, (119), 10 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) Word has length 244 [2025-03-04 11:29:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:46,159 INFO L225 Difference]: With dead ends: 427 [2025-03-04 11:29:46,159 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:29:46,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 479 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:29:46,160 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 43 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:46,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 267 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:29:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:29:46,160 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:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:29:46,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2025-03-04 11:29:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:46,161 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:29:46,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.5) internal successors, (119), 14 states have internal predecessors, (119), 10 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-04 11:29:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:29:46,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:29:46,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-04 11:29:46,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-04 11:29:46,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-04 11:29:46,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-04 11:29:46,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-04 11:29:46,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-04 11:29:46,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-04 11:29:46,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-04 11:29:46,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-04 11:29:46,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-04 11:29:46,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-04 11:29:46,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-04 11:29:46,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:46,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 11:29:46,367 INFO L422 BasicCegarLoop]: Path program histogram: [8, 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:46,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:30:02,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:30:02,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:30:02 BoogieIcfgContainer [2025-03-04 11:30:02,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:30:02,181 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:30:02,181 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:30:02,181 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:30:02,182 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:15" (3/4) ... [2025-03-04 11:30:02,183 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:30:02,187 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo2 [2025-03-04 11:30:02,187 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo1 [2025-03-04 11:30:02,190 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:30:02,190 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:30:02,190 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:30:02,191 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:30:02,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:30:02,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:30:02,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:30:02,246 INFO L158 Benchmark]: Toolchain (without parser) took 47126.51ms. Allocated memory was 201.3MB in the beginning and 855.6MB in the end (delta: 654.3MB). Free memory was 154.8MB in the beginning and 758.3MB in the end (delta: -603.5MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2025-03-04 11:30:02,246 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:30:02,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.00ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 144.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:30:02,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.78ms. Allocated memory is still 201.3MB. Free memory was 144.2MB in the beginning and 143.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:30:02,246 INFO L158 Benchmark]: Boogie Preprocessor took 26.10ms. Allocated memory is still 201.3MB. Free memory was 143.0MB in the beginning and 142.2MB in the end (delta: 838.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:30:02,246 INFO L158 Benchmark]: IcfgBuilder took 200.50ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 129.5MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:30:02,246 INFO L158 Benchmark]: TraceAbstraction took 46655.79ms. Allocated memory was 201.3MB in the beginning and 855.6MB in the end (delta: 654.3MB). Free memory was 129.1MB in the beginning and 762.3MB in the end (delta: -633.2MB). Peak memory consumption was 479.5MB. Max. memory is 16.1GB. [2025-03-04 11:30:02,246 INFO L158 Benchmark]: Witness Printer took 64.06ms. Allocated memory is still 855.6MB. Free memory was 762.3MB in the beginning and 758.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:30:02,247 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.95ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.00ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 144.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.78ms. Allocated memory is still 201.3MB. Free memory was 144.2MB in the beginning and 143.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.10ms. Allocated memory is still 201.3MB. Free memory was 143.0MB in the beginning and 142.2MB in the end (delta: 838.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 200.50ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 129.5MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 46655.79ms. Allocated memory was 201.3MB in the beginning and 855.6MB in the end (delta: 654.3MB). Free memory was 129.1MB in the beginning and 762.3MB in the end (delta: -633.2MB). Peak memory consumption was 479.5MB. Max. memory is 16.1GB. * Witness Printer took 64.06ms. Allocated memory is still 855.6MB. Free memory was 762.3MB in the beginning and 758.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 30.8s, OverallIterations: 38, TraceHistogramMax: 14, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2951 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2837 mSDsluCounter, 10630 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9204 mSDsCounter, 959 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12843 IncrementalHoareTripleChecker+Invalid, 13802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 959 mSolverCounterUnsat, 1426 mSDtfsCounter, 12843 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6588 GetRequests, 5601 SyntacticMatches, 190 SemanticMatches, 797 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12420 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=28, InterpolantAutomatonStates: 593, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 38 MinimizatonAttempts, 1218 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 6801 NumberOfCodeBlocks, 5949 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 9489 ConstructedInterpolants, 0 QuantifiedInterpolants, 17205 SizeOfPredicates, 68 NumberOfNonLiveVariables, 5553 ConjunctsInSsa, 344 ConjunctsInUnsatCore, 86 InterpolantComputations, 16 PerfectInterpolantSequences, 21402/25798 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:30:02,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE