./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/max-2-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/max-2-u.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d56d1653edfb1a7b1c72e82d390b1b74d1df9114797a2f1426eb2285f6c4408f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:51:09,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:51:09,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:51:09,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:51:09,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:51:09,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:51:09,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:51:09,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:51:09,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:51:09,222 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:51:09,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:51:09,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:51:09,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:51:09,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:51:09,223 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:51:09,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:51:09,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:51:09,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:51:09,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:51:09,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:51:09,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:51:09,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:51:09,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:51:09,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:51:09,224 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:51:09,224 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:51:09,224 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:51:09,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:51:09,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:51:09,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:51:09,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:51:09,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:51:09,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:51:09,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:51:09,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:51:09,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:51:09,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:51:09,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:51:09,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:51:09,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:51:09,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:51:09,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:51:09,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:51:09,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:51:09,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:51:09,225 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d56d1653edfb1a7b1c72e82d390b1b74d1df9114797a2f1426eb2285f6c4408f [2025-02-08 08:51:09,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:51:09,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:51:09,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:51:09,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:51:09,509 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:51:09,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/max-2-u.c [2025-02-08 08:51:10,765 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2419a6975/2a20aa3ceb274bb4bdb5d953aa57b5a9/FLAG3185ccfce [2025-02-08 08:51:11,057 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:51:11,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-2-u.c [2025-02-08 08:51:11,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2419a6975/2a20aa3ceb274bb4bdb5d953aa57b5a9/FLAG3185ccfce [2025-02-08 08:51:11,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2419a6975/2a20aa3ceb274bb4bdb5d953aa57b5a9 [2025-02-08 08:51:11,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:51:11,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:51:11,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:51:11,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:51:11,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:51:11,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64527e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11, skipping insertion in model container [2025-02-08 08:51:11,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:51:11,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:51:11,252 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:51:11,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:51:11,284 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:51:11,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11 WrapperNode [2025-02-08 08:51:11,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:51:11,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:51:11,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:51:11,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:51:11,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,315 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2025-02-08 08:51:11,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:51:11,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:51:11,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:51:11,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:51:11,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,346 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 08:51:11,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:51:11,365 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:51:11,365 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:51:11,365 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:51:11,366 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (1/1) ... [2025-02-08 08:51:11,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:51:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:11,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:51:11,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:51:11,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:51:11,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:51:11,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:51:11,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:51:11,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:51:11,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:51:11,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:51:11,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:51:11,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:51:11,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:51:11,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:51:11,492 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:51:11,493 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:51:11,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem8#1; [2025-02-08 08:51:11,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: assume 1 + main_~j~0#1 <= 2147483647;main_~j~0#1 := 1 + main_~j~0#1; [2025-02-08 08:51:11,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: assume !(1 + main_~j~0#1 <= 2147483647); [2025-02-08 08:51:11,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: assume 1 + main_~j~0#1 >= -2147483648; [2025-02-08 08:51:11,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: assume !(1 + main_~j~0#1 >= -2147483648); [2025-02-08 08:51:11,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-02-08 08:51:11,719 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-08 08:51:11,719 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:51:11,731 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:51:11,731 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:51:11,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:11 BoogieIcfgContainer [2025-02-08 08:51:11,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:51:11,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:51:11,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:51:11,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:51:11,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:51:11" (1/3) ... [2025-02-08 08:51:11,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e39677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:51:11, skipping insertion in model container [2025-02-08 08:51:11,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:11" (2/3) ... [2025-02-08 08:51:11,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e39677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:51:11, skipping insertion in model container [2025-02-08 08:51:11,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:11" (3/3) ... [2025-02-08 08:51:11,744 INFO L128 eAbstractionObserver]: Analyzing ICFG max-2-u.c [2025-02-08 08:51:11,758 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:51:11,759 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG max-2-u.c that has 1 procedures, 33 locations, 1 initial locations, 6 loop locations, and 12 error locations. [2025-02-08 08:51:11,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:51:11,810 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;@72751d4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:51:11,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 08:51:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:11,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 08:51:11,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:11,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 08:51:11,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:11,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2307743, now seen corresponding path program 1 times [2025-02-08 08:51:11,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:11,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75835584] [2025-02-08 08:51:11,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:11,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:11,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:51:11,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:51:11,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:11,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:11,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:11,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75835584] [2025-02-08 08:51:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75835584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:11,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:11,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:11,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018876967] [2025-02-08 08:51:11,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:11,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:11,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:12,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:12,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:12,011 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:12,077 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-02-08 08:51:12,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:12,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 08:51:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:12,085 INFO L225 Difference]: With dead ends: 45 [2025-02-08 08:51:12,085 INFO L226 Difference]: Without dead ends: 35 [2025-02-08 08:51:12,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:12,092 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:12,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 46 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-08 08:51:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-08 08:51:12,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.72) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-02-08 08:51:12,127 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 4 [2025-02-08 08:51:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:12,129 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-02-08 08:51:12,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-02-08 08:51:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 08:51:12,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:12,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 08:51:12,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:51:12,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:12,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2307770, now seen corresponding path program 1 times [2025-02-08 08:51:12,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:12,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432377668] [2025-02-08 08:51:12,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:12,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:51:12,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:51:12,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:12,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:12,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:12,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432377668] [2025-02-08 08:51:12,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432377668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:12,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:12,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:51:12,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572934578] [2025-02-08 08:51:12,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:12,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:12,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:12,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:12,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:12,205 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:12,282 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2025-02-08 08:51:12,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:12,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 08:51:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:12,283 INFO L225 Difference]: With dead ends: 65 [2025-02-08 08:51:12,283 INFO L226 Difference]: Without dead ends: 29 [2025-02-08 08:51:12,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:12,284 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:12,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 26 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-08 08:51:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-08 08:51:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-02-08 08:51:12,290 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 4 [2025-02-08 08:51:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:12,290 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-08 08:51:12,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-02-08 08:51:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:51:12,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:12,291 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 08:51:12,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:51:12,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:12,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:12,293 INFO L85 PathProgramCache]: Analyzing trace with hash 30503047, now seen corresponding path program 1 times [2025-02-08 08:51:12,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:12,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99537493] [2025-02-08 08:51:12,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:12,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:12,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:51:12,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:51:12,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:12,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99537493] [2025-02-08 08:51:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99537493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338815907] [2025-02-08 08:51:12,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:12,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:12,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:12,406 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:12,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:51:12,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:51:12,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:51:12,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:12,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:12,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:12,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:12,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:51:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338815907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:12,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:51:12,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 08:51:12,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238270804] [2025-02-08 08:51:12,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:12,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:12,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:12,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:12,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:51:12,516 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:12,569 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-02-08 08:51:12,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:12,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:51:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:12,570 INFO L225 Difference]: With dead ends: 29 [2025-02-08 08:51:12,570 INFO L226 Difference]: Without dead ends: 27 [2025-02-08 08:51:12,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-02-08 08:51:12,571 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:12,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 35 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-08 08:51:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-08 08:51:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-02-08 08:51:12,575 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 7 [2025-02-08 08:51:12,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:12,575 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-02-08 08:51:12,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,575 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-02-08 08:51:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:51:12,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:12,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:12,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:51:12,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:12,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:12,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:12,777 INFO L85 PathProgramCache]: Analyzing trace with hash 30503074, now seen corresponding path program 1 times [2025-02-08 08:51:12,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:12,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014353866] [2025-02-08 08:51:12,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:12,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:51:12,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:51:12,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:12,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:51:12,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014353866] [2025-02-08 08:51:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014353866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:12,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:12,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:51:12,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233413291] [2025-02-08 08:51:12,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:12,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:12,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:12,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:12,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:12,836 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:12,859 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-02-08 08:51:12,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:12,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:51:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:12,861 INFO L225 Difference]: With dead ends: 27 [2025-02-08 08:51:12,861 INFO L226 Difference]: Without dead ends: 25 [2025-02-08 08:51:12,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:12,862 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:12,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-08 08:51:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-08 08:51:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-02-08 08:51:12,869 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 7 [2025-02-08 08:51:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:12,869 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-02-08 08:51:12,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-02-08 08:51:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:51:12,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:12,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-08 08:51:12,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:51:12,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:12,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash 945594465, now seen corresponding path program 1 times [2025-02-08 08:51:12,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:12,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404403879] [2025-02-08 08:51:12,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:12,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:12,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:51:12,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:51:12,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:12,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:12,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:12,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404403879] [2025-02-08 08:51:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404403879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578003241] [2025-02-08 08:51:12,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:12,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:12,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:12,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:12,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:51:13,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:51:13,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:51:13,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:13,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:13,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:13,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:13,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:13,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578003241] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:13,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:13,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 08:51:13,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392541757] [2025-02-08 08:51:13,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:13,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:51:13,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:13,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:51:13,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:51:13,073 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:13,187 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2025-02-08 08:51:13,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:51:13,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 08:51:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:13,190 INFO L225 Difference]: With dead ends: 48 [2025-02-08 08:51:13,190 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 08:51:13,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:51:13,191 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:13,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 42 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 08:51:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 08:51:13,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 45 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2025-02-08 08:51:13,202 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 8 [2025-02-08 08:51:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:13,203 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2025-02-08 08:51:13,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2025-02-08 08:51:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:51:13,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:13,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:13,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:13,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:13,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:13,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:13,405 INFO L85 PathProgramCache]: Analyzing trace with hash 945595298, now seen corresponding path program 1 times [2025-02-08 08:51:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:13,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944283077] [2025-02-08 08:51:13,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:13,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:13,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:51:13,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:51:13,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:13,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:51:13,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944283077] [2025-02-08 08:51:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944283077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:13,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:13,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:51:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113290676] [2025-02-08 08:51:13,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:13,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:13,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:13,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:13,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:13,437 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:13,480 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2025-02-08 08:51:13,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:13,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 08:51:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:13,482 INFO L225 Difference]: With dead ends: 91 [2025-02-08 08:51:13,483 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 08:51:13,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:13,484 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:13,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 21 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 08:51:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-02-08 08:51:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2025-02-08 08:51:13,504 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 8 [2025-02-08 08:51:13,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:13,504 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2025-02-08 08:51:13,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2025-02-08 08:51:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 08:51:13,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:13,505 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-02-08 08:51:13,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:51:13,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:13,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:13,507 INFO L85 PathProgramCache]: Analyzing trace with hash -36272467, now seen corresponding path program 1 times [2025-02-08 08:51:13,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:13,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092655483] [2025-02-08 08:51:13,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:13,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:13,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:51:13,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:51:13,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:13,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:51:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092655483] [2025-02-08 08:51:13,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092655483] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355057092] [2025-02-08 08:51:13,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:13,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:13,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:13,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:13,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:51:13,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:51:13,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:51:13,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:13,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:13,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:51:13,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:51:13,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:51:13,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355057092] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:13,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:13,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 9 [2025-02-08 08:51:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502346496] [2025-02-08 08:51:13,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:13,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:51:13,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:13,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:51:13,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:51:13,724 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:14,037 INFO L93 Difference]: Finished difference Result 202 states and 270 transitions. [2025-02-08 08:51:14,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 08:51:14,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 08:51:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:14,039 INFO L225 Difference]: With dead ends: 202 [2025-02-08 08:51:14,039 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 08:51:14,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=293, Unknown=0, NotChecked=0, Total=462 [2025-02-08 08:51:14,040 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 350 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:14,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 13 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:51:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 08:51:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2025-02-08 08:51:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 127 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2025-02-08 08:51:14,055 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 15 [2025-02-08 08:51:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:14,055 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2025-02-08 08:51:14,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2025-02-08 08:51:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 08:51:14,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:14,056 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1] [2025-02-08 08:51:14,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:51:14,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:14,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:14,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1545015479, now seen corresponding path program 2 times [2025-02-08 08:51:14,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:14,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87015252] [2025-02-08 08:51:14,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:14,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:14,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 08:51:14,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-02-08 08:51:14,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:14,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:51:14,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:14,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87015252] [2025-02-08 08:51:14,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87015252] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:14,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870860540] [2025-02-08 08:51:14,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:14,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:14,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:14,311 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:14,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:51:14,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 08:51:14,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-02-08 08:51:14,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:14,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:14,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:51:14,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:51:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870860540] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:14,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:14,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 08:51:14,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970547784] [2025-02-08 08:51:14,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:14,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:51:14,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:14,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:51:14,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:51:14,433 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:14,472 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2025-02-08 08:51:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:51:14,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 08:51:14,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:14,473 INFO L225 Difference]: With dead ends: 128 [2025-02-08 08:51:14,473 INFO L226 Difference]: Without dead ends: 126 [2025-02-08 08:51:14,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:51:14,474 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:14,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 18 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-08 08:51:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 111. [2025-02-08 08:51:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 110 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2025-02-08 08:51:14,494 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 17 [2025-02-08 08:51:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:14,495 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2025-02-08 08:51:14,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2025-02-08 08:51:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 08:51:14,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:14,496 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 2, 1, 1] [2025-02-08 08:51:14,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:51:14,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 08:51:14,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:14,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:14,702 INFO L85 PathProgramCache]: Analyzing trace with hash 875596036, now seen corresponding path program 2 times [2025-02-08 08:51:14,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:14,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052546312] [2025-02-08 08:51:14,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:14,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-08 08:51:14,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 49 statements. [2025-02-08 08:51:14,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:14,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-08 08:51:14,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:14,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052546312] [2025-02-08 08:51:14,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052546312] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:14,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904834566] [2025-02-08 08:51:14,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:14,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:14,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:14,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:14,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:51:14,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-08 08:51:14,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 49 statements. [2025-02-08 08:51:14,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:14,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:14,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-08 08:51:14,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-08 08:51:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904834566] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:15,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 08:51:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937116154] [2025-02-08 08:51:15,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:15,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:51:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:15,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:51:15,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:51:15,014 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:15,068 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2025-02-08 08:51:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:51:15,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-02-08 08:51:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:15,070 INFO L225 Difference]: With dead ends: 111 [2025-02-08 08:51:15,070 INFO L226 Difference]: Without dead ends: 110 [2025-02-08 08:51:15,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:51:15,071 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:15,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 27 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-08 08:51:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2025-02-08 08:51:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2025-02-08 08:51:15,081 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 49 [2025-02-08 08:51:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:15,081 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2025-02-08 08:51:15,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2025-02-08 08:51:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 08:51:15,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:15,083 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 3, 3, 3, 2, 1, 1, 1] [2025-02-08 08:51:15,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:51:15,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:15,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:15,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash 293573501, now seen corresponding path program 1 times [2025-02-08 08:51:15,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:15,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67044017] [2025-02-08 08:51:15,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:15,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:15,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 08:51:15,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 08:51:15,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:15,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-08 08:51:15,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:15,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67044017] [2025-02-08 08:51:15,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67044017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:15,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:15,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:15,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444565542] [2025-02-08 08:51:15,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:15,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:15,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:15,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:15,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:15,357 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:15,382 INFO L93 Difference]: Finished difference Result 155 states and 189 transitions. [2025-02-08 08:51:15,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:15,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-08 08:51:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:15,383 INFO L225 Difference]: With dead ends: 155 [2025-02-08 08:51:15,383 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 08:51:15,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:15,385 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:15,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:15,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 08:51:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2025-02-08 08:51:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 78 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2025-02-08 08:51:15,397 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 62 [2025-02-08 08:51:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:15,402 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2025-02-08 08:51:15,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2025-02-08 08:51:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 08:51:15,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:15,406 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:15,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:51:15,407 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:15,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash -822314400, now seen corresponding path program 1 times [2025-02-08 08:51:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:15,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059951225] [2025-02-08 08:51:15,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:15,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 08:51:15,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 08:51:15,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:15,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 08:51:15,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:15,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059951225] [2025-02-08 08:51:15,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059951225] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:15,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478536856] [2025-02-08 08:51:15,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:15,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:15,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:15,539 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:15,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:51:15,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 08:51:15,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 08:51:15,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:15,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:15,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:51:15,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-08 08:51:15,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-08 08:51:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478536856] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:15,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 7, 7] total 15 [2025-02-08 08:51:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537068360] [2025-02-08 08:51:15,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:15,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:51:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:15,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:51:15,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:51:15,852 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:16,284 INFO L93 Difference]: Finished difference Result 278 states and 362 transitions. [2025-02-08 08:51:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 08:51:16,285 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-08 08:51:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:16,285 INFO L225 Difference]: With dead ends: 278 [2025-02-08 08:51:16,286 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:51:16,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=492, Invalid=914, Unknown=0, NotChecked=0, Total=1406 [2025-02-08 08:51:16,287 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 298 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:16,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 15 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:51:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:51:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:51:16,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2025-02-08 08:51:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:16,289 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:51:16,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:51:16,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:51:16,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-02-08 08:51:16,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-02-08 08:51:16,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-02-08 08:51:16,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-02-08 08:51:16,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-02-08 08:51:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-02-08 08:51:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-02-08 08:51:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-02-08 08:51:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-02-08 08:51:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-02-08 08:51:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-02-08 08:51:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-02-08 08:51:16,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:51:16,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 08:51:16,497 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:16,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:51:17,374 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:51:17,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:51:17 BoogieIcfgContainer [2025-02-08 08:51:17,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:51:17,390 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:51:17,390 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:51:17,391 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:51:17,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:11" (3/4) ... [2025-02-08 08:51:17,393 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:51:17,402 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 08:51:17,403 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:51:17,403 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:51:17,403 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:51:17,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:51:17,477 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:51:17,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:51:17,478 INFO L158 Benchmark]: Toolchain (without parser) took 6387.34ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 115.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2025-02-08 08:51:17,478 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:51:17,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.62ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 111.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:51:17,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.44ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:51:17,479 INFO L158 Benchmark]: Boogie Preprocessor took 46.84ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:51:17,479 INFO L158 Benchmark]: IcfgBuilder took 367.42ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 95.1MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:51:17,480 INFO L158 Benchmark]: TraceAbstraction took 5654.86ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 122.1MB in the end (delta: -27.3MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2025-02-08 08:51:17,480 INFO L158 Benchmark]: Witness Printer took 86.45ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 115.6MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:51:17,481 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.62ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 111.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.44ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.84ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 367.42ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 95.1MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5654.86ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 122.1MB in the end (delta: -27.3MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. * Witness Printer took 86.45ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 115.6MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 806 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 806 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 450 IncrementalHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 133 mSDtfsCounter, 450 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 68 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 433 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 1416 SizeOfPredicates, 4 NumberOfNonLiveVariables, 546 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 1599/2193 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 54]: Location Invariant Derived location invariant: (1500 <= n) - InvariantResult [Line: 56]: Location Invariant Derived location invariant: ((1500 <= n) && (j == 0)) - InvariantResult [Line: 38]: Location Invariant Derived location invariant: ((0 <= i) && (n == 1500)) - InvariantResult [Line: 26]: Location Invariant Derived location invariant: (((((((m <= 1000) && (1 <= j)) && (i <= 999)) && (0 <= i)) && (j <= 2147483646)) && (n == 1500)) || (((((m <= 1000) && (i <= 999)) && (0 <= i)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 24]: Location Invariant Derived location invariant: ((((m <= 1000) && (i <= 2147483646)) && (0 <= i)) && (n == 1500)) - InvariantResult [Line: 40]: Location Invariant Derived location invariant: (((((0 <= i) && (i <= 1499)) && (j == 0)) && (n == 1500)) || (((((1 <= j) && (0 <= i)) && (i <= 1499)) && (j <= 2147483646)) && (n == 1500))) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:51:17,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE