./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/recHanoi02-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/recHanoi02-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d379c583eb269678169316efe01a55df7fa26acebe2991472725b0afcb2879ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:28:31,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:28:31,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:28:31,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:28:31,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:28:31,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:28:31,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:28:31,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:28:31,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:28:31,707 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:28:31,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:28:31,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:28:31,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:28:31,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:28:31,708 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:28:31,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:28:31,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:28:31,708 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:28:31,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:28:31,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:28:31,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:28:31,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:28:31,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:28:31,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:28:31,709 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:28:31,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:28:31,709 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:28:31,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:28:31,709 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:28:31,709 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:28:31,709 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:28:31,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:28:31,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:28:31,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:28:31,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:31,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:28:31,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:28:31,710 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:28:31,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:28:31,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:28:31,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:28:31,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:28:31,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:28:31,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:28:31,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:28:31,710 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 -> d379c583eb269678169316efe01a55df7fa26acebe2991472725b0afcb2879ab [2025-03-04 11:28:31,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:28:31,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:28:31,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:28:31,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:28:31,965 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:28:31,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/recHanoi02-2.c [2025-03-04 11:28:33,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cef98ebb/f6cdec69c3794aec9dc5cea206fa4712/FLAG1af88a3e1 [2025-03-04 11:28:33,289 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:28:33,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi02-2.c [2025-03-04 11:28:33,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cef98ebb/f6cdec69c3794aec9dc5cea206fa4712/FLAG1af88a3e1 [2025-03-04 11:28:33,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cef98ebb/f6cdec69c3794aec9dc5cea206fa4712 [2025-03-04 11:28:33,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:28:33,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:28:33,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:33,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:28:33,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:28:33,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649a78e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33, skipping insertion in model container [2025-03-04 11:28:33,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:28:33,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:33,805 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:28:33,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:33,826 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:28:33,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33 WrapperNode [2025-03-04 11:28:33,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:33,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:33,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:28:33,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:28:33,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,849 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-03-04 11:28:33,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:33,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:28:33,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:28:33,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:28:33,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,857 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,869 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:28:33,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,871 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:28:33,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:28:33,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:28:33,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:28:33,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (1/1) ... [2025-03-04 11:28:33,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:33,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:33,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:28:33,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:28:33,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:28:33,928 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2025-03-04 11:28:33,928 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2025-03-04 11:28:33,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:28:33,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:28:33,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:28:33,966 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:28:33,967 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:28:34,031 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4; [2025-03-04 11:28:34,055 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 11:28:34,055 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:28:34,063 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:28:34,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:28:34,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:34 BoogieIcfgContainer [2025-03-04 11:28:34,064 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:28:34,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:28:34,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:28:34,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:28:34,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:28:33" (1/3) ... [2025-03-04 11:28:34,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72869295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:34, skipping insertion in model container [2025-03-04 11:28:34,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:33" (2/3) ... [2025-03-04 11:28:34,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72869295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:34, skipping insertion in model container [2025-03-04 11:28:34,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:34" (3/3) ... [2025-03-04 11:28:34,070 INFO L128 eAbstractionObserver]: Analyzing ICFG recHanoi02-2.c [2025-03-04 11:28:34,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:28:34,082 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recHanoi02-2.c that has 2 procedures, 29 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 11:28:34,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:28:34,130 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;@65fafe11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:28:34,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:28:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:28:34,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:34,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:34,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:34,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:34,142 INFO L85 PathProgramCache]: Analyzing trace with hash 77369545, now seen corresponding path program 1 times [2025-03-04 11:28:34,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:34,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373134146] [2025-03-04 11:28:34,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:34,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:34,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:28:34,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:28:34,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:34,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:34,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373134146] [2025-03-04 11:28:34,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373134146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:34,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:34,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:34,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56351709] [2025-03-04 11:28:34,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:34,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:34,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:34,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:34,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:34,311 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:34,406 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-03-04 11:28:34,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:34,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:28:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:34,412 INFO L225 Difference]: With dead ends: 53 [2025-03-04 11:28:34,412 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 11:28:34,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:34,416 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:34,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 90 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 11:28:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-03-04 11:28:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-04 11:28:34,452 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 7 [2025-03-04 11:28:34,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:34,453 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-04 11:28:34,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-04 11:28:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:28:34,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:34,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:34,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:28:34,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:34,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1896511420, now seen corresponding path program 1 times [2025-03-04 11:28:34,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:34,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249512893] [2025-03-04 11:28:34,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:34,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:34,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:28:34,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:28:34,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:34,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:34,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:34,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249512893] [2025-03-04 11:28:34,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249512893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:34,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:34,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:34,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239684522] [2025-03-04 11:28:34,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:34,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:34,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:34,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:34,530 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:34,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:34,573 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-04 11:28:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:34,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 11:28:34,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:34,576 INFO L225 Difference]: With dead ends: 34 [2025-03-04 11:28:34,576 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 11:28:34,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:34,577 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:34,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 11:28:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-04 11:28:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-04 11:28:34,586 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 8 [2025-03-04 11:28:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:34,586 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-04 11:28:34,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-03-04 11:28:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 11:28:34,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:34,587 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:34,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:28:34,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:34,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:34,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1934561071, now seen corresponding path program 1 times [2025-03-04 11:28:34,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:34,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659388949] [2025-03-04 11:28:34,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:34,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:34,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:28:34,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:28:34,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:34,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:34,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:34,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659388949] [2025-03-04 11:28:34,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659388949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:34,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655880389] [2025-03-04 11:28:34,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:34,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:34,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:34,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:34,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:28:34,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:28:34,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:28:34,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:34,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:34,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:34,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:34,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:34,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655880389] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:34,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:34,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 11:28:34,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975104580] [2025-03-04 11:28:34,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:34,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:28:34,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:34,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:28:34,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:34,824 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:34,968 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2025-03-04 11:28:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:28:34,969 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 11:28:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:34,970 INFO L225 Difference]: With dead ends: 92 [2025-03-04 11:28:34,970 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 11:28:34,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:28:34,972 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 185 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:34,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 137 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 11:28:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2025-03-04 11:28:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 56 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:28:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2025-03-04 11:28:34,986 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 12 [2025-03-04 11:28:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:34,986 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2025-03-04 11:28:34,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2025-03-04 11:28:34,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:28:34,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:34,987 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:34,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:35,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:35,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:35,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1656507467, now seen corresponding path program 1 times [2025-03-04 11:28:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:35,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405037711] [2025-03-04 11:28:35,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:35,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:28:35,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:28:35,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:35,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:28:35,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:35,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405037711] [2025-03-04 11:28:35,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405037711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:35,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:35,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:28:35,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698998679] [2025-03-04 11:28:35,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:35,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:28:35,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:35,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:28:35,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:28:35,237 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:28:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:35,271 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2025-03-04 11:28:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:28:35,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-04 11:28:35,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:35,273 INFO L225 Difference]: With dead ends: 104 [2025-03-04 11:28:35,273 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 11:28:35,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:28:35,274 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:35,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 46 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 11:28:35,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 11:28:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 78 states have internal predecessors, (98), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:28:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2025-03-04 11:28:35,284 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 15 [2025-03-04 11:28:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:35,285 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2025-03-04 11:28:35,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:28:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2025-03-04 11:28:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 11:28:35,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:35,285 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 11:28:35,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:28:35,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:35,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:35,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1181735625, now seen corresponding path program 2 times [2025-03-04 11:28:35,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:35,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638927250] [2025-03-04 11:28:35,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:35,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:35,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 11:28:35,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:28:35,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:35,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:35,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:35,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638927250] [2025-03-04 11:28:35,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638927250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:35,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631997711] [2025-03-04 11:28:35,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:35,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:35,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:35,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:35,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:28:35,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 11:28:35,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:28:35,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:35,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:28:35,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:35,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631997711] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:35,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:35,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 11:28:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181267388] [2025-03-04 11:28:35,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:35,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:28:35,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:35,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:28:35,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:35,720 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:36,044 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2025-03-04 11:28:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:28:36,046 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-04 11:28:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:36,047 INFO L225 Difference]: With dead ends: 248 [2025-03-04 11:28:36,047 INFO L226 Difference]: Without dead ends: 247 [2025-03-04 11:28:36,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:28:36,051 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 485 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:36,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 283 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-04 11:28:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 207. [2025-03-04 11:28:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 171 states have (on average 1.3099415204678362) internal successors, (224), 174 states have internal predecessors, (224), 12 states have call successors, (12), 11 states have call predecessors, (12), 19 states have return successors, (21), 21 states have call predecessors, (21), 11 states have call successors, (21) [2025-03-04 11:28:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2025-03-04 11:28:36,079 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 27 [2025-03-04 11:28:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:36,079 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2025-03-04 11:28:36,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2025-03-04 11:28:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 11:28:36,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:36,079 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:36,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:36,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:36,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:36,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash -854576000, now seen corresponding path program 1 times [2025-03-04 11:28:36,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:36,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105672851] [2025-03-04 11:28:36,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:36,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:36,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:28:36,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:28:36,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:36,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:28:36,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:36,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105672851] [2025-03-04 11:28:36,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105672851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:36,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117540381] [2025-03-04 11:28:36,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:36,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:36,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:36,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:36,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:28:36,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:28:36,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:28:36,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:36,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:36,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:36,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:28:36,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:36,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117540381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:36,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:36,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 11:28:36,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542782854] [2025-03-04 11:28:36,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:36,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:28:36,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:36,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:28:36,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:28:36,400 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:28:36,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:36,435 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2025-03-04 11:28:36,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:36,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-04 11:28:36,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:36,437 INFO L225 Difference]: With dead ends: 207 [2025-03-04 11:28:36,437 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:28:36,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:28:36,438 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:36,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 41 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:28:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-04 11:28:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 171 states have (on average 1.1812865497076024) internal successors, (202), 172 states have internal predecessors, (202), 12 states have call successors, (12), 11 states have call predecessors, (12), 19 states have return successors, (21), 21 states have call predecessors, (21), 11 states have call successors, (21) [2025-03-04 11:28:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2025-03-04 11:28:36,456 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 27 [2025-03-04 11:28:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:36,456 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2025-03-04 11:28:36,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:28:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2025-03-04 11:28:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:28:36,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:36,457 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:36,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:36,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:36,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:36,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash -722052249, now seen corresponding path program 1 times [2025-03-04 11:28:36,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:36,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307163132] [2025-03-04 11:28:36,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:36,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:28:36,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:28:36,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:36,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:28:36,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:36,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307163132] [2025-03-04 11:28:36,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307163132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:36,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48571874] [2025-03-04 11:28:36,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:36,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:36,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:36,719 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:36,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:28:36,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:28:36,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:28:36,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:36,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:36,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:36,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:28:36,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:28:36,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48571874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:36,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:36,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 11:28:36,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725046846] [2025-03-04 11:28:36,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:36,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:28:36,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:36,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:28:36,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:36,871 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:28:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:36,924 INFO L93 Difference]: Finished difference Result 409 states and 494 transitions. [2025-03-04 11:28:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:28:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2025-03-04 11:28:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:36,926 INFO L225 Difference]: With dead ends: 409 [2025-03-04 11:28:36,926 INFO L226 Difference]: Without dead ends: 344 [2025-03-04 11:28:36,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:36,927 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:36,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 68 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-04 11:28:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-03-04 11:28:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 290 states have (on average 1.0586206896551724) internal successors, (307), 287 states have internal predecessors, (307), 12 states have call successors, (12), 11 states have call predecessors, (12), 40 states have return successors, (45), 45 states have call predecessors, (45), 11 states have call successors, (45) [2025-03-04 11:28:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 364 transitions. [2025-03-04 11:28:36,957 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 364 transitions. Word has length 28 [2025-03-04 11:28:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:36,957 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 364 transitions. [2025-03-04 11:28:36,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:28:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 364 transitions. [2025-03-04 11:28:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:28:36,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:36,958 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 11:28:36,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:37,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:37,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:37,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:37,160 INFO L85 PathProgramCache]: Analyzing trace with hash 439609801, now seen corresponding path program 3 times [2025-03-04 11:28:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:37,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667295961] [2025-03-04 11:28:37,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:37,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:37,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 11 equivalence classes. [2025-03-04 11:28:37,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:28:37,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:37,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:37,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:37,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667295961] [2025-03-04 11:28:37,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667295961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:37,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169976112] [2025-03-04 11:28:37,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:37,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:37,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:37,519 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:37,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:28:37,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 11 equivalence classes. [2025-03-04 11:28:37,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:28:37,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:37,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:37,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:28:37,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:37,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:38,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169976112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:38,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:38,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 11:28:38,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189982985] [2025-03-04 11:28:38,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:38,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 11:28:38,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:38,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 11:28:38,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:28:38,157 INFO L87 Difference]: Start difference. First operand 344 states and 364 transitions. Second operand has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:38,847 INFO L93 Difference]: Finished difference Result 823 states and 856 transitions. [2025-03-04 11:28:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 11:28:38,847 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-04 11:28:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:38,850 INFO L225 Difference]: With dead ends: 823 [2025-03-04 11:28:38,850 INFO L226 Difference]: Without dead ends: 822 [2025-03-04 11:28:38,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 11:28:38,853 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1162 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:38,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 481 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:28:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-03-04 11:28:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 800. [2025-03-04 11:28:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 674 states have (on average 1.0608308605341246) internal successors, (715), 671 states have internal predecessors, (715), 24 states have call successors, (24), 23 states have call predecessors, (24), 100 states have return successors, (105), 105 states have call predecessors, (105), 23 states have call successors, (105) [2025-03-04 11:28:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 844 transitions. [2025-03-04 11:28:38,911 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 844 transitions. Word has length 57 [2025-03-04 11:28:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:38,911 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 844 transitions. [2025-03-04 11:28:38,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 844 transitions. [2025-03-04 11:28:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 11:28:38,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:38,914 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:38,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:28:39,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:39,115 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:39,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:39,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1414418492, now seen corresponding path program 2 times [2025-03-04 11:28:39,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:39,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035357969] [2025-03-04 11:28:39,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:39,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:39,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-04 11:28:39,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 11:28:39,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:39,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:28:39,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:39,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035357969] [2025-03-04 11:28:39,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035357969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:39,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261243790] [2025-03-04 11:28:39,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:39,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:39,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:39,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:39,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:28:39,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-04 11:28:39,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 11:28:39,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:39,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:39,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:28:39,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:28:39,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:28:39,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261243790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:39,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 11:28:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392596217] [2025-03-04 11:28:39,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:39,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:28:39,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:39,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:28:39,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:39,855 INFO L87 Difference]: Start difference. First operand 800 states and 844 transitions. Second operand has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 11:28:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:39,955 INFO L93 Difference]: Finished difference Result 1743 states and 1924 transitions. [2025-03-04 11:28:39,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:28:39,956 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) Word has length 64 [2025-03-04 11:28:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:39,963 INFO L225 Difference]: With dead ends: 1743 [2025-03-04 11:28:39,964 INFO L226 Difference]: Without dead ends: 1439 [2025-03-04 11:28:39,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:39,967 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:39,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-03-04 11:28:40,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1439. [2025-03-04 11:28:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1226 states have (on average 1.0285481239804242) internal successors, (1261), 1217 states have internal predecessors, (1261), 24 states have call successors, (24), 23 states have call predecessors, (24), 187 states have return successors, (198), 198 states have call predecessors, (198), 23 states have call successors, (198) [2025-03-04 11:28:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1483 transitions. [2025-03-04 11:28:40,023 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1483 transitions. Word has length 64 [2025-03-04 11:28:40,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:40,023 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 1483 transitions. [2025-03-04 11:28:40,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 11:28:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1483 transitions. [2025-03-04 11:28:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 11:28:40,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:40,026 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2025-03-04 11:28:40,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:40,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:40,227 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:40,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:40,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1126217783, now seen corresponding path program 4 times [2025-03-04 11:28:40,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:40,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530340122] [2025-03-04 11:28:40,227 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:40,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:40,232 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 117 statements into 2 equivalence classes. [2025-03-04 11:28:40,255 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 11:28:40,255 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:40,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:41,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:41,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530340122] [2025-03-04 11:28:41,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530340122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:41,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104895249] [2025-03-04 11:28:41,337 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:41,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:41,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:41,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:41,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:28:41,368 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 117 statements into 2 equivalence classes. [2025-03-04 11:28:41,390 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 11:28:41,390 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:41,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:41,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 11:28:41,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:41,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:42,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104895249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:42,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:42,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-04 11:28:42,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852750520] [2025-03-04 11:28:42,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:42,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-04 11:28:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:42,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-04 11:28:42,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 11:28:42,945 INFO L87 Difference]: Start difference. First operand 1439 states and 1483 transitions. Second operand has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:45,006 INFO L93 Difference]: Finished difference Result 3406 states and 3475 transitions. [2025-03-04 11:28:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 11:28:45,008 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-03-04 11:28:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:45,018 INFO L225 Difference]: With dead ends: 3406 [2025-03-04 11:28:45,018 INFO L226 Difference]: Without dead ends: 3405 [2025-03-04 11:28:45,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2025-03-04 11:28:45,023 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 2219 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2220 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:45,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2220 Valid, 1054 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:28:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2025-03-04 11:28:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3359. [2025-03-04 11:28:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 2858 states have (on average 1.0290412876137158) internal successors, (2941), 2849 states have internal predecessors, (2941), 48 states have call successors, (48), 47 states have call predecessors, (48), 451 states have return successors, (462), 462 states have call predecessors, (462), 47 states have call successors, (462) [2025-03-04 11:28:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 3451 transitions. [2025-03-04 11:28:45,117 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 3451 transitions. Word has length 117 [2025-03-04 11:28:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:45,118 INFO L471 AbstractCegarLoop]: Abstraction has 3359 states and 3451 transitions. [2025-03-04 11:28:45,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 3451 transitions. [2025-03-04 11:28:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 11:28:45,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:45,122 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:45,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:28:45,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:45,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:45,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash -579282660, now seen corresponding path program 3 times [2025-03-04 11:28:45,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:45,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693593078] [2025-03-04 11:28:45,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:45,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:45,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 136 statements into 12 equivalence classes. [2025-03-04 11:28:45,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 131 of 136 statements. [2025-03-04 11:28:45,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:45,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 11:28:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693593078] [2025-03-04 11:28:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693593078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391765712] [2025-03-04 11:28:45,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:45,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:45,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:45,798 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:45,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:28:45,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 136 statements into 12 equivalence classes. [2025-03-04 11:28:45,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 131 of 136 statements. [2025-03-04 11:28:45,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:45,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:45,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 11:28:45,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 11:28:45,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 11:28:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391765712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:49,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-03-04 11:28:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591790823] [2025-03-04 11:28:49,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:49,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 11:28:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:49,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 11:28:49,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:28:49,761 INFO L87 Difference]: Start difference. First operand 3359 states and 3451 transitions. Second operand has 48 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 48 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (24), 23 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-04 11:28:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:49,990 INFO L93 Difference]: Finished difference Result 7260 states and 7915 transitions. [2025-03-04 11:28:49,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 11:28:49,991 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 48 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (24), 23 states have call predecessors, (24), 1 states have call successors, (24) Word has length 136 [2025-03-04 11:28:49,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:50,003 INFO L225 Difference]: With dead ends: 7260 [2025-03-04 11:28:50,003 INFO L226 Difference]: Without dead ends: 5897 [2025-03-04 11:28:50,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:28:50,006 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:50,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 133 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5897 states. [2025-03-04 11:28:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5897 to 5897. [2025-03-04 11:28:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5897 states, 5042 states have (on average 1.014081713605712) internal successors, (5113), 5021 states have internal predecessors, (5113), 48 states have call successors, (48), 47 states have call predecessors, (48), 805 states have return successors, (828), 828 states have call predecessors, (828), 47 states have call successors, (828) [2025-03-04 11:28:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 5989 transitions. [2025-03-04 11:28:50,142 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 5989 transitions. Word has length 136 [2025-03-04 11:28:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:50,143 INFO L471 AbstractCegarLoop]: Abstraction has 5897 states and 5989 transitions. [2025-03-04 11:28:50,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 48 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (24), 23 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-04 11:28:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 5989 transitions. [2025-03-04 11:28:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 11:28:50,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:50,148 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1] [2025-03-04 11:28:50,154 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:28:50,352 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,SelfDestructingSolverStorable10 [2025-03-04 11:28:50,352 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:50,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:50,353 INFO L85 PathProgramCache]: Analyzing trace with hash -855440439, now seen corresponding path program 5 times [2025-03-04 11:28:50,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:50,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732218995] [2025-03-04 11:28:50,354 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:50,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:50,360 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 237 statements into 47 equivalence classes. [2025-03-04 11:28:50,457 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 11:28:50,457 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 11:28:50,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:53,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:53,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732218995] [2025-03-04 11:28:53,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732218995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:53,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999409822] [2025-03-04 11:28:53,590 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:53,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:53,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:53,592 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:53,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:28:53,668 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 237 statements into 47 equivalence classes. [2025-03-04 11:28:53,766 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 11:28:53,766 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 11:28:53,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:53,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-04 11:28:53,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:54,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:58,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999409822] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:58,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:58,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-04 11:28:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010517923] [2025-03-04 11:28:58,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:58,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-04 11:28:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:58,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-04 11:28:58,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 11:28:58,964 INFO L87 Difference]: Start difference. First operand 5897 states and 5989 transitions. Second operand has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:07,545 INFO L93 Difference]: Finished difference Result 13864 states and 14005 transitions. [2025-03-04 11:29:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-04 11:29:07,550 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2025-03-04 11:29:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:07,584 INFO L225 Difference]: With dead ends: 13864 [2025-03-04 11:29:07,584 INFO L226 Difference]: Without dead ends: 13863 [2025-03-04 11:29:07,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2025-03-04 11:29:07,593 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 6832 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6833 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:07,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6833 Valid, 2269 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:29:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13863 states. [2025-03-04 11:29:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13863 to 13769. [2025-03-04 11:29:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13769 states, 11762 states have (on average 1.0141982656010882) internal successors, (11929), 11741 states have internal predecessors, (11929), 96 states have call successors, (96), 95 states have call predecessors, (96), 1909 states have return successors, (1932), 1932 states have call predecessors, (1932), 95 states have call successors, (1932) [2025-03-04 11:29:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13769 states to 13769 states and 13957 transitions. [2025-03-04 11:29:07,976 INFO L78 Accepts]: Start accepts. Automaton has 13769 states and 13957 transitions. Word has length 237 [2025-03-04 11:29:07,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:07,976 INFO L471 AbstractCegarLoop]: Abstraction has 13769 states and 13957 transitions. [2025-03-04 11:29:07,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 13769 states and 13957 transitions. [2025-03-04 11:29:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-04 11:29:07,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:07,984 INFO L218 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:07,992 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:08,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:08,186 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:08,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:08,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2125832924, now seen corresponding path program 4 times [2025-03-04 11:29:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:08,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884591821] [2025-03-04 11:29:08,187 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:29:08,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:08,193 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 280 statements into 2 equivalence classes. [2025-03-04 11:29:08,207 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 280 of 280 statements. [2025-03-04 11:29:08,208 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:29:08,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-04 11:29:09,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884591821] [2025-03-04 11:29:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884591821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030036474] [2025-03-04 11:29:09,321 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:29:09,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:09,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:09,323 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:09,324 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:09,397 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 280 statements into 2 equivalence classes. [2025-03-04 11:29:09,429 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 280 of 280 statements. [2025-03-04 11:29:09,429 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:29:09,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:09,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 11:29:09,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-04 11:29:09,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-04 11:29:45,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030036474] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:45,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:45,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 63 [2025-03-04 11:29:45,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583116780] [2025-03-04 11:29:45,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:45,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-04 11:29:45,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:45,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-04 11:29:45,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 11:29:45,122 INFO L87 Difference]: Start difference. First operand 13769 states and 13957 transitions. Second operand has 64 states, 63 states have (on average 3.0952380952380953) internal successors, (195), 64 states have internal predecessors, (195), 1 states have call successors, (2), 1 states have call predecessors, (2), 31 states have return successors, (31), 31 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-04 11:29:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:45,488 INFO L93 Difference]: Finished difference Result 19058 states and 20005 transitions. [2025-03-04 11:29:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-04 11:29:45,488 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.0952380952380953) internal successors, (195), 64 states have internal predecessors, (195), 1 states have call successors, (2), 1 states have call predecessors, (2), 31 states have return successors, (31), 31 states have call predecessors, (31), 1 states have call successors, (31) Word has length 280 [2025-03-04 11:29:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:45,536 INFO L225 Difference]: With dead ends: 19058 [2025-03-04 11:29:45,536 INFO L226 Difference]: Without dead ends: 17589 [2025-03-04 11:29:45,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 511 SyntacticMatches, 32 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2583 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 11:29:45,548 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:45,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17589 states. [2025-03-04 11:29:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17589 to 17589. [2025-03-04 11:29:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17589 states, 15042 states have (on average 1.0105704028719584) internal successors, (15201), 15013 states have internal predecessors, (15201), 96 states have call successors, (96), 95 states have call predecessors, (96), 2449 states have return successors, (2480), 2480 states have call predecessors, (2480), 95 states have call successors, (2480) [2025-03-04 11:29:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17589 states to 17589 states and 17777 transitions. [2025-03-04 11:29:45,994 INFO L78 Accepts]: Start accepts. Automaton has 17589 states and 17777 transitions. Word has length 280 [2025-03-04 11:29:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:45,994 INFO L471 AbstractCegarLoop]: Abstraction has 17589 states and 17777 transitions. [2025-03-04 11:29:45,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.0952380952380953) internal successors, (195), 64 states have internal predecessors, (195), 1 states have call successors, (2), 1 states have call predecessors, (2), 31 states have return successors, (31), 31 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-04 11:29:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 17589 states and 17777 transitions. [2025-03-04 11:29:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 11:29:46,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:46,011 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:46,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:29:46,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:29:46,212 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:46,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash -804566692, now seen corresponding path program 5 times [2025-03-04 11:29:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:46,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069264349] [2025-03-04 11:29:46,212 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:46,227 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 376 statements into 32 equivalence classes. [2025-03-04 11:29:46,316 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 11:29:46,316 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-04 11:29:46,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 3295 proven. 406 refuted. 0 times theorem prover too weak. 1881 trivial. 0 not checked. [2025-03-04 11:29:47,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:47,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069264349] [2025-03-04 11:29:47,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069264349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:47,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429977987] [2025-03-04 11:29:47,539 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:47,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:47,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:47,541 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:47,541 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:47,976 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 376 statements into 32 equivalence classes. [2025-03-04 11:29:48,045 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 11:29:48,045 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-04 11:29:48,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:48,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-04 11:29:48,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 3195 proven. 152 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2025-03-04 11:29:48,323 INFO L312 TraceCheckSpWp]: Computing backward predicates...