./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/recHanoi01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/recHanoi01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85b02fad28964214b0cd332ac12fce3136c6c5e9247130ab67f1c2c3baea22f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:28:28,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:28:28,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:28:28,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:28:28,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:28:28,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:28:28,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:28:28,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:28:28,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:28:28,091 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:28:28,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:28:28,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:28:28,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:28:28,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:28:28,092 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:28:28,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:28:28,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:28:28,092 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:28:28,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:28:28,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:28:28,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:28:28,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:28:28,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:28:28,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:28:28,093 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:28:28,093 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:28:28,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:28:28,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:28:28,093 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:28:28,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:28:28,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:28:28,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:28:28,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:28:28,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:28:28,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:28,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:28:28,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:28:28,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:28:28,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:28:28,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:28:28,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:28:28,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:28:28,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:28:28,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:28:28,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:28:28,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85b02fad28964214b0cd332ac12fce3136c6c5e9247130ab67f1c2c3baea22f9 [2025-03-04 11:28:28,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:28:28,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:28:28,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:28:28,333 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:28:28,333 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:28:28,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/recHanoi01.c [2025-03-04 11:28:29,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a15ad0e3/452b67b1d2b842b5bda4875cd9c5abbc/FLAG9f2ef352c [2025-03-04 11:28:29,681 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:28:29,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi01.c [2025-03-04 11:28:29,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a15ad0e3/452b67b1d2b842b5bda4875cd9c5abbc/FLAG9f2ef352c [2025-03-04 11:28:29,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a15ad0e3/452b67b1d2b842b5bda4875cd9c5abbc [2025-03-04 11:28:29,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:28:29,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:28:29,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:29,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:28:29,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:28:29,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29, skipping insertion in model container [2025-03-04 11:28:29,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:28:29,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:29,835 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:28:29,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:29,859 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:28:29,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29 WrapperNode [2025-03-04 11:28:29,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:29,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:29,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:28:29,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:28:29,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,881 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2025-03-04 11:28:29,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:29,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:28:29,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:28:29,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:28:29,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,900 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:28:29,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,903 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:28:29,907 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:28:29,907 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:28:29,907 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:28:29,908 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (1/1) ... [2025-03-04 11:28:29,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:29,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:29,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:28:29,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:28:29,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:28:29,957 INFO L130 BoogieDeclarations]: Found specification of procedure applyHanoi [2025-03-04 11:28:29,957 INFO L138 BoogieDeclarations]: Found implementation of procedure applyHanoi [2025-03-04 11:28:29,957 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2025-03-04 11:28:29,957 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2025-03-04 11:28:29,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:28:29,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:28:29,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:28:29,998 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:28:29,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:28:30,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: havoc #t~ret4; [2025-03-04 11:28:30,103 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-04 11:28:30,103 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:28:30,109 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:28:30,109 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:28:30,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:30 BoogieIcfgContainer [2025-03-04 11:28:30,110 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:28:30,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:28:30,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:28:30,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:28:30,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:28:29" (1/3) ... [2025-03-04 11:28:30,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74af4a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:30, skipping insertion in model container [2025-03-04 11:28:30,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:29" (2/3) ... [2025-03-04 11:28:30,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74af4a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:30, skipping insertion in model container [2025-03-04 11:28:30,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:30" (3/3) ... [2025-03-04 11:28:30,117 INFO L128 eAbstractionObserver]: Analyzing ICFG recHanoi01.c [2025-03-04 11:28:30,126 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:28:30,127 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recHanoi01.c that has 3 procedures, 48 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-04 11:28:30,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:28:30,177 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;@5f753f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:28:30,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 11:28:30,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:28:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:28:30,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:30,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:30,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting applyHanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:30,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash -304305886, now seen corresponding path program 1 times [2025-03-04 11:28:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:30,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001120318] [2025-03-04 11:28:30,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:30,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:30,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:28:30,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:28:30,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:30,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:30,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001120318] [2025-03-04 11:28:30,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001120318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:30,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:30,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:28:30,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934020530] [2025-03-04 11:28:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:30,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:28:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:30,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:28:30,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:28:30,395 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:30,460 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2025-03-04 11:28:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:28:30,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:28:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:30,467 INFO L225 Difference]: With dead ends: 84 [2025-03-04 11:28:30,467 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 11:28:30,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:30,474 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:30,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 11:28:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2025-03-04 11:28:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 40 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:28:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-03-04 11:28:30,506 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 7 [2025-03-04 11:28:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:30,506 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-03-04 11:28:30,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-03-04 11:28:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 11:28:30,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:30,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:30,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:28:30,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting applyHanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:30,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash -380180960, now seen corresponding path program 1 times [2025-03-04 11:28:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733994633] [2025-03-04 11:28:30,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:30,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:28:30,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:28:30,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:30,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:30,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:30,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733994633] [2025-03-04 11:28:30,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733994633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:30,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:30,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:30,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488685275] [2025-03-04 11:28:30,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:30,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:30,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:30,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:30,576 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:30,642 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2025-03-04 11:28:30,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:30,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2025-03-04 11:28:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:30,647 INFO L225 Difference]: With dead ends: 78 [2025-03-04 11:28:30,647 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 11:28:30,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:30,648 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:30,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 141 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 11:28:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2025-03-04 11:28:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 44 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:28:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-03-04 11:28:30,659 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 9 [2025-03-04 11:28:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:30,659 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-03-04 11:28:30,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-03-04 11:28:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 11:28:30,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:30,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:30,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:28:30,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1099292104, now seen corresponding path program 1 times [2025-03-04 11:28:30,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:30,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054083519] [2025-03-04 11:28:30,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:30,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 11:28:30,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 11:28:30,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:30,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:30,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:30,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054083519] [2025-03-04 11:28:30,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054083519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:30,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:30,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:30,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039530686] [2025-03-04 11:28:30,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:30,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:30,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:30,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:30,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:30,730 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:30,790 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2025-03-04 11:28:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:30,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2025-03-04 11:28:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:30,792 INFO L225 Difference]: With dead ends: 55 [2025-03-04 11:28:30,792 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 11:28:30,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:30,793 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:30,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 11:28:30,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-03-04 11:28:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:28:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-03-04 11:28:30,801 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 10 [2025-03-04 11:28:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:30,801 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-03-04 11:28:30,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-03-04 11:28:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:28:30,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:30,802 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:30,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:28:30,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting applyHanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:30,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash 744375675, now seen corresponding path program 1 times [2025-03-04 11:28:30,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:30,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961743438] [2025-03-04 11:28:30,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:30,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:30,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:28:30,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:28:30,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:30,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:30,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961743438] [2025-03-04 11:28:30,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961743438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:30,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253203549] [2025-03-04 11:28:30,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:30,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:30,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:30,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:30,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:28:30,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:28:30,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:28:30,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:30,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:30,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:30,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:31,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:31,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253203549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:31,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:31,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 11:28:31,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373661863] [2025-03-04 11:28:31,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:31,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:31,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:31,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:31,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:28:31,017 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:31,041 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-04 11:28:31,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:28:31,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 11:28:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:31,042 INFO L225 Difference]: With dead ends: 51 [2025-03-04 11:28:31,042 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 11:28:31,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:28:31,043 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:31,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 114 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 11:28:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 11:28:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 41 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:28:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-04 11:28:31,049 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2025-03-04 11:28:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:31,049 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-04 11:28:31,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-04 11:28:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:28:31,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:31,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:31,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:28:31,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:31,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting applyHanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:31,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1600809425, now seen corresponding path program 1 times [2025-03-04 11:28:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181045215] [2025-03-04 11:28:31,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:31,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:31,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:28:31,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:28:31,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:31,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:31,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:31,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181045215] [2025-03-04 11:28:31,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181045215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:31,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117789977] [2025-03-04 11:28:31,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:31,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:31,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:31,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:31,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:28:31,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:28:31,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:28:31,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:31,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:31,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:28:31,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:31,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:31,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117789977] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:31,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:31,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 11:28:31,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691749162] [2025-03-04 11:28:31,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:31,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:28:31,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:31,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:28:31,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:31,469 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:31,590 INFO L93 Difference]: Finished difference Result 157 states and 189 transitions. [2025-03-04 11:28:31,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:28:31,591 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 11:28:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:31,592 INFO L225 Difference]: With dead ends: 157 [2025-03-04 11:28:31,592 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 11:28:31,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:28:31,593 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 126 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:31,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 260 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 11:28:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 89. [2025-03-04 11:28:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (28), 13 states have call predecessors, (28), 13 states have call successors, (28) [2025-03-04 11:28:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2025-03-04 11:28:31,609 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 15 [2025-03-04 11:28:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:31,610 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2025-03-04 11:28:31,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2025-03-04 11:28:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 11:28:31,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:31,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:31,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:31,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:31,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting applyHanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:31,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:31,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1914515399, now seen corresponding path program 1 times [2025-03-04 11:28:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:31,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364355815] [2025-03-04 11:28:31,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:31,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:31,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:28:31,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:28:31,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:31,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:31,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:31,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364355815] [2025-03-04 11:28:31,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364355815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:31,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696252246] [2025-03-04 11:28:31,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:31,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:31,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:31,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:31,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:28:31,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:28:31,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:28:31,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:31,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:31,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:31,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:31,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696252246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:32,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 11:28:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125916271] [2025-03-04 11:28:32,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:32,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:28:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:32,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:28:32,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:32,001 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:32,080 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2025-03-04 11:28:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:28:32,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 16 [2025-03-04 11:28:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:32,081 INFO L225 Difference]: With dead ends: 95 [2025-03-04 11:28:32,081 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 11:28:32,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:28:32,082 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:32,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 209 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 11:28:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 11:28:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 73 states have internal predecessors, (75), 14 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (31), 13 states have call predecessors, (31), 13 states have call successors, (31) [2025-03-04 11:28:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2025-03-04 11:28:32,096 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 16 [2025-03-04 11:28:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:32,097 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2025-03-04 11:28:32,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2025-03-04 11:28:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:28:32,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:32,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:32,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:28:32,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:32,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:32,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:32,299 INFO L85 PathProgramCache]: Analyzing trace with hash -913284104, now seen corresponding path program 1 times [2025-03-04 11:28:32,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:32,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249335355] [2025-03-04 11:28:32,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:32,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:32,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:28:32,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:28:32,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:32,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:28:32,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249335355] [2025-03-04 11:28:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249335355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:32,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:32,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661795700] [2025-03-04 11:28:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:32,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:32,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:32,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:32,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:32,337 INFO L87 Difference]: Start difference. First operand 93 states and 120 transitions. Second operand has 5 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:28:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:32,364 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2025-03-04 11:28:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:32,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-03-04 11:28:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:32,366 INFO L225 Difference]: With dead ends: 113 [2025-03-04 11:28:32,366 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 11:28:32,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:32,367 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:32,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 135 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 11:28:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2025-03-04 11:28:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 81 states have internal predecessors, (88), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) [2025-03-04 11:28:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2025-03-04 11:28:32,400 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 28 [2025-03-04 11:28:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:32,400 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2025-03-04 11:28:32,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:28:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2025-03-04 11:28:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:28:32,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:32,401 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:32,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:28:32,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:32,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:32,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1752963849, now seen corresponding path program 1 times [2025-03-04 11:28:32,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:32,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015179638] [2025-03-04 11:28:32,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:32,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:32,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:28:32,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:28:32,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:32,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:28:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015179638] [2025-03-04 11:28:32,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015179638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528474541] [2025-03-04 11:28:32,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:32,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:32,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:32,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:32,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:28:32,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:28:32,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:28:32,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:32,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:32,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:28:32,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:28:32,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:32,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528474541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:32,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:32,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-04 11:28:32,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707829060] [2025-03-04 11:28:32,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:32,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:32,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:32,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:32,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:28:32,554 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. Second operand has 5 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:28:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:32,584 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2025-03-04 11:28:32,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:32,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-04 11:28:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:32,586 INFO L225 Difference]: With dead ends: 105 [2025-03-04 11:28:32,586 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 11:28:32,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:32,587 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:32,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 104 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 11:28:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-03-04 11:28:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 80 states have internal predecessors, (86), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) [2025-03-04 11:28:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2025-03-04 11:28:32,605 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 29 [2025-03-04 11:28:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:32,605 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2025-03-04 11:28:32,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:28:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2025-03-04 11:28:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:28:32,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:32,606 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:32,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:28:32,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:32,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:32,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1199778991, now seen corresponding path program 1 times [2025-03-04 11:28:32,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:32,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907839039] [2025-03-04 11:28:32,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:32,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:32,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:28:32,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:28:32,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:32,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:28:32,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907839039] [2025-03-04 11:28:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907839039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001638856] [2025-03-04 11:28:32,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:32,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:32,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:32,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:32,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:28:32,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:28:32,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:28:32,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:32,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:32,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:32,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:28:32,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:28:32,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001638856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:32,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:32,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 11:28:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676633762] [2025-03-04 11:28:32,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:32,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:28:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:32,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:28:32,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:32,987 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:28:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:33,080 INFO L93 Difference]: Finished difference Result 163 states and 196 transitions. [2025-03-04 11:28:33,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:28:33,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2025-03-04 11:28:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:33,081 INFO L225 Difference]: With dead ends: 163 [2025-03-04 11:28:33,081 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 11:28:33,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:28:33,082 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 173 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:33,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 259 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 11:28:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 138. [2025-03-04 11:28:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 110 states have internal predecessors, (131), 18 states have call successors, (18), 10 states have call predecessors, (18), 12 states have return successors, (35), 17 states have call predecessors, (35), 17 states have call successors, (35) [2025-03-04 11:28:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 184 transitions. [2025-03-04 11:28:33,096 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 184 transitions. Word has length 33 [2025-03-04 11:28:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:33,096 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 184 transitions. [2025-03-04 11:28:33,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:28:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 184 transitions. [2025-03-04 11:28:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:28:33,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:33,098 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 11:28:33,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:33,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:33,302 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting applyHanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:33,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash -419002550, now seen corresponding path program 2 times [2025-03-04 11:28:33,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:33,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702634327] [2025-03-04 11:28:33,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:33,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:33,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 11:28:33,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:28:33,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:33,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:33,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:33,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702634327] [2025-03-04 11:28:33,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702634327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:33,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104631882] [2025-03-04 11:28:33,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:33,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:33,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:33,521 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:33,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:28:33,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 11:28:33,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:28:33,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:33,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:33,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 11:28:33,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:33,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:33,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104631882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:33,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:33,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 11:28:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331140411] [2025-03-04 11:28:33,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:33,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:28:33,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:33,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:28:33,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:33,758 INFO L87 Difference]: Start difference. First operand 138 states and 184 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:34,154 INFO L93 Difference]: Finished difference Result 835 states and 1189 transitions. [2025-03-04 11:28:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:28:34,154 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-04 11:28:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:34,158 INFO L225 Difference]: With dead ends: 835 [2025-03-04 11:28:34,158 INFO L226 Difference]: Without dead ends: 834 [2025-03-04 11:28:34,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=332, Invalid=790, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:28:34,159 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 600 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:34,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 396 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-03-04 11:28:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 240. [2025-03-04 11:28:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 174 states have (on average 1.2011494252873562) internal successors, (209), 188 states have internal predecessors, (209), 36 states have call successors, (36), 16 states have call predecessors, (36), 24 states have return successors, (164), 35 states have call predecessors, (164), 35 states have call successors, (164) [2025-03-04 11:28:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 409 transitions. [2025-03-04 11:28:34,184 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 409 transitions. Word has length 36 [2025-03-04 11:28:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:34,184 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 409 transitions. [2025-03-04 11:28:34,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 409 transitions. [2025-03-04 11:28:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:28:34,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:34,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:34,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:34,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:34,390 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:34,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash -102661240, now seen corresponding path program 1 times [2025-03-04 11:28:34,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:34,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-03-04 11:28:34,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:34,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:34,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:28:34,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:28:34,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:34,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 11:28:34,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:34,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-03-04 11:28:34,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055825286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:34,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:34,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:28:34,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927850716] [2025-03-04 11:28:34,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:34,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:28:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:34,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:28:34,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:28:34,426 INFO L87 Difference]: Start difference. First operand 240 states and 409 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:28:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:34,456 INFO L93 Difference]: Finished difference Result 277 states and 462 transitions. [2025-03-04 11:28:34,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:28:34,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2025-03-04 11:28:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:34,460 INFO L225 Difference]: With dead ends: 277 [2025-03-04 11:28:34,460 INFO L226 Difference]: Without dead ends: 266 [2025-03-04 11:28:34,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:28:34,461 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:34,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 97 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-04 11:28:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-04 11:28:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 197 states have (on average 1.1725888324873097) internal successors, (231), 210 states have internal predecessors, (231), 36 states have call successors, (36), 16 states have call predecessors, (36), 27 states have return successors, (168), 39 states have call predecessors, (168), 35 states have call successors, (168) [2025-03-04 11:28:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 435 transitions. [2025-03-04 11:28:34,490 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 435 transitions. Word has length 36 [2025-03-04 11:28:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:34,490 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 435 transitions. [2025-03-04 11:28:34,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:28:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 435 transitions. [2025-03-04 11:28:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:28:34,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:34,493 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:34,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:28:34,493 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:34,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1498587320, now seen corresponding path program 2 times [2025-03-04 11:28:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:34,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103184797] [2025-03-04 11:28:34,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:34,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 11:28:34,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:28:34,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:34,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:28:34,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103184797] [2025-03-04 11:28:34,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103184797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847280557] [2025-03-04 11:28:34,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:34,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:34,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:34,663 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:34,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:28:34,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 11:28:34,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:28:34,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:34,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:34,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:28:34,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:28:34,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:28:34,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847280557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:34,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:34,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2025-03-04 11:28:34,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980326773] [2025-03-04 11:28:34,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:34,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 11:28:34,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:34,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 11:28:34,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:28:34,914 INFO L87 Difference]: Start difference. First operand 266 states and 435 transitions. Second operand has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 17 states have internal predecessors, (64), 13 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:28:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:35,236 INFO L93 Difference]: Finished difference Result 421 states and 585 transitions. [2025-03-04 11:28:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 11:28:35,237 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 17 states have internal predecessors, (64), 13 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 48 [2025-03-04 11:28:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:35,239 INFO L225 Difference]: With dead ends: 421 [2025-03-04 11:28:35,239 INFO L226 Difference]: Without dead ends: 420 [2025-03-04 11:28:35,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=1083, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 11:28:35,240 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 532 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:35,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 388 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-04 11:28:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 380. [2025-03-04 11:28:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 293 states have (on average 1.2184300341296928) internal successors, (357), 306 states have internal predecessors, (357), 42 states have call successors, (42), 22 states have call predecessors, (42), 39 states have return successors, (180), 51 states have call predecessors, (180), 41 states have call successors, (180) [2025-03-04 11:28:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 579 transitions. [2025-03-04 11:28:35,268 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 579 transitions. Word has length 48 [2025-03-04 11:28:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:35,268 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 579 transitions. [2025-03-04 11:28:35,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 17 states have internal predecessors, (64), 13 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:28:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 579 transitions. [2025-03-04 11:28:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:28:35,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:35,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:35,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:35,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:35,474 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:35,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2146241297, now seen corresponding path program 1 times [2025-03-04 11:28:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:35,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240889597] [2025-03-04 11:28:35,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:35,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:28:35,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:28:35,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:35,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 11:28:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:35,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240889597] [2025-03-04 11:28:35,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240889597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:35,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425271986] [2025-03-04 11:28:35,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:35,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:35,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:35,626 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:35,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:28:35,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:28:35,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:28:35,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:35,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:28:35,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 11:28:35,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:28:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425271986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:36,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 23 [2025-03-04 11:28:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786231327] [2025-03-04 11:28:36,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:28:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:36,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:28:36,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:28:36,030 INFO L87 Difference]: Start difference. First operand 380 states and 579 transitions. Second operand has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 19 states have internal predecessors, (66), 11 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 11:28:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:36,341 INFO L93 Difference]: Finished difference Result 697 states and 1209 transitions. [2025-03-04 11:28:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 11:28:36,342 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 19 states have internal predecessors, (66), 11 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 48 [2025-03-04 11:28:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:36,346 INFO L225 Difference]: With dead ends: 697 [2025-03-04 11:28:36,346 INFO L226 Difference]: Without dead ends: 550 [2025-03-04 11:28:36,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:28:36,349 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:36,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 238 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-04 11:28:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 505. [2025-03-04 11:28:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 380 states have (on average 1.1710526315789473) internal successors, (445), 392 states have internal predecessors, (445), 70 states have call successors, (70), 33 states have call predecessors, (70), 49 states have return successors, (387), 79 states have call predecessors, (387), 58 states have call successors, (387) [2025-03-04 11:28:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 902 transitions. [2025-03-04 11:28:36,399 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 902 transitions. Word has length 48 [2025-03-04 11:28:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:36,399 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 902 transitions. [2025-03-04 11:28:36,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 19 states have internal predecessors, (66), 11 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 11:28:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 902 transitions. [2025-03-04 11:28:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 11:28:36,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:36,403 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:36,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:28:36,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:28:36,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:36,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash 180942808, now seen corresponding path program 3 times [2025-03-04 11:28:36,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:36,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097786179] [2025-03-04 11:28:36,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:36,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:36,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 11 equivalence classes. [2025-03-04 11:28:36,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 78 statements. [2025-03-04 11:28:36,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:28:36,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-04 11:28:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:36,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097786179] [2025-03-04 11:28:36,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097786179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:36,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813524653] [2025-03-04 11:28:36,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:36,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:36,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:36,695 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:36,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:28:36,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 11 equivalence classes. [2025-03-04 11:28:36,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 78 statements. [2025-03-04 11:28:36,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:28:36,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:36,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:28:36,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-04 11:28:36,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-04 11:28:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813524653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:36,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:36,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 13 [2025-03-04 11:28:36,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723796434] [2025-03-04 11:28:36,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:36,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:28:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:36,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:28:36,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:28:36,896 INFO L87 Difference]: Start difference. First operand 505 states and 902 transitions. Second operand has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:28:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:37,014 INFO L93 Difference]: Finished difference Result 562 states and 959 transitions. [2025-03-04 11:28:37,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:28:37,014 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 78 [2025-03-04 11:28:37,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:37,017 INFO L225 Difference]: With dead ends: 562 [2025-03-04 11:28:37,017 INFO L226 Difference]: Without dead ends: 505 [2025-03-04 11:28:37,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:28:37,018 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:37,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 183 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-04 11:28:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-03-04 11:28:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 380 states have (on average 1.1710526315789473) internal successors, (445), 392 states have internal predecessors, (445), 70 states have call successors, (70), 33 states have call predecessors, (70), 49 states have return successors, (352), 79 states have call predecessors, (352), 57 states have call successors, (352) [2025-03-04 11:28:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 867 transitions. [2025-03-04 11:28:37,055 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 867 transitions. Word has length 78 [2025-03-04 11:28:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:37,055 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 867 transitions. [2025-03-04 11:28:37,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:28:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 867 transitions. [2025-03-04 11:28:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 11:28:37,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:37,057 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 11:28:37,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:37,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:28:37,258 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting applyHanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:37,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1046017450, now seen corresponding path program 3 times [2025-03-04 11:28:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:37,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861543939] [2025-03-04 11:28:37,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:37,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 11 equivalence classes. [2025-03-04 11:28:37,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 11:28:37,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:37,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:37,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:37,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861543939] [2025-03-04 11:28:37,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861543939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:37,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412421551] [2025-03-04 11:28:37,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:37,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:37,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:37,859 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:37,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:28:37,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 11 equivalence classes. [2025-03-04 11:28:37,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 11:28:37,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:37,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:37,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 11:28:37,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:38,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:38,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412421551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:38,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:38,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 49 [2025-03-04 11:28:38,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145569342] [2025-03-04 11:28:38,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:38,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-04 11:28:38,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:38,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-04 11:28:38,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=1805, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 11:28:38,481 INFO L87 Difference]: Start difference. First operand 505 states and 867 transitions. Second operand has 50 states, 49 states have (on average 2.9183673469387754) internal successors, (143), 50 states have internal predecessors, (143), 24 states have call successors, (24), 24 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:39,919 INFO L93 Difference]: Finished difference Result 4964 states and 7734 transitions. [2025-03-04 11:28:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 11:28:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.9183673469387754) internal successors, (143), 50 states have internal predecessors, (143), 24 states have call successors, (24), 24 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-04 11:28:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:39,943 INFO L225 Difference]: With dead ends: 4964 [2025-03-04 11:28:39,943 INFO L226 Difference]: Without dead ends: 4963 [2025-03-04 11:28:39,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1429, Invalid=3683, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 11:28:39,949 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 848 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:39,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1276 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:28:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4963 states. [2025-03-04 11:28:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4963 to 805. [2025-03-04 11:28:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 584 states have (on average 1.1318493150684932) internal successors, (661), 608 states have internal predecessors, (661), 130 states have call successors, (130), 45 states have call predecessors, (130), 85 states have return successors, (2008), 151 states have call predecessors, (2008), 117 states have call successors, (2008) [2025-03-04 11:28:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 2799 transitions. [2025-03-04 11:28:40,090 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 2799 transitions. Word has length 78 [2025-03-04 11:28:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:40,090 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 2799 transitions. [2025-03-04 11:28:40,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.9183673469387754) internal successors, (143), 50 states have internal predecessors, (143), 24 states have call successors, (24), 24 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 2799 transitions. [2025-03-04 11:28:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 11:28:40,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:40,097 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:40,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:40,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:28:40,297 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:40,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash -307024428, now seen corresponding path program 4 times [2025-03-04 11:28:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:40,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234934996] [2025-03-04 11:28:40,298 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:40,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:40,307 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 126 statements into 2 equivalence classes. [2025-03-04 11:28:40,314 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 126 statements. [2025-03-04 11:28:40,315 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:40,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 65 proven. 70 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:28:40,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:40,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234934996] [2025-03-04 11:28:40,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234934996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:40,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738902111] [2025-03-04 11:28:40,406 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:40,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:40,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:40,409 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:40,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:28:40,441 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 126 statements into 2 equivalence classes. [2025-03-04 11:28:40,463 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 126 statements. [2025-03-04 11:28:40,463 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:40,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:40,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:28:40,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 65 proven. 70 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:28:40,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 65 proven. 79 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-03-04 11:28:40,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738902111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:40,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:40,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2025-03-04 11:28:40,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099240302] [2025-03-04 11:28:40,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:40,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:28:40,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:40,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:28:40,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:28:40,978 INFO L87 Difference]: Start difference. First operand 805 states and 2799 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 10 states have call successors, (14), 2 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2025-03-04 11:28:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:41,202 INFO L93 Difference]: Finished difference Result 1929 states and 6732 transitions. [2025-03-04 11:28:41,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:28:41,202 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 10 states have call successors, (14), 2 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) Word has length 126 [2025-03-04 11:28:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:41,211 INFO L225 Difference]: With dead ends: 1929 [2025-03-04 11:28:41,211 INFO L226 Difference]: Without dead ends: 1141 [2025-03-04 11:28:41,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 249 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:41,226 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 71 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:41,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 273 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:41,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-04 11:28:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1009. [2025-03-04 11:28:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 771 states have (on average 1.0998702983138782) internal successors, (848), 753 states have internal predecessors, (848), 136 states have call successors, (136), 106 states have call predecessors, (136), 96 states have return successors, (495), 149 states have call predecessors, (495), 124 states have call successors, (495) [2025-03-04 11:28:41,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1479 transitions. [2025-03-04 11:28:41,323 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1479 transitions. Word has length 126 [2025-03-04 11:28:41,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:41,323 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1479 transitions. [2025-03-04 11:28:41,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 10 states have call successors, (14), 2 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2025-03-04 11:28:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1479 transitions. [2025-03-04 11:28:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 11:28:41,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:41,325 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:41,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:28:41,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:28:41,526 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:41,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1221291608, now seen corresponding path program 5 times [2025-03-04 11:28:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:41,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671409196] [2025-03-04 11:28:41,526 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:41,532 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 11 equivalence classes. [2025-03-04 11:28:41,546 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 11:28:41,546 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 11:28:41,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-04 11:28:41,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:41,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671409196] [2025-03-04 11:28:41,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671409196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:41,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833644317] [2025-03-04 11:28:41,846 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:41,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:41,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:41,848 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:41,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:28:41,884 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 11 equivalence classes. [2025-03-04 11:28:41,913 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 11:28:41,914 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 11:28:41,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:41,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 11:28:41,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 19 proven. 297 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-04 11:28:42,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 22 proven. 302 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-04 11:28:42,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833644317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:42,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:42,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28, 30] total 58 [2025-03-04 11:28:42,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145365700] [2025-03-04 11:28:42,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:42,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-04 11:28:42,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:42,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-04 11:28:42,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=2778, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 11:28:42,889 INFO L87 Difference]: Start difference. First operand 1009 states and 1479 transitions. Second operand has 59 states, 55 states have (on average 2.5090909090909093) internal successors, (138), 34 states have internal predecessors, (138), 30 states have call successors, (35), 24 states have call predecessors, (35), 5 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 11:28:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:43,113 INFO L93 Difference]: Finished difference Result 1013 states and 1479 transitions. [2025-03-04 11:28:43,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:28:43,114 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 2.5090909090909093) internal successors, (138), 34 states have internal predecessors, (138), 30 states have call successors, (35), 24 states have call predecessors, (35), 5 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) Word has length 110 [2025-03-04 11:28:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:43,120 INFO L225 Difference]: With dead ends: 1013 [2025-03-04 11:28:43,120 INFO L226 Difference]: Without dead ends: 937 [2025-03-04 11:28:43,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=808, Invalid=3224, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 11:28:43,122 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 198 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:43,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 258 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-03-04 11:28:43,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 933. [2025-03-04 11:28:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 713 states have (on average 1.1037868162692848) internal successors, (787), 695 states have internal predecessors, (787), 122 states have call successors, (122), 93 states have call predecessors, (122), 93 states have return successors, (479), 144 states have call predecessors, (479), 121 states have call successors, (479) [2025-03-04 11:28:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1388 transitions. [2025-03-04 11:28:43,194 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1388 transitions. Word has length 110 [2025-03-04 11:28:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:43,195 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1388 transitions. [2025-03-04 11:28:43,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 2.5090909090909093) internal successors, (138), 34 states have internal predecessors, (138), 30 states have call successors, (35), 24 states have call predecessors, (35), 5 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 11:28:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1388 transitions. [2025-03-04 11:28:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 11:28:43,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:43,196 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:43,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:43,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:28:43,397 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:43,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash 322465647, now seen corresponding path program 2 times [2025-03-04 11:28:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:43,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902989061] [2025-03-04 11:28:43,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:43,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:43,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-04 11:28:43,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 11:28:43,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:43,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-04 11:28:43,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:43,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902989061] [2025-03-04 11:28:43,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902989061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:43,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757514397] [2025-03-04 11:28:43,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:43,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:43,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:43,471 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:43,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:28:43,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-04 11:28:43,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 11:28:43,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:43,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:43,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:43,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-04 11:28:43,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:43,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757514397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:43,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:43,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 11:28:43,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541570140] [2025-03-04 11:28:43,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:43,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:28:43,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:43,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:28:43,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:28:43,568 INFO L87 Difference]: Start difference. First operand 933 states and 1388 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:28:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:43,620 INFO L93 Difference]: Finished difference Result 933 states and 1388 transitions. [2025-03-04 11:28:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:43,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 144 [2025-03-04 11:28:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:43,624 INFO L225 Difference]: With dead ends: 933 [2025-03-04 11:28:43,624 INFO L226 Difference]: Without dead ends: 931 [2025-03-04 11:28:43,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:28:43,625 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:43,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 89 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:43,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-04 11:28:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2025-03-04 11:28:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 713 states have (on average 1.0729312762973353) internal successors, (765), 693 states have internal predecessors, (765), 122 states have call successors, (122), 93 states have call predecessors, (122), 93 states have return successors, (479), 144 states have call predecessors, (479), 121 states have call successors, (479) [2025-03-04 11:28:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1366 transitions. [2025-03-04 11:28:43,695 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1366 transitions. Word has length 144 [2025-03-04 11:28:43,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:43,695 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1366 transitions. [2025-03-04 11:28:43,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:28:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1366 transitions. [2025-03-04 11:28:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 11:28:43,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:43,697 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:43,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:43,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:28:43,898 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:43,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1406500460, now seen corresponding path program 1 times [2025-03-04 11:28:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:43,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849092885] [2025-03-04 11:28:43,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:43,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 11:28:43,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 11:28:43,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:43,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-04 11:28:43,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:43,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849092885] [2025-03-04 11:28:43,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849092885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:43,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346474938] [2025-03-04 11:28:43,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:43,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:43,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:43,956 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:43,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:28:43,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 11:28:44,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 11:28:44,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:44,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:44,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:44,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-04 11:28:44,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-04 11:28:44,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346474938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:44,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:44,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 11:28:44,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443508783] [2025-03-04 11:28:44,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:44,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:28:44,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:44,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:28:44,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:44,222 INFO L87 Difference]: Start difference. First operand 931 states and 1366 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 11:28:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:44,299 INFO L93 Difference]: Finished difference Result 1135 states and 1625 transitions. [2025-03-04 11:28:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:28:44,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 1 states have call successors, (8) Word has length 145 [2025-03-04 11:28:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:44,304 INFO L225 Difference]: With dead ends: 1135 [2025-03-04 11:28:44,304 INFO L226 Difference]: Without dead ends: 1070 [2025-03-04 11:28:44,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:44,305 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:44,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 120 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-03-04 11:28:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2025-03-04 11:28:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 832 states have (on average 1.0456730769230769) internal successors, (870), 808 states have internal predecessors, (870), 122 states have call successors, (122), 93 states have call predecessors, (122), 114 states have return successors, (503), 168 states have call predecessors, (503), 121 states have call successors, (503) [2025-03-04 11:28:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1495 transitions. [2025-03-04 11:28:44,369 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1495 transitions. Word has length 145 [2025-03-04 11:28:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:44,369 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1495 transitions. [2025-03-04 11:28:44,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 11:28:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1495 transitions. [2025-03-04 11:28:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 11:28:44,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:44,372 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:44,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:44,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:44,573 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:44,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:44,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1172917837, now seen corresponding path program 2 times [2025-03-04 11:28:44,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:44,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130796578] [2025-03-04 11:28:44,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:44,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:44,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes. [2025-03-04 11:28:44,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 11:28:44,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:44,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 11:28:44,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:44,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130796578] [2025-03-04 11:28:44,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130796578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:44,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449490140] [2025-03-04 11:28:44,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:44,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:44,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:44,724 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:44,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:28:44,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes. [2025-03-04 11:28:44,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 11:28:44,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:44,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:44,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:28:44,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 97 proven. 236 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-04 11:28:45,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 97 proven. 285 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-04 11:28:46,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449490140] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:46,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:46,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 23] total 39 [2025-03-04 11:28:46,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271433343] [2025-03-04 11:28:46,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:46,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 11:28:46,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:46,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 11:28:46,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 11:28:46,047 INFO L87 Difference]: Start difference. First operand 1070 states and 1495 transitions. Second operand has 39 states, 37 states have (on average 3.918918918918919) internal successors, (145), 35 states have internal predecessors, (145), 18 states have call successors, (22), 3 states have call predecessors, (22), 16 states have return successors, (30), 17 states have call predecessors, (30), 16 states have call successors, (30) [2025-03-04 11:28:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:46,840 INFO L93 Difference]: Finished difference Result 1927 states and 2789 transitions. [2025-03-04 11:28:46,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 11:28:46,841 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 3.918918918918919) internal successors, (145), 35 states have internal predecessors, (145), 18 states have call successors, (22), 3 states have call predecessors, (22), 16 states have return successors, (30), 17 states have call predecessors, (30), 16 states have call successors, (30) Word has length 181 [2025-03-04 11:28:46,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:46,847 INFO L225 Difference]: With dead ends: 1927 [2025-03-04 11:28:46,847 INFO L226 Difference]: Without dead ends: 1244 [2025-03-04 11:28:46,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 326 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=643, Invalid=4187, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 11:28:46,849 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 271 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:46,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 315 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:28:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2025-03-04 11:28:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1180. [2025-03-04 11:28:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 911 states have (on average 1.0406147091108673) internal successors, (948), 886 states have internal predecessors, (948), 140 states have call successors, (140), 93 states have call predecessors, (140), 127 states have return successors, (638), 200 states have call predecessors, (638), 129 states have call successors, (638) [2025-03-04 11:28:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1726 transitions. [2025-03-04 11:28:46,915 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1726 transitions. Word has length 181 [2025-03-04 11:28:46,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:46,916 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1726 transitions. [2025-03-04 11:28:46,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 3.918918918918919) internal successors, (145), 35 states have internal predecessors, (145), 18 states have call successors, (22), 3 states have call predecessors, (22), 16 states have return successors, (30), 17 states have call predecessors, (30), 16 states have call successors, (30) [2025-03-04 11:28:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1726 transitions. [2025-03-04 11:28:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 11:28:46,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:46,919 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2025-03-04 11:28:46,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:28:47,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:47,123 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting applyHanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:47,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash -548148630, now seen corresponding path program 4 times [2025-03-04 11:28:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:47,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054266660] [2025-03-04 11:28:47,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:47,131 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 162 statements into 2 equivalence classes. [2025-03-04 11:28:47,162 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 11:28:47,162 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:47,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:48,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:48,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054266660] [2025-03-04 11:28:48,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054266660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:48,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049858988] [2025-03-04 11:28:48,450 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:48,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:48,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:48,452 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:48,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:28:48,499 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 162 statements into 2 equivalence classes. [2025-03-04 11:28:48,553 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 11:28:48,553 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:48,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:48,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-04 11:28:48,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:48,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:50,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049858988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:50,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:50,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 95 [2025-03-04 11:28:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737306551] [2025-03-04 11:28:50,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:50,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-04 11:28:50,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:50,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-04 11:28:50,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 11:28:50,039 INFO L87 Difference]: Start difference. First operand 1180 states and 1726 transitions. Second operand has 96 states, 95 states have (on average 2.957894736842105) internal successors, (281), 96 states have internal predecessors, (281), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:53,659 INFO L93 Difference]: Finished difference Result 5269 states and 8698 transitions. [2025-03-04 11:28:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-03-04 11:28:53,660 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 2.957894736842105) internal successors, (281), 96 states have internal predecessors, (281), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-03-04 11:28:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:53,685 INFO L225 Difference]: With dead ends: 5269 [2025-03-04 11:28:53,685 INFO L226 Difference]: Without dead ends: 5268 [2025-03-04 11:28:53,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4408 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=5642, Invalid=14380, Unknown=0, NotChecked=0, Total=20022 [2025-03-04 11:28:53,692 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1359 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:53,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 1306 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 11:28:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-03-04 11:28:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 2212. [2025-03-04 11:28:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2212 states, 1655 states have (on average 1.036858006042296) internal successors, (1716), 1606 states have internal predecessors, (1716), 308 states have call successors, (308), 189 states have call predecessors, (308), 247 states have return successors, (3410), 416 states have call predecessors, (3410), 285 states have call successors, (3410) [2025-03-04 11:28:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 5434 transitions. [2025-03-04 11:28:53,900 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 5434 transitions. Word has length 162 [2025-03-04 11:28:53,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:53,901 INFO L471 AbstractCegarLoop]: Abstraction has 2212 states and 5434 transitions. [2025-03-04 11:28:53,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 2.957894736842105) internal successors, (281), 96 states have internal predecessors, (281), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 5434 transitions. [2025-03-04 11:28:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-04 11:28:53,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:53,922 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1] [2025-03-04 11:28:53,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:54,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:54,126 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting applyHanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:28:54,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1593166870, now seen corresponding path program 5 times [2025-03-04 11:28:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:54,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266306586] [2025-03-04 11:28:54,127 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:54,138 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 330 statements into 47 equivalence classes. [2025-03-04 11:28:54,377 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 330 of 330 statements. [2025-03-04 11:28:54,377 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 11:28:54,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 7429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:59,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:59,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266306586] [2025-03-04 11:28:59,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266306586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:59,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780495651] [2025-03-04 11:28:59,108 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:59,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:59,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:59,109 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:59,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:28:59,179 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 330 statements into 47 equivalence classes. [2025-03-04 11:28:59,406 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 330 of 330 statements. [2025-03-04 11:28:59,406 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 11:28:59,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:59,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 189 conjuncts are in the unsatisfiable core [2025-03-04 11:28:59,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 7429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:59,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 7429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:04,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780495651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:04,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:04,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 95, 95] total 190 [2025-03-04 11:29:04,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312692600] [2025-03-04 11:29:04,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:04,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 191 states [2025-03-04 11:29:04,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:04,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2025-03-04 11:29:04,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9215, Invalid=27075, Unknown=0, NotChecked=0, Total=36290 [2025-03-04 11:29:04,607 INFO L87 Difference]: Start difference. First operand 2212 states and 5434 transitions. Second operand has 191 states, 189 states have (on average 2.9894179894179893) internal successors, (565), 191 states have internal predecessors, (565), 95 states have call successors, (95), 94 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)