./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 e2fb8bed 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-?-e2fb8be-m [2025-03-09 02:41:03,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:41:03,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:41:03,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:41:03,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:41:03,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:41:03,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:41:03,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:41:03,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:41:03,912 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:41:03,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:41:03,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:41:03,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:41:03,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:41:03,914 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:41:03,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:41:03,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:41:03,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:41:03,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:41:03,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:41:03,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:41:03,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:41:03,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:41:03,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:41:03,914 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:41:03,914 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:41:03,915 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:41:03,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:41:03,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:41:03,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:41:03,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:41:03,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:41:03,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:41:03,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:41:03,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:41:03,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:41:03,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:41:03,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:41:03,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:41:03,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:41:03,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:41:03,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:41:03,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:41:03,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:41:03,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:41:03,916 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-09 02:41:04,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:41:04,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:41:04,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:41:04,143 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:41:04,143 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:41:04,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/recHanoi01.c [2025-03-09 02:41:05,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976e2ed7e/018699e3417446b7bff99bc0ffcd61b3/FLAG630597e23 [2025-03-09 02:41:05,417 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:41:05,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi01.c [2025-03-09 02:41:05,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976e2ed7e/018699e3417446b7bff99bc0ffcd61b3/FLAG630597e23 [2025-03-09 02:41:05,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976e2ed7e/018699e3417446b7bff99bc0ffcd61b3 [2025-03-09 02:41:05,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:41:05,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:41:05,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:05,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:41:05,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:41:05,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99c01a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05, skipping insertion in model container [2025-03-09 02:41:05,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:41:05,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:05,611 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:41:05,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:05,631 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:41:05,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05 WrapperNode [2025-03-09 02:41:05,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:05,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:05,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:41:05,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:41:05,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,654 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2025-03-09 02:41:05,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:05,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:41:05,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:41:05,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:41:05,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,673 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-09 02:41:05,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:41:05,682 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:41:05,682 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:41:05,682 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:41:05,683 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (1/1) ... [2025-03-09 02:41:05,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:41:05,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:05,712 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-09 02:41:05,714 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-09 02:41:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:41:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure applyHanoi [2025-03-09 02:41:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure applyHanoi [2025-03-09 02:41:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2025-03-09 02:41:05,733 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2025-03-09 02:41:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:41:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:41:05,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:41:05,775 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:41:05,776 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:41:05,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: havoc #t~ret4; [2025-03-09 02:41:05,926 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-09 02:41:05,927 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:41:05,934 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:41:05,935 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:41:05,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:05 BoogieIcfgContainer [2025-03-09 02:41:05,935 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:41:05,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:41:05,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:41:05,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:41:05,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:41:05" (1/3) ... [2025-03-09 02:41:05,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667247be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:05, skipping insertion in model container [2025-03-09 02:41:05,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:05" (2/3) ... [2025-03-09 02:41:05,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667247be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:05, skipping insertion in model container [2025-03-09 02:41:05,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:05" (3/3) ... [2025-03-09 02:41:05,945 INFO L128 eAbstractionObserver]: Analyzing ICFG recHanoi01.c [2025-03-09 02:41:05,956 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:41:05,957 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-09 02:41:05,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:41:06,002 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;@26659857, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:41:06,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-09 02:41:06,005 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-09 02:41:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:41:06,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:06,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:06,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting applyHanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:06,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash -304305886, now seen corresponding path program 1 times [2025-03-09 02:41:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:06,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193165385] [2025-03-09 02:41:06,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:06,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:06,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:41:06,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:41:06,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:06,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,191 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-09 02:41:06,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:06,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193165385] [2025-03-09 02:41:06,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193165385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:06,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:06,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:41:06,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855337975] [2025-03-09 02:41:06,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:06,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:41:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:06,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:41:06,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:41:06,209 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-09 02:41:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:06,275 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2025-03-09 02:41:06,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:41:06,278 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-09 02:41:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:06,282 INFO L225 Difference]: With dead ends: 84 [2025-03-09 02:41:06,282 INFO L226 Difference]: Without dead ends: 66 [2025-03-09 02:41:06,284 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-09 02:41:06,285 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-09 02:41:06,286 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-09 02:41:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-09 02:41:06,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2025-03-09 02:41:06,307 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-09 02:41:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-03-09 02:41:06,312 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 7 [2025-03-09 02:41:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:06,312 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-03-09 02:41:06,313 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-09 02:41:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-03-09 02:41:06,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:41:06,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:06,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:06,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:41:06,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting applyHanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:06,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:06,314 INFO L85 PathProgramCache]: Analyzing trace with hash -380180960, now seen corresponding path program 1 times [2025-03-09 02:41:06,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:06,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072704187] [2025-03-09 02:41:06,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:06,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:06,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:41:06,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:41:06,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:06,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,376 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-09 02:41:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072704187] [2025-03-09 02:41:06,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072704187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:06,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:06,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:06,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264051242] [2025-03-09 02:41:06,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:06,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:06,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:06,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:06,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:06,379 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-09 02:41:06,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:06,450 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2025-03-09 02:41:06,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:06,450 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-09 02:41:06,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:06,451 INFO L225 Difference]: With dead ends: 78 [2025-03-09 02:41:06,451 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 02:41:06,451 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-09 02:41:06,451 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-09 02:41:06,452 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-09 02:41:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 02:41:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2025-03-09 02:41:06,456 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-09 02:41:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-03-09 02:41:06,458 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 9 [2025-03-09 02:41:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:06,458 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-03-09 02:41:06,459 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-09 02:41:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-03-09 02:41:06,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 02:41:06,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:06,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:06,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:41:06,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:06,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:06,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1099292104, now seen corresponding path program 1 times [2025-03-09 02:41:06,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:06,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436744225] [2025-03-09 02:41:06,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:06,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:06,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:41:06,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:41:06,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:06,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,525 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-09 02:41:06,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:06,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436744225] [2025-03-09 02:41:06,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436744225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:06,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:06,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:06,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482455920] [2025-03-09 02:41:06,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:06,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:06,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:06,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:06,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:06,527 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-09 02:41:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:06,589 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2025-03-09 02:41:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:06,589 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-09 02:41:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:06,593 INFO L225 Difference]: With dead ends: 55 [2025-03-09 02:41:06,593 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 02:41:06,593 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-09 02:41:06,594 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-09 02:41:06,594 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-09 02:41:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 02:41:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-03-09 02:41:06,603 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-09 02:41:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-03-09 02:41:06,604 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 10 [2025-03-09 02:41:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:06,604 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-03-09 02:41:06,604 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-09 02:41:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-03-09 02:41:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 02:41:06,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:06,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:06,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:41:06,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting applyHanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:06,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:06,609 INFO L85 PathProgramCache]: Analyzing trace with hash 744375675, now seen corresponding path program 1 times [2025-03-09 02:41:06,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:06,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845285678] [2025-03-09 02:41:06,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:06,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:06,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 02:41:06,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 02:41:06,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:06,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,718 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-09 02:41:06,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:06,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845285678] [2025-03-09 02:41:06,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845285678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:06,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334144023] [2025-03-09 02:41:06,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:06,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:06,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:06,720 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-09 02:41:06,721 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-09 02:41:06,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 02:41:06,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 02:41:06,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:06,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:41:06,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:06,824 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-09 02:41:06,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:06,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334144023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:06,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:06,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-09 02:41:06,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967325842] [2025-03-09 02:41:06,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:06,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:06,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:06,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:06,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:41:06,826 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-09 02:41:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:06,847 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-09 02:41:06,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:41:06,851 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-09 02:41:06,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:06,852 INFO L225 Difference]: With dead ends: 51 [2025-03-09 02:41:06,852 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 02:41:06,852 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-09 02:41:06,853 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-09 02:41:06,853 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-09 02:41:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 02:41:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-09 02:41:06,861 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-09 02:41:06,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-09 02:41:06,862 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2025-03-09 02:41:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:06,864 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-09 02:41:06,864 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-09 02:41:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-09 02:41:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:41:06,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:06,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:06,871 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-09 02:41:07,065 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-09 02:41:07,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting applyHanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:07,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1600809425, now seen corresponding path program 1 times [2025-03-09 02:41:07,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:07,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933141304] [2025-03-09 02:41:07,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:07,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:07,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:41:07,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:41:07,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:07,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:07,162 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-09 02:41:07,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:07,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933141304] [2025-03-09 02:41:07,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933141304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:07,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624573075] [2025-03-09 02:41:07,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:07,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:07,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:07,165 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-09 02:41:07,166 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-09 02:41:07,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:41:07,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:41:07,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:07,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:07,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:41:07,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:07,228 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-09 02:41:07,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:07,281 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-09 02:41:07,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624573075] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:07,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:07,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 02:41:07,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146084860] [2025-03-09 02:41:07,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:07,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:41:07,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:07,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:41:07,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:41:07,282 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-09 02:41:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:07,443 INFO L93 Difference]: Finished difference Result 157 states and 189 transitions. [2025-03-09 02:41:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:41:07,444 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-09 02:41:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:07,446 INFO L225 Difference]: With dead ends: 157 [2025-03-09 02:41:07,446 INFO L226 Difference]: Without dead ends: 156 [2025-03-09 02:41:07,446 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-09 02:41:07,450 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-09 02:41:07,450 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-09 02:41:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-09 02:41:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 89. [2025-03-09 02:41:07,461 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-09 02:41:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2025-03-09 02:41:07,463 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 15 [2025-03-09 02:41:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:07,464 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2025-03-09 02:41:07,464 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-09 02:41:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2025-03-09 02:41:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:41:07,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:07,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:07,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:41:07,666 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-09 02:41:07,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting applyHanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:07,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1914515399, now seen corresponding path program 1 times [2025-03-09 02:41:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443504838] [2025-03-09 02:41:07,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:07,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:07,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:41:07,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:41:07,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:07,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:07,730 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-09 02:41:07,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443504838] [2025-03-09 02:41:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443504838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944220959] [2025-03-09 02:41:07,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:07,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:07,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:07,733 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-09 02:41:07,735 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-09 02:41:07,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:41:07,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:41:07,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:07,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:07,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:41:07,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:07,785 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-09 02:41:07,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:07,839 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-09 02:41:07,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944220959] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:07,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:07,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 02:41:07,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166478821] [2025-03-09 02:41:07,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:07,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:41:07,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:07,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:41:07,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:41:07,842 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-09 02:41:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:07,921 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2025-03-09 02:41:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:41:07,922 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-09 02:41:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:07,923 INFO L225 Difference]: With dead ends: 95 [2025-03-09 02:41:07,923 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 02:41:07,923 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-09 02:41:07,924 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:07,924 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.1s Time] [2025-03-09 02:41:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 02:41:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-09 02:41:07,933 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-09 02:41:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2025-03-09 02:41:07,934 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 16 [2025-03-09 02:41:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2025-03-09 02:41:07,934 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-09 02:41:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2025-03-09 02:41:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:41:07,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:07,935 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-09 02:41:07,940 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-09 02:41:08,135 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-09 02:41:08,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:08,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:08,136 INFO L85 PathProgramCache]: Analyzing trace with hash -913284104, now seen corresponding path program 1 times [2025-03-09 02:41:08,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:08,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693847966] [2025-03-09 02:41:08,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:08,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:08,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:41:08,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:41:08,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:08,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:08,174 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-09 02:41:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693847966] [2025-03-09 02:41:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693847966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:08,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:08,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:08,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470090624] [2025-03-09 02:41:08,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:08,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:08,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:08,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:08,175 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-09 02:41:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:08,215 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2025-03-09 02:41:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:08,215 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-09 02:41:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:08,216 INFO L225 Difference]: With dead ends: 113 [2025-03-09 02:41:08,216 INFO L226 Difference]: Without dead ends: 108 [2025-03-09 02:41:08,216 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-09 02:41:08,216 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-09 02:41:08,217 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-09 02:41:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-09 02:41:08,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2025-03-09 02:41:08,226 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-09 02:41:08,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2025-03-09 02:41:08,226 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 28 [2025-03-09 02:41:08,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:08,227 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2025-03-09 02:41:08,227 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-09 02:41:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2025-03-09 02:41:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:41:08,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:08,227 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-09 02:41:08,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:41:08,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:08,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1752963849, now seen corresponding path program 1 times [2025-03-09 02:41:08,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:08,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488704297] [2025-03-09 02:41:08,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:08,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:08,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:41:08,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:41:08,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:08,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:08,301 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-09 02:41:08,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:08,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488704297] [2025-03-09 02:41:08,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488704297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:08,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627052948] [2025-03-09 02:41:08,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:08,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:08,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:08,304 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-09 02:41:08,306 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-09 02:41:08,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:41:08,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:41:08,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:08,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:08,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:41:08,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:08,369 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-09 02:41:08,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:08,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627052948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:08,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:08,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-09 02:41:08,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696362521] [2025-03-09 02:41:08,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:08,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:08,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:08,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:08,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:41:08,371 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-09 02:41:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:08,399 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2025-03-09 02:41:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:08,399 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-09 02:41:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:08,400 INFO L225 Difference]: With dead ends: 105 [2025-03-09 02:41:08,400 INFO L226 Difference]: Without dead ends: 104 [2025-03-09 02:41:08,400 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-09 02:41:08,401 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-09 02:41:08,401 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-09 02:41:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-09 02:41:08,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-03-09 02:41:08,409 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-09 02:41:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2025-03-09 02:41:08,410 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 29 [2025-03-09 02:41:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:08,411 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2025-03-09 02:41:08,411 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-09 02:41:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2025-03-09 02:41:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 02:41:08,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:08,412 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-09 02:41:08,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:08,612 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-09 02:41:08,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:08,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1199778991, now seen corresponding path program 1 times [2025-03-09 02:41:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:08,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124989851] [2025-03-09 02:41:08,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:08,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:41:08,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:41:08,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:08,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:08,687 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-09 02:41:08,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:08,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124989851] [2025-03-09 02:41:08,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124989851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:08,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554027536] [2025-03-09 02:41:08,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:08,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:08,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:08,690 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-09 02:41:08,691 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-09 02:41:08,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:41:08,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:41:08,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:08,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:08,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:41:08,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:08,742 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-09 02:41:08,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:08,800 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-09 02:41:08,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554027536] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:08,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:08,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 02:41:08,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334703125] [2025-03-09 02:41:08,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:08,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:41:08,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:08,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:41:08,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:41:08,802 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-09 02:41:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:08,890 INFO L93 Difference]: Finished difference Result 163 states and 196 transitions. [2025-03-09 02:41:08,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:41:08,891 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-09 02:41:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:08,892 INFO L225 Difference]: With dead ends: 163 [2025-03-09 02:41:08,892 INFO L226 Difference]: Without dead ends: 162 [2025-03-09 02:41:08,892 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-09 02:41:08,892 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-09 02:41:08,893 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-09 02:41:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-09 02:41:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 138. [2025-03-09 02:41:08,906 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-09 02:41:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 184 transitions. [2025-03-09 02:41:08,907 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 184 transitions. Word has length 33 [2025-03-09 02:41:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:08,907 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 184 transitions. [2025-03-09 02:41:08,907 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-09 02:41:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 184 transitions. [2025-03-09 02:41:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:41:08,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:08,908 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-09 02:41:08,913 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-09 02:41:09,112 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-09 02:41:09,113 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting applyHanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:09,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:09,113 INFO L85 PathProgramCache]: Analyzing trace with hash -419002550, now seen corresponding path program 2 times [2025-03-09 02:41:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:09,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808668224] [2025-03-09 02:41:09,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:09,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 02:41:09,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:41:09,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:09,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:09,322 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-09 02:41:09,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:09,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808668224] [2025-03-09 02:41:09,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808668224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:09,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679487408] [2025-03-09 02:41:09,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:09,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:09,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:09,324 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-09 02:41:09,326 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-09 02:41:09,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 02:41:09,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:41:09,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:09,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:09,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 02:41:09,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:09,417 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-09 02:41:09,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:09,554 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-09 02:41:09,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679487408] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:09,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:09,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-09 02:41:09,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437740815] [2025-03-09 02:41:09,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:09,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 02:41:09,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:09,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 02:41:09,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:41:09,556 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-09 02:41:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:09,961 INFO L93 Difference]: Finished difference Result 835 states and 1189 transitions. [2025-03-09 02:41:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 02:41:09,962 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-09 02:41:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:09,968 INFO L225 Difference]: With dead ends: 835 [2025-03-09 02:41:09,968 INFO L226 Difference]: Without dead ends: 834 [2025-03-09 02:41:09,970 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-09 02:41:09,970 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 600 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:09,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 396 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-03-09 02:41:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 240. [2025-03-09 02:41:10,007 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-09 02:41:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 409 transitions. [2025-03-09 02:41:10,010 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 409 transitions. Word has length 36 [2025-03-09 02:41:10,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:10,010 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 409 transitions. [2025-03-09 02:41:10,010 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-09 02:41:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 409 transitions. [2025-03-09 02:41:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:41:10,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:10,011 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-09 02:41:10,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:41:10,215 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-09 02:41:10,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:10,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:10,215 INFO L85 PathProgramCache]: Analyzing trace with hash -102661240, now seen corresponding path program 1 times [2025-03-09 02:41:10,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:10,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144618966] [2025-03-09 02:41:10,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:10,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:10,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:41:10,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:41:10,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:10,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:10,241 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-09 02:41:10,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:10,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144618966] [2025-03-09 02:41:10,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144618966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:10,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:41:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814040905] [2025-03-09 02:41:10,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:10,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:41:10,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:10,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:41:10,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:41:10,243 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-09 02:41:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:10,270 INFO L93 Difference]: Finished difference Result 277 states and 462 transitions. [2025-03-09 02:41:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:41:10,270 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-09 02:41:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:10,272 INFO L225 Difference]: With dead ends: 277 [2025-03-09 02:41:10,272 INFO L226 Difference]: Without dead ends: 266 [2025-03-09 02:41:10,272 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-09 02:41:10,273 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-09 02:41:10,273 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-09 02:41:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-09 02:41:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-09 02:41:10,303 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-09 02:41:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 435 transitions. [2025-03-09 02:41:10,306 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 435 transitions. Word has length 36 [2025-03-09 02:41:10,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:10,306 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 435 transitions. [2025-03-09 02:41:10,306 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-09 02:41:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 435 transitions. [2025-03-09 02:41:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:41:10,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:10,310 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-09 02:41:10,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:41:10,311 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:10,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1498587320, now seen corresponding path program 2 times [2025-03-09 02:41:10,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:10,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570909768] [2025-03-09 02:41:10,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:10,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:10,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-09 02:41:10,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:41:10,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:10,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:10,498 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-09 02:41:10,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570909768] [2025-03-09 02:41:10,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570909768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602120665] [2025-03-09 02:41:10,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:10,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:10,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:10,501 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-09 02:41:10,503 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-09 02:41:10,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-09 02:41:10,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:41:10,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:10,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:10,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:41:10,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:10,576 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-09 02:41:10,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:10,744 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-09 02:41:10,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602120665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:10,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:10,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2025-03-09 02:41:10,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119004414] [2025-03-09 02:41:10,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:10,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-09 02:41:10,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:10,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 02:41:10,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2025-03-09 02:41:10,747 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-09 02:41:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:11,070 INFO L93 Difference]: Finished difference Result 421 states and 585 transitions. [2025-03-09 02:41:11,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 02:41:11,071 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-09 02:41:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:11,073 INFO L225 Difference]: With dead ends: 421 [2025-03-09 02:41:11,073 INFO L226 Difference]: Without dead ends: 420 [2025-03-09 02:41:11,074 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-09 02:41:11,074 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 532 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-09 02:41:11,074 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-09 02:41:11,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-09 02:41:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 380. [2025-03-09 02:41:11,107 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-09 02:41:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 579 transitions. [2025-03-09 02:41:11,110 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 579 transitions. Word has length 48 [2025-03-09 02:41:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:11,110 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 579 transitions. [2025-03-09 02:41:11,110 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-09 02:41:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 579 transitions. [2025-03-09 02:41:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:41:11,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:11,111 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-09 02:41:11,117 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-09 02:41:11,315 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-09 02:41:11,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:11,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:11,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2146241297, now seen corresponding path program 1 times [2025-03-09 02:41:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:11,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411300258] [2025-03-09 02:41:11,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:11,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:41:11,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:41:11,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:11,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:11,444 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-09 02:41:11,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:11,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411300258] [2025-03-09 02:41:11,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411300258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329774940] [2025-03-09 02:41:11,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:11,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:11,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:11,447 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-09 02:41:11,448 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-09 02:41:11,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:41:11,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:41:11,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:11,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:11,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:41:11,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:11,543 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-09 02:41:11,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:11,850 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-09 02:41:11,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329774940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:11,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:11,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 23 [2025-03-09 02:41:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068855039] [2025-03-09 02:41:11,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:11,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 02:41:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:11,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 02:41:11,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:41:11,852 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-09 02:41:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:12,157 INFO L93 Difference]: Finished difference Result 697 states and 1209 transitions. [2025-03-09 02:41:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 02:41:12,157 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-09 02:41:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:12,161 INFO L225 Difference]: With dead ends: 697 [2025-03-09 02:41:12,162 INFO L226 Difference]: Without dead ends: 550 [2025-03-09 02:41:12,163 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-09 02:41:12,164 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:12,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 238 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-09 02:41:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 505. [2025-03-09 02:41:12,218 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-09 02:41:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 902 transitions. [2025-03-09 02:41:12,223 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 902 transitions. Word has length 48 [2025-03-09 02:41:12,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:12,223 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 902 transitions. [2025-03-09 02:41:12,223 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-09 02:41:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 902 transitions. [2025-03-09 02:41:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 02:41:12,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:12,225 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-09 02:41:12,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:12,426 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-09 02:41:12,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:12,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash 180942808, now seen corresponding path program 3 times [2025-03-09 02:41:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814463908] [2025-03-09 02:41:12,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:12,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 11 equivalence classes. [2025-03-09 02:41:12,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 78 statements. [2025-03-09 02:41:12,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 02:41:12,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:12,518 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-09 02:41:12,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:12,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814463908] [2025-03-09 02:41:12,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814463908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:12,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242831932] [2025-03-09 02:41:12,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:12,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:12,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:12,520 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-09 02:41:12,522 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-09 02:41:12,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 11 equivalence classes. [2025-03-09 02:41:12,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 78 statements. [2025-03-09 02:41:12,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 02:41:12,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:12,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:41:12,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:12,588 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-09 02:41:12,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:12,724 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-09 02:41:12,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242831932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:12,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:12,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 13 [2025-03-09 02:41:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300564813] [2025-03-09 02:41:12,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:12,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:41:12,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:12,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:41:12,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:41:12,726 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-09 02:41:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:12,863 INFO L93 Difference]: Finished difference Result 562 states and 959 transitions. [2025-03-09 02:41:12,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:41:12,863 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-09 02:41:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:12,867 INFO L225 Difference]: With dead ends: 562 [2025-03-09 02:41:12,867 INFO L226 Difference]: Without dead ends: 505 [2025-03-09 02:41:12,867 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-09 02:41:12,868 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-09 02:41:12,868 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-09 02:41:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-09 02:41:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-03-09 02:41:12,921 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-09 02:41:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 867 transitions. [2025-03-09 02:41:12,926 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 867 transitions. Word has length 78 [2025-03-09 02:41:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:12,926 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 867 transitions. [2025-03-09 02:41:12,926 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-09 02:41:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 867 transitions. [2025-03-09 02:41:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 02:41:12,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:12,928 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-09 02:41:12,934 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-09 02:41:13,129 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-09 02:41:13,129 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting applyHanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:13,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:13,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1046017450, now seen corresponding path program 3 times [2025-03-09 02:41:13,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:13,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397188233] [2025-03-09 02:41:13,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:13,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:13,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 11 equivalence classes. [2025-03-09 02:41:13,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:41:13,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:41:13,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:13,721 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-09 02:41:13,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:13,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397188233] [2025-03-09 02:41:13,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397188233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:13,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724730472] [2025-03-09 02:41:13,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:13,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:13,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:13,724 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-09 02:41:13,725 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-09 02:41:13,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 11 equivalence classes. [2025-03-09 02:41:13,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:41:13,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:41:13,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:13,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-09 02:41:13,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:13,922 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-09 02:41:13,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:14,394 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-09 02:41:14,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724730472] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:14,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:14,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 49 [2025-03-09 02:41:14,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402788194] [2025-03-09 02:41:14,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:14,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-09 02:41:14,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:14,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-09 02:41:14,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=1805, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 02:41:14,397 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-09 02:41:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:15,773 INFO L93 Difference]: Finished difference Result 4964 states and 7734 transitions. [2025-03-09 02:41:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-09 02:41:15,773 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-09 02:41:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:15,795 INFO L225 Difference]: With dead ends: 4964 [2025-03-09 02:41:15,796 INFO L226 Difference]: Without dead ends: 4963 [2025-03-09 02:41:15,798 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-09 02:41:15,799 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 837 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:15,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1815 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:41:15,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4963 states. [2025-03-09 02:41:15,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4963 to 805. [2025-03-09 02:41:15,953 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-09 02:41:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 2799 transitions. [2025-03-09 02:41:15,967 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 2799 transitions. Word has length 78 [2025-03-09 02:41:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:15,968 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 2799 transitions. [2025-03-09 02:41:15,968 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-09 02:41:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 2799 transitions. [2025-03-09 02:41:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-09 02:41:15,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:15,975 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-09 02:41:15,981 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-09 02:41:16,175 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-09 02:41:16,176 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:16,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:16,176 INFO L85 PathProgramCache]: Analyzing trace with hash -307024428, now seen corresponding path program 4 times [2025-03-09 02:41:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603699159] [2025-03-09 02:41:16,177 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:41:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:16,184 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 126 statements into 2 equivalence classes. [2025-03-09 02:41:16,198 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 126 statements. [2025-03-09 02:41:16,198 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 02:41:16,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:16,308 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-09 02:41:16,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:16,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603699159] [2025-03-09 02:41:16,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603699159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:16,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525269543] [2025-03-09 02:41:16,309 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:41:16,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:16,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:16,312 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-09 02:41:16,313 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-09 02:41:16,344 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 126 statements into 2 equivalence classes. [2025-03-09 02:41:16,368 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 126 statements. [2025-03-09 02:41:16,368 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 02:41:16,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:16,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:41:16,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:16,425 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-09 02:41:16,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:16,827 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-09 02:41:16,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525269543] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:16,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:16,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2025-03-09 02:41:16,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279122403] [2025-03-09 02:41:16,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:16,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 02:41:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:16,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 02:41:16,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:41:16,829 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-09 02:41:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:17,048 INFO L93 Difference]: Finished difference Result 1929 states and 6732 transitions. [2025-03-09 02:41:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:41:17,048 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-09 02:41:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:17,055 INFO L225 Difference]: With dead ends: 1929 [2025-03-09 02:41:17,055 INFO L226 Difference]: Without dead ends: 1141 [2025-03-09 02:41:17,069 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-09 02:41:17,070 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-09 02:41:17,070 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-09 02:41:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-09 02:41:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1009. [2025-03-09 02:41:17,142 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-09 02:41:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1479 transitions. [2025-03-09 02:41:17,147 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1479 transitions. Word has length 126 [2025-03-09 02:41:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:17,147 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1479 transitions. [2025-03-09 02:41:17,147 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-09 02:41:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1479 transitions. [2025-03-09 02:41:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 02:41:17,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:17,149 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-09 02:41:17,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:17,353 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-09 02:41:17,353 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:17,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1221291608, now seen corresponding path program 5 times [2025-03-09 02:41:17,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:17,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557813120] [2025-03-09 02:41:17,354 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:41:17,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:17,359 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 11 equivalence classes. [2025-03-09 02:41:17,372 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 02:41:17,372 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 02:41:17,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:17,647 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-09 02:41:17,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557813120] [2025-03-09 02:41:17,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557813120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890909731] [2025-03-09 02:41:17,647 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:41:17,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:17,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:17,649 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-09 02:41:17,651 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-09 02:41:17,678 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 11 equivalence classes. [2025-03-09 02:41:17,705 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 02:41:17,705 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 02:41:17,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:17,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 02:41:17,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:17,879 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-09 02:41:17,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:18,620 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-09 02:41:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890909731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:18,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:18,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28, 30] total 58 [2025-03-09 02:41:18,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356105690] [2025-03-09 02:41:18,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:18,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-09 02:41:18,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:18,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-09 02:41:18,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=2778, Unknown=0, NotChecked=0, Total=3422 [2025-03-09 02:41:18,623 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-09 02:41:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:18,835 INFO L93 Difference]: Finished difference Result 1013 states and 1479 transitions. [2025-03-09 02:41:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:41:18,836 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-09 02:41:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:18,841 INFO L225 Difference]: With dead ends: 1013 [2025-03-09 02:41:18,841 INFO L226 Difference]: Without dead ends: 937 [2025-03-09 02:41:18,842 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-09 02:41:18,843 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-09 02:41:18,843 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-09 02:41:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-03-09 02:41:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 933. [2025-03-09 02:41:18,912 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-09 02:41:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1388 transitions. [2025-03-09 02:41:18,919 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1388 transitions. Word has length 110 [2025-03-09 02:41:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:18,921 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1388 transitions. [2025-03-09 02:41:18,921 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-09 02:41:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1388 transitions. [2025-03-09 02:41:18,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-09 02:41:18,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:18,923 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-09 02:41:18,930 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-09 02:41:19,128 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-09 02:41:19,128 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:19,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash 322465647, now seen corresponding path program 2 times [2025-03-09 02:41:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:19,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197812814] [2025-03-09 02:41:19,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:19,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-09 02:41:19,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 02:41:19,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:19,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:19,205 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-09 02:41:19,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:19,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197812814] [2025-03-09 02:41:19,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197812814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:19,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291939898] [2025-03-09 02:41:19,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:19,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:19,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:19,207 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-09 02:41:19,209 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-09 02:41:19,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-09 02:41:19,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 02:41:19,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:19,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:19,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:41:19,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:19,303 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-09 02:41:19,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:19,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291939898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:19,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:19,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 02:41:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447657288] [2025-03-09 02:41:19,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:19,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:41:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:19,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:41:19,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:41:19,304 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-09 02:41:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:19,354 INFO L93 Difference]: Finished difference Result 933 states and 1388 transitions. [2025-03-09 02:41:19,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:41:19,355 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-09 02:41:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:19,359 INFO L225 Difference]: With dead ends: 933 [2025-03-09 02:41:19,359 INFO L226 Difference]: Without dead ends: 931 [2025-03-09 02:41:19,359 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-09 02:41:19,360 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-09 02:41:19,360 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-09 02:41:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-09 02:41:19,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2025-03-09 02:41:19,413 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-09 02:41:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1366 transitions. [2025-03-09 02:41:19,416 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1366 transitions. Word has length 144 [2025-03-09 02:41:19,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:19,416 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1366 transitions. [2025-03-09 02:41:19,416 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-09 02:41:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1366 transitions. [2025-03-09 02:41:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-09 02:41:19,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:19,418 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-09 02:41:19,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 02:41:19,618 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-09 02:41:19,618 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:19,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1406500460, now seen corresponding path program 1 times [2025-03-09 02:41:19,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:19,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822033530] [2025-03-09 02:41:19,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:19,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:19,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-09 02:41:19,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-09 02:41:19,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:19,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:19,689 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-09 02:41:19,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:19,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822033530] [2025-03-09 02:41:19,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822033530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:19,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512466132] [2025-03-09 02:41:19,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:19,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:19,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:19,692 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-09 02:41:19,694 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-09 02:41:19,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-09 02:41:19,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-09 02:41:19,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:19,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:19,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:41:19,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:19,788 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-09 02:41:19,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:19,976 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-09 02:41:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512466132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:19,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:19,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 02:41:19,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473750853] [2025-03-09 02:41:19,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:19,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:41:19,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:19,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:41:19,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:41:19,977 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-09 02:41:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:20,088 INFO L93 Difference]: Finished difference Result 1135 states and 1625 transitions. [2025-03-09 02:41:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:41:20,089 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-09 02:41:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:20,093 INFO L225 Difference]: With dead ends: 1135 [2025-03-09 02:41:20,093 INFO L226 Difference]: Without dead ends: 1070 [2025-03-09 02:41:20,094 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-09 02:41:20,094 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-09 02:41:20,094 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-09 02:41:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-03-09 02:41:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2025-03-09 02:41:20,153 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-09 02:41:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1495 transitions. [2025-03-09 02:41:20,156 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1495 transitions. Word has length 145 [2025-03-09 02:41:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:20,156 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1495 transitions. [2025-03-09 02:41:20,157 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-09 02:41:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1495 transitions. [2025-03-09 02:41:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-09 02:41:20,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:20,160 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-09 02:41:20,166 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-09 02:41:20,360 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-09 02:41:20,361 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:20,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1172917837, now seen corresponding path program 2 times [2025-03-09 02:41:20,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:20,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662586325] [2025-03-09 02:41:20,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:20,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes. [2025-03-09 02:41:20,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 181 of 181 statements. [2025-03-09 02:41:20,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:20,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:20,504 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-09 02:41:20,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662586325] [2025-03-09 02:41:20,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662586325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763048401] [2025-03-09 02:41:20,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:20,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:20,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:20,506 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-09 02:41:20,508 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-09 02:41:20,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes. [2025-03-09 02:41:20,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 181 of 181 statements. [2025-03-09 02:41:20,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:20,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:20,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 02:41:20,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:20,806 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-09 02:41:20,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:21,790 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-09 02:41:21,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763048401] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:21,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:21,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 23] total 39 [2025-03-09 02:41:21,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625816835] [2025-03-09 02:41:21,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:21,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-09 02:41:21,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:21,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-09 02:41:21,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2025-03-09 02:41:21,792 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-09 02:41:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:22,608 INFO L93 Difference]: Finished difference Result 1927 states and 2789 transitions. [2025-03-09 02:41:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-09 02:41:22,608 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-09 02:41:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:22,615 INFO L225 Difference]: With dead ends: 1927 [2025-03-09 02:41:22,615 INFO L226 Difference]: Without dead ends: 1244 [2025-03-09 02:41:22,617 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-09 02:41:22,618 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 271 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:22,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 315 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:41:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2025-03-09 02:41:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1180. [2025-03-09 02:41:22,680 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-09 02:41:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1726 transitions. [2025-03-09 02:41:22,684 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1726 transitions. Word has length 181 [2025-03-09 02:41:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:22,684 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1726 transitions. [2025-03-09 02:41:22,684 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-09 02:41:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1726 transitions. [2025-03-09 02:41:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-09 02:41:22,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:22,688 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2025-03-09 02:41:22,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:22,892 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-09 02:41:22,892 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting applyHanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:22,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash -548148630, now seen corresponding path program 4 times [2025-03-09 02:41:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875000657] [2025-03-09 02:41:22,893 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:41:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:22,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 162 statements into 2 equivalence classes. [2025-03-09 02:41:22,931 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 162 of 162 statements. [2025-03-09 02:41:22,931 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:41:22,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:24,171 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-09 02:41:24,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875000657] [2025-03-09 02:41:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875000657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045488822] [2025-03-09 02:41:24,171 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:41:24,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:24,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:24,173 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-09 02:41:24,173 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-09 02:41:24,218 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 162 statements into 2 equivalence classes. [2025-03-09 02:41:24,269 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 162 of 162 statements. [2025-03-09 02:41:24,270 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:41:24,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:24,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-09 02:41:24,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:24,441 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-09 02:41:24,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:25,663 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-09 02:41:25,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045488822] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:25,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:25,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 95 [2025-03-09 02:41:25,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113994304] [2025-03-09 02:41:25,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:25,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-09 02:41:25,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:25,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-09 02:41:25,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2025-03-09 02:41:25,668 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-09 02:41:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:29,204 INFO L93 Difference]: Finished difference Result 5269 states and 8698 transitions. [2025-03-09 02:41:29,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-03-09 02:41:29,205 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-09 02:41:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:29,230 INFO L225 Difference]: With dead ends: 5269 [2025-03-09 02:41:29,230 INFO L226 Difference]: Without dead ends: 5268 [2025-03-09 02:41:29,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4408 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=5642, Invalid=14380, Unknown=0, NotChecked=0, Total=20022 [2025-03-09 02:41:29,237 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1359 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:29,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 1510 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 02:41:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-03-09 02:41:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 2212. [2025-03-09 02:41:29,427 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-09 02:41:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 5434 transitions. [2025-03-09 02:41:29,445 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 5434 transitions. Word has length 162 [2025-03-09 02:41:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:29,446 INFO L471 AbstractCegarLoop]: Abstraction has 2212 states and 5434 transitions. [2025-03-09 02:41:29,446 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-09 02:41:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 5434 transitions. [2025-03-09 02:41:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-09 02:41:29,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:29,466 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1] [2025-03-09 02:41:29,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 02:41:29,667 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-09 02:41:29,667 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting applyHanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [applyHanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, applyHanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:29,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1593166870, now seen corresponding path program 5 times [2025-03-09 02:41:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:29,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819369261] [2025-03-09 02:41:29,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:41:29,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:29,677 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 330 statements into 47 equivalence classes. [2025-03-09 02:41:29,879 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 330 of 330 statements. [2025-03-09 02:41:29,879 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 02:41:29,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:34,563 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-09 02:41:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819369261] [2025-03-09 02:41:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819369261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117877861] [2025-03-09 02:41:34,563 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:41:34,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:34,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:34,565 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-09 02:41:34,567 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-09 02:41:34,629 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 330 statements into 47 equivalence classes. [2025-03-09 02:41:34,837 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 330 of 330 statements. [2025-03-09 02:41:34,837 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 02:41:34,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:34,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 189 conjuncts are in the unsatisfiable core [2025-03-09 02:41:34,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:35,136 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-09 02:41:35,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:39,889 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-09 02:41:39,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117877861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:39,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:39,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 95, 95] total 190 [2025-03-09 02:41:39,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631449357] [2025-03-09 02:41:39,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:39,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 191 states [2025-03-09 02:41:39,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:39,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2025-03-09 02:41:39,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9215, Invalid=27075, Unknown=0, NotChecked=0, Total=36290 [2025-03-09 02:41:39,899 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) [2025-03-09 02:42:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:39,759 INFO L93 Difference]: Finished difference Result 16501 states and 34006 transitions. [2025-03-09 02:42:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-03-09 02:42:39,760 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 330 [2025-03-09 02:42:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:39,860 INFO L225 Difference]: With dead ends: 16501 [2025-03-09 02:42:39,861 INFO L226 Difference]: Without dead ends: 16500 [2025-03-09 02:42:39,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17300 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=22705, Invalid=58235, Unknown=0, NotChecked=0, Total=80940 [2025-03-09 02:42:39,878 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 3121 mSDsluCounter, 4240 mSDsCounter, 0 mSdLazyCounter, 3434 mSolverCounterSat, 829 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3121 SdHoareTripleChecker+Valid, 4466 SdHoareTripleChecker+Invalid, 4263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 829 IncrementalHoareTripleChecker+Valid, 3434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:39,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3121 Valid, 4466 Invalid, 4263 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [829 Valid, 3434 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-09 02:42:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16500 states.