./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/recHanoi02-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 14:30:51,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:30:51,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:30:51,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:30:51,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:30:51,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:30:51,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:30:51,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:30:51,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:30:51,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:30:51,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:30:51,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:30:51,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:30:51,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:30:51,812 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:30:51,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:30:51,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:30:51,812 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:30:51,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:30:51,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:30:51,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:30:51,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:30:51,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:30:51,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:30:51,813 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:30:51,813 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:30:51,813 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:30:51,814 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:30:51,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:30:51,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:30:51,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:30:51,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:30:51,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:30:51,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:30:51,815 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-jdk21/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-02-06 14:30:52,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:30:52,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:30:52,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:30:52,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:30:52,084 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:30:52,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/recHanoi02-2.c [2025-02-06 14:30:53,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20d60041b/cb21f3aff2a54ea8af103eeed3240d7a/FLAG2fb4d2666 [2025-02-06 14:30:53,628 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:30:53,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi02-2.c [2025-02-06 14:30:53,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20d60041b/cb21f3aff2a54ea8af103eeed3240d7a/FLAG2fb4d2666 [2025-02-06 14:30:53,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20d60041b/cb21f3aff2a54ea8af103eeed3240d7a [2025-02-06 14:30:53,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:30:53,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:30:53,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:30:53,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:30:53,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:30:53,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d1a6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53, skipping insertion in model container [2025-02-06 14:30:53,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:30:53,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:30:53,831 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:30:53,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:30:53,855 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:30:53,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53 WrapperNode [2025-02-06 14:30:53,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:30:53,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:30:53,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:30:53,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:30:53,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,880 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-02-06 14:30:53,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:30:53,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:30:53,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:30:53,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:30:53,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,901 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-02-06 14:30:53,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,903 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:30:53,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:30:53,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:30:53,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:30:53,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (1/1) ... [2025-02-06 14:30:53,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:30:53,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:30:53,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:30:53,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:30:53,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:30:53,956 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2025-02-06 14:30:53,956 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2025-02-06 14:30:53,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:30:53,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:30:53,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:30:53,995 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:30:53,997 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:30:54,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4; [2025-02-06 14:30:54,101 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 14:30:54,101 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:30:54,108 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:30:54,108 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:30:54,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:30:54 BoogieIcfgContainer [2025-02-06 14:30:54,108 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:30:54,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:30:54,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:30:54,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:30:54,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:30:53" (1/3) ... [2025-02-06 14:30:54,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114bdd46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:30:54, skipping insertion in model container [2025-02-06 14:30:54,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:53" (2/3) ... [2025-02-06 14:30:54,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114bdd46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:30:54, skipping insertion in model container [2025-02-06 14:30:54,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:30:54" (3/3) ... [2025-02-06 14:30:54,117 INFO L128 eAbstractionObserver]: Analyzing ICFG recHanoi02-2.c [2025-02-06 14:30:54,129 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:30:54,130 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-02-06 14:30:54,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:30:54,189 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;@5d327a83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:30:54,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 14:30:54,193 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-02-06 14:30:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 14:30:54,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:54,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:54,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:54,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash 77369545, now seen corresponding path program 1 times [2025-02-06 14:30:54,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:54,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424798555] [2025-02-06 14:30:54,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:54,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 14:30:54,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 14:30:54,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:54,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:54,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:54,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424798555] [2025-02-06 14:30:54,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424798555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:54,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:30:54,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:30:54,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38846410] [2025-02-06 14:30:54,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:54,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:30:54,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:54,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:30:54,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:30:54,385 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-02-06 14:30:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:54,491 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-02-06 14:30:54,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:30:54,496 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-02-06 14:30:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:54,500 INFO L225 Difference]: With dead ends: 53 [2025-02-06 14:30:54,500 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 14:30:54,502 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-02-06 14:30:54,504 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-02-06 14:30:54,504 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-02-06 14:30:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 14:30:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-02-06 14:30:54,534 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-02-06 14:30:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-02-06 14:30:54,540 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 7 [2025-02-06 14:30:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:54,540 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-02-06 14:30:54,541 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-02-06 14:30:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-02-06 14:30:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 14:30:54,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:54,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:54,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:30:54,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:54,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1896511420, now seen corresponding path program 1 times [2025-02-06 14:30:54,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:54,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004961661] [2025-02-06 14:30:54,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:54,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:30:54,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:30:54,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:54,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:54,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004961661] [2025-02-06 14:30:54,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004961661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:54,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:30:54,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:30:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197948160] [2025-02-06 14:30:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:54,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:30:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:54,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:30:54,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:30:54,621 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-02-06 14:30:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:54,660 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-02-06 14:30:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:30:54,661 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-02-06 14:30:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:54,662 INFO L225 Difference]: With dead ends: 34 [2025-02-06 14:30:54,662 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 14:30:54,663 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-02-06 14:30:54,664 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-02-06 14:30:54,664 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-02-06 14:30:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 14:30:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-02-06 14:30:54,673 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-02-06 14:30:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-02-06 14:30:54,674 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 8 [2025-02-06 14:30:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:54,674 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-02-06 14:30:54,674 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-02-06 14:30:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-02-06 14:30:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 14:30:54,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:54,674 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:54,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:30:54,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:54,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1934561071, now seen corresponding path program 1 times [2025-02-06 14:30:54,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:54,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661851818] [2025-02-06 14:30:54,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:54,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:30:54,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:30:54,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:54,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:54,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:54,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661851818] [2025-02-06 14:30:54,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661851818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:30:54,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226888343] [2025-02-06 14:30:54,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:54,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:30:54,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:30:54,818 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:30:54,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:30:54,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:30:54,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:30:54,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:54,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:54,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 14:30:54,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:30:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:54,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:30:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:54,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226888343] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:30:54,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:30:55,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 14:30:55,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128220400] [2025-02-06 14:30:55,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:30:55,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 14:30:55,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:55,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 14:30:55,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:30:55,003 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-02-06 14:30:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:55,177 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2025-02-06 14:30:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:30:55,178 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-02-06 14:30:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:55,179 INFO L225 Difference]: With dead ends: 92 [2025-02-06 14:30:55,180 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 14:30:55,181 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-02-06 14:30:55,181 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-02-06 14:30:55,182 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-02-06 14:30:55,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 14:30:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2025-02-06 14:30:55,197 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-02-06 14:30:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2025-02-06 14:30:55,199 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 12 [2025-02-06 14:30:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:55,199 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2025-02-06 14:30:55,199 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-02-06 14:30:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2025-02-06 14:30:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 14:30:55,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:55,200 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:55,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:30:55,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:30:55,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:55,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1656507467, now seen corresponding path program 1 times [2025-02-06 14:30:55,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:55,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479739772] [2025-02-06 14:30:55,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:55,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:55,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:30:55,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:30:55,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:55,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:30:55,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:55,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479739772] [2025-02-06 14:30:55,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479739772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:55,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:30:55,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:30:55,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52393131] [2025-02-06 14:30:55,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:55,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:30:55,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:55,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:30:55,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:30:55,481 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-02-06 14:30:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:55,520 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2025-02-06 14:30:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:30:55,520 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-02-06 14:30:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:55,522 INFO L225 Difference]: With dead ends: 104 [2025-02-06 14:30:55,522 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 14:30:55,522 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-02-06 14:30:55,523 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-02-06 14:30:55,523 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-02-06 14:30:55,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 14:30:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 14:30:55,534 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-02-06 14:30:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2025-02-06 14:30:55,536 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 15 [2025-02-06 14:30:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:55,536 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2025-02-06 14:30:55,536 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-02-06 14:30:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2025-02-06 14:30:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 14:30:55,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:55,539 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-02-06 14:30:55,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:30:55,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:55,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1181735625, now seen corresponding path program 2 times [2025-02-06 14:30:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:55,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181267388] [2025-02-06 14:30:55,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:30:55,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:55,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 14:30:55,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:30:55,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:30:55,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:55,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181267388] [2025-02-06 14:30:55,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181267388] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:30:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929743360] [2025-02-06 14:30:55,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:30:55,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:30:55,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:30:55,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:30:55,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:30:55,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 14:30:55,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:30:55,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:30:55,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:55,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 14:30:55,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:30:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:55,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:30:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:56,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929743360] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:30:56,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:30:56,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-02-06 14:30:56,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261189607] [2025-02-06 14:30:56,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:30:56,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 14:30:56,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:56,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 14:30:56,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:30:56,071 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-02-06 14:30:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:56,445 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2025-02-06 14:30:56,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 14:30:56,447 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-02-06 14:30:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:56,449 INFO L225 Difference]: With dead ends: 248 [2025-02-06 14:30:56,449 INFO L226 Difference]: Without dead ends: 247 [2025-02-06 14:30:56,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 14:30:56,450 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 485 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-02-06 14:30:56,450 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-02-06 14:30:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-06 14:30:56,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 207. [2025-02-06 14:30:56,486 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-02-06 14:30:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2025-02-06 14:30:56,490 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 27 [2025-02-06 14:30:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:56,491 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2025-02-06 14:30:56,491 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-02-06 14:30:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2025-02-06 14:30:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 14:30:56,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:56,492 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:56,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 14:30:56,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:30:56,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:56,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:56,697 INFO L85 PathProgramCache]: Analyzing trace with hash -854576000, now seen corresponding path program 1 times [2025-02-06 14:30:56,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:56,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156565699] [2025-02-06 14:30:56,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:56,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:56,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:30:56,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:30:56,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:56,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 14:30:56,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:56,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156565699] [2025-02-06 14:30:56,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156565699] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:30:56,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893821127] [2025-02-06 14:30:56,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:56,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:30:56,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:30:56,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:30:56,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:30:56,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:30:56,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:30:56,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:56,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:56,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 14:30:56,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:30:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 14:30:56,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:30:56,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893821127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:56,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:30:56,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 14:30:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138831091] [2025-02-06 14:30:56,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:56,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:30:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:56,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:30:56,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:30:56,854 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-02-06 14:30:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:56,895 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2025-02-06 14:30:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:30:56,896 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-02-06 14:30:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:56,898 INFO L225 Difference]: With dead ends: 207 [2025-02-06 14:30:56,900 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 14:30:56,900 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-02-06 14:30:56,901 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-02-06 14:30:56,901 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-02-06 14:30:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 14:30:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-06 14:30:56,928 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-02-06 14:30:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2025-02-06 14:30:56,932 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 27 [2025-02-06 14:30:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:56,933 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2025-02-06 14:30:56,933 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-02-06 14:30:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2025-02-06 14:30:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 14:30:56,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:56,934 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:56,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 14:30:57,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:30:57,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:57,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:57,139 INFO L85 PathProgramCache]: Analyzing trace with hash -722052249, now seen corresponding path program 1 times [2025-02-06 14:30:57,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:57,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337649402] [2025-02-06 14:30:57,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:57,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:57,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 14:30:57,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 14:30:57,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:57,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 14:30:57,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:57,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337649402] [2025-02-06 14:30:57,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337649402] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:30:57,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121441287] [2025-02-06 14:30:57,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:57,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:30:57,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:30:57,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:30:57,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:30:57,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 14:30:57,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 14:30:57,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:57,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:57,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 14:30:57,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:30:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 14:30:57,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:30:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 14:30:57,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121441287] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:30:57,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:30:57,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 14:30:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983021491] [2025-02-06 14:30:57,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:30:57,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 14:30:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:57,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 14:30:57,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:30:57,388 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-02-06 14:30:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:57,460 INFO L93 Difference]: Finished difference Result 409 states and 494 transitions. [2025-02-06 14:30:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:30:57,460 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-02-06 14:30:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:57,462 INFO L225 Difference]: With dead ends: 409 [2025-02-06 14:30:57,462 INFO L226 Difference]: Without dead ends: 344 [2025-02-06 14:30:57,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:30:57,463 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-02-06 14:30:57,468 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-02-06 14:30:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-06 14:30:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-02-06 14:30:57,496 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-02-06 14:30:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 364 transitions. [2025-02-06 14:30:57,498 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 364 transitions. Word has length 28 [2025-02-06 14:30:57,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:57,499 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 364 transitions. [2025-02-06 14:30:57,499 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-02-06 14:30:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 364 transitions. [2025-02-06 14:30:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 14:30:57,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:57,503 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2025-02-06 14:30:57,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 14:30:57,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 14:30:57,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:57,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash 439609801, now seen corresponding path program 3 times [2025-02-06 14:30:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:57,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587262006] [2025-02-06 14:30:57,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:30:57,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:57,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 11 equivalence classes. [2025-02-06 14:30:57,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 14:30:57,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 14:30:57,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:58,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:58,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587262006] [2025-02-06 14:30:58,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587262006] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:30:58,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342540406] [2025-02-06 14:30:58,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:30:58,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:30:58,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:30:58,167 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:30:58,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:30:58,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 11 equivalence classes. [2025-02-06 14:30:58,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 14:30:58,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 14:30:58,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:58,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 14:30:58,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:30:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:58,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:30:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:58,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342540406] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:30:58,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:30:58,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-02-06 14:30:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941243838] [2025-02-06 14:30:58,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:30:58,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 14:30:58,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:58,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 14:30:58,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 14:30:58,952 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-02-06 14:30:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:59,813 INFO L93 Difference]: Finished difference Result 823 states and 856 transitions. [2025-02-06 14:30:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-06 14:30:59,813 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-02-06 14:30:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:59,820 INFO L225 Difference]: With dead ends: 823 [2025-02-06 14:30:59,820 INFO L226 Difference]: Without dead ends: 822 [2025-02-06 14:30:59,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-02-06 14:30:59,823 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1162 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-02-06 14:30:59,824 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-02-06 14:30:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-02-06 14:30:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 800. [2025-02-06 14:30:59,876 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-02-06 14:30:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 844 transitions. [2025-02-06 14:30:59,881 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 844 transitions. Word has length 57 [2025-02-06 14:30:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:59,882 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 844 transitions. [2025-02-06 14:30:59,882 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-02-06 14:30:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 844 transitions. [2025-02-06 14:30:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 14:30:59,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:59,887 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:59,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 14:31:00,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:31:00,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:31:00,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:31:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1414418492, now seen corresponding path program 2 times [2025-02-06 14:31:00,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:31:00,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249788740] [2025-02-06 14:31:00,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:31:00,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:31:00,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-02-06 14:31:00,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 14:31:00,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:31:00,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:31:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 14:31:00,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:31:00,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249788740] [2025-02-06 14:31:00,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249788740] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:31:00,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188813956] [2025-02-06 14:31:00,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:31:00,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:31:00,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:31:00,261 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:31:00,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 14:31:00,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-02-06 14:31:00,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 14:31:00,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:31:00,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:31:00,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 14:31:00,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:31:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 14:31:00,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:31:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 14:31:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188813956] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:31:00,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:31:00,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-02-06 14:31:00,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464680206] [2025-02-06 14:31:00,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:31:00,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 14:31:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:31:00,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 14:31:00,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:31:00,996 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-02-06 14:31:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:31:01,130 INFO L93 Difference]: Finished difference Result 1743 states and 1924 transitions. [2025-02-06 14:31:01,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 14:31:01,130 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-02-06 14:31:01,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:31:01,139 INFO L225 Difference]: With dead ends: 1743 [2025-02-06 14:31:01,139 INFO L226 Difference]: Without dead ends: 1439 [2025-02-06 14:31:01,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:31:01,141 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-06 14:31:01,142 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-02-06 14:31:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-02-06 14:31:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1439. [2025-02-06 14:31:01,212 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-02-06 14:31:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1483 transitions. [2025-02-06 14:31:01,219 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1483 transitions. Word has length 64 [2025-02-06 14:31:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:31:01,219 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 1483 transitions. [2025-02-06 14:31:01,220 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-02-06 14:31:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1483 transitions. [2025-02-06 14:31:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 14:31:01,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:31:01,224 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2025-02-06 14:31:01,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 14:31:01,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 14:31:01,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:31:01,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:31:01,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1126217783, now seen corresponding path program 4 times [2025-02-06 14:31:01,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:31:01,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-02-06 14:31:01,428 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 14:31:01,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:31:01,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 117 statements into 2 equivalence classes. [2025-02-06 14:31:01,462 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 14:31:01,462 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 14:31:01,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:31:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:31:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:31:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-02-06 14:31:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113231668] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:31:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261749671] [2025-02-06 14:31:02,782 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 14:31:02,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:31:02,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:31:02,785 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:31:02,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 14:31:02,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 117 statements into 2 equivalence classes. [2025-02-06 14:31:02,847 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 14:31:02,848 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 14:31:02,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:31:02,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 14:31:02,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:31:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:31:03,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:31:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:31:04,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261749671] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:31:04,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:31:04,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-02-06 14:31:04,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876806395] [2025-02-06 14:31:04,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:31:04,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-02-06 14:31:04,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:31:04,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-06 14:31:04,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-02-06 14:31:04,916 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-02-06 14:31:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:31:07,382 INFO L93 Difference]: Finished difference Result 3406 states and 3475 transitions. [2025-02-06 14:31:07,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-06 14:31:07,383 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-02-06 14:31:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:31:07,397 INFO L225 Difference]: With dead ends: 3406 [2025-02-06 14:31:07,397 INFO L226 Difference]: Without dead ends: 3405 [2025-02-06 14:31:07,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2025-02-06 14:31:07,403 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 2219 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 14:31:07,403 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.6s Time] [2025-02-06 14:31:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2025-02-06 14:31:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3359. [2025-02-06 14:31:07,540 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-02-06 14:31:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 3451 transitions. [2025-02-06 14:31:07,552 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 3451 transitions. Word has length 117 [2025-02-06 14:31:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:31:07,553 INFO L471 AbstractCegarLoop]: Abstraction has 3359 states and 3451 transitions. [2025-02-06 14:31:07,553 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-02-06 14:31:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 3451 transitions. [2025-02-06 14:31:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 14:31:07,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:31:07,557 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 14:31:07,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 14:31:07,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:31:07,758 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:31:07,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:31:07,758 INFO L85 PathProgramCache]: Analyzing trace with hash -579282660, now seen corresponding path program 3 times [2025-02-06 14:31:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:31:07,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051032304] [2025-02-06 14:31:07,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:31:07,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:31:07,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 136 statements into 12 equivalence classes. [2025-02-06 14:31:07,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 131 of 136 statements. [2025-02-06 14:31:07,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 14:31:07,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:31:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-06 14:31:08,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:31:08,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051032304] [2025-02-06 14:31:08,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051032304] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:31:08,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883512551] [2025-02-06 14:31:08,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:31:08,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:31:08,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:31:08,393 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:31:08,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 14:31:08,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 136 statements into 12 equivalence classes. [2025-02-06 14:31:08,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 131 of 136 statements. [2025-02-06 14:31:08,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 14:31:08,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:31:08,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 14:31:08,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:31:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-06 14:31:08,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:31:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-06 14:31:13,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883512551] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:31:13,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:31:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-02-06 14:31:13,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033454757] [2025-02-06 14:31:13,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:31:13,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 14:31:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:31:13,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 14:31:13,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 14:31:13,326 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-02-06 14:31:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:31:13,561 INFO L93 Difference]: Finished difference Result 7260 states and 7915 transitions. [2025-02-06 14:31:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 14:31:13,565 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-02-06 14:31:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:31:13,588 INFO L225 Difference]: With dead ends: 7260 [2025-02-06 14:31:13,589 INFO L226 Difference]: Without dead ends: 5897 [2025-02-06 14:31:13,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 14:31:13,614 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-02-06 14:31:13,614 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-02-06 14:31:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5897 states. [2025-02-06 14:31:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5897 to 5897. [2025-02-06 14:31:13,793 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-02-06 14:31:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 5989 transitions. [2025-02-06 14:31:13,813 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 5989 transitions. Word has length 136 [2025-02-06 14:31:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:31:13,814 INFO L471 AbstractCegarLoop]: Abstraction has 5897 states and 5989 transitions. [2025-02-06 14:31:13,814 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-02-06 14:31:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 5989 transitions. [2025-02-06 14:31:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-06 14:31:13,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:31:13,824 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1] [2025-02-06 14:31:13,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 14:31:14,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:31:14,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:31:14,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:31:14,025 INFO L85 PathProgramCache]: Analyzing trace with hash -855440439, now seen corresponding path program 5 times [2025-02-06 14:31:14,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:31:14,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309341872] [2025-02-06 14:31:14,025 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 14:31:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:31:14,049 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 237 statements into 47 equivalence classes. [2025-02-06 14:31:14,188 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 237 of 237 statements. [2025-02-06 14:31:14,189 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-06 14:31:14,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:31:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:31:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:31:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309341872] [2025-02-06 14:31:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309341872] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:31:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566685807] [2025-02-06 14:31:18,142 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 14:31:18,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:31:18,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:31:18,144 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:31:18,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 14:31:18,235 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 237 statements into 47 equivalence classes. [2025-02-06 14:31:18,336 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 237 of 237 statements. [2025-02-06 14:31:18,337 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-06 14:31:18,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:31:18,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-06 14:31:18,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:31:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:31:18,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:31:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:31:24,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566685807] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:31:24,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:31:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-02-06 14:31:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359206347] [2025-02-06 14:31:24,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:31:24,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-02-06 14:31:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:31:24,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-02-06 14:31:24,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-02-06 14:31:24,893 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-02-06 14:31:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:31:34,242 INFO L93 Difference]: Finished difference Result 13864 states and 14005 transitions. [2025-02-06 14:31:34,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-02-06 14:31:34,243 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-02-06 14:31:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:31:34,284 INFO L225 Difference]: With dead ends: 13864 [2025-02-06 14:31:34,284 INFO L226 Difference]: Without dead ends: 13863 [2025-02-06 14:31:34,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2025-02-06 14:31:34,295 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 6832 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:31:34,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6833 Valid, 2269 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 14:31:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13863 states. [2025-02-06 14:31:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13863 to 13769. [2025-02-06 14:31:34,772 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-02-06 14:31:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13769 states to 13769 states and 13957 transitions. [2025-02-06 14:31:34,805 INFO L78 Accepts]: Start accepts. Automaton has 13769 states and 13957 transitions. Word has length 237 [2025-02-06 14:31:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:31:34,806 INFO L471 AbstractCegarLoop]: Abstraction has 13769 states and 13957 transitions. [2025-02-06 14:31:34,806 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-02-06 14:31:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 13769 states and 13957 transitions. [2025-02-06 14:31:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-02-06 14:31:34,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:31:34,822 INFO L218 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2025-02-06 14:31:34,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 14:31:35,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:31:35,023 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:31:35,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:31:35,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2125832924, now seen corresponding path program 4 times [2025-02-06 14:31:35,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:31:35,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026275302] [2025-02-06 14:31:35,023 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 14:31:35,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:31:35,033 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 280 statements into 2 equivalence classes. [2025-02-06 14:31:35,049 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 280 of 280 statements. [2025-02-06 14:31:35,049 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 14:31:35,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:31:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-02-06 14:31:36,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:31:36,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026275302] [2025-02-06 14:31:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026275302] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:31:36,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107901329] [2025-02-06 14:31:36,794 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 14:31:36,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:31:36,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:31:36,796 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:31:36,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 14:31:36,883 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 280 statements into 2 equivalence classes. [2025-02-06 14:31:36,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 280 of 280 statements. [2025-02-06 14:31:36,923 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 14:31:36,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:31:36,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 14:31:36,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:31:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-02-06 14:31:37,101 INFO L312 TraceCheckSpWp]: Computing backward predicates...