./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/rev-2-n-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/rev-2-n-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 bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:51:17,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:51:17,742 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:17,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:51:17,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:51:17,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:51:17,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:51:17,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:51:17,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:51:17,762 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:51:17,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:51:17,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:51:17,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:51:17,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:51:17,762 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:51:17,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:51:17,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:51:17,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:51:17,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:51:17,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:51:17,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:51:17,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:51:17,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:51:17,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:51:17,763 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:51:17,763 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:51:17,763 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:51:17,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:51:17,763 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:51:17,764 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:51:17,764 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:51:17,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:51:17,764 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:51:17,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:51:17,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:51:17,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:51:17,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:51:17,764 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:51:17,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:51:17,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:51:17,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:51:17,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:51:17,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:51:17,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:51:17,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:51:17,765 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 -> bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 [2025-02-08 08:51:17,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:51:17,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:51:17,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:51:17,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:51:17,957 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:51:17,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2025-02-08 08:51:19,206 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b12c00288/4775d3d2ee1249afa4189719e8b840d1/FLAG90849e8b4 [2025-02-08 08:51:19,593 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:51:19,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2025-02-08 08:51:19,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b12c00288/4775d3d2ee1249afa4189719e8b840d1/FLAG90849e8b4 [2025-02-08 08:51:19,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b12c00288/4775d3d2ee1249afa4189719e8b840d1 [2025-02-08 08:51:19,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:51:19,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:51:19,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:51:19,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:51:19,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:51:19,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:51:19" (1/1) ... [2025-02-08 08:51:19,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d8ec99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:19, skipping insertion in model container [2025-02-08 08:51:19,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:51:19" (1/1) ... [2025-02-08 08:51:19,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:51:19,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:51:19,979 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:51:19,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:51:20,006 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:51:20,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:20 WrapperNode [2025-02-08 08:51:20,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:51:20,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:51:20,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:51:20,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:51:20,013 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:20" (1/1) ... [2025-02-08 08:51:20,018 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:20" (1/1) ... [2025-02-08 08:51:20,034 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2025-02-08 08:51:20,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:51:20,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:51:20,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:51:20,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:51:20,040 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:20" (1/1) ... [2025-02-08 08:51:20,040 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:20" (1/1) ... [2025-02-08 08:51:20,041 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:20" (1/1) ... [2025-02-08 08:51:20,049 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-02-08 08:51:20,049 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:20" (1/1) ... [2025-02-08 08:51:20,049 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:20" (1/1) ... [2025-02-08 08:51:20,052 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:20" (1/1) ... [2025-02-08 08:51:20,052 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:20" (1/1) ... [2025-02-08 08:51:20,053 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:20" (1/1) ... [2025-02-08 08:51:20,054 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:20" (1/1) ... [2025-02-08 08:51:20,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:51:20,057 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:51:20,057 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:51:20,057 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:51:20,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:20" (1/1) ... [2025-02-08 08:51:20,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:51:20,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:20,084 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:20,088 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:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:51:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:51:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:51:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:51:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:51:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:51:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:51:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:51:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:51:20,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:51:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:51:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:51:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:51:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:51:20,145 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:51:20,147 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:51:20,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60: assume 1 + main_~j~0#1 <= 2147483647;main_~j~0#1 := 1 + main_~j~0#1; [2025-02-08 08:51:20,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60: assume !(1 + main_~j~0#1 <= 2147483647); [2025-02-08 08:51:20,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-1: assume 1 + main_~j~0#1 >= -2147483648; [2025-02-08 08:51:20,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-1: assume !(1 + main_~j~0#1 >= -2147483648); [2025-02-08 08:51:20,299 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~mem6#1;havoc main_#t~mem7#1; [2025-02-08 08:51:20,299 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;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset; [2025-02-08 08:51:20,313 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-02-08 08:51:20,313 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:51:20,324 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:51:20,324 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:51:20,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:20 BoogieIcfgContainer [2025-02-08 08:51:20,325 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:51:20,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:51:20,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:51:20,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:51:20,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:51:19" (1/3) ... [2025-02-08 08:51:20,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc8260f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:51:20, skipping insertion in model container [2025-02-08 08:51:20,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:20" (2/3) ... [2025-02-08 08:51:20,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc8260f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:51:20, skipping insertion in model container [2025-02-08 08:51:20,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:20" (3/3) ... [2025-02-08 08:51:20,331 INFO L128 eAbstractionObserver]: Analyzing ICFG rev-2-n-u.c [2025-02-08 08:51:20,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:51:20,342 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rev-2-n-u.c that has 1 procedures, 64 locations, 1 initial locations, 6 loop locations, and 28 error locations. [2025-02-08 08:51:20,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:51:20,397 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;@e2ed10b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:51:20,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-08 08:51:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 63 states have internal predecessors, (69), 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:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 08:51:20,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:20,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 08:51:20,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:20,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:20,409 INFO L85 PathProgramCache]: Analyzing trace with hash 3231263, now seen corresponding path program 1 times [2025-02-08 08:51:20,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:20,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535320708] [2025-02-08 08:51:20,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:20,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:20,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:51:20,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:51:20,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:20,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:20,546 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:20,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:20,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535320708] [2025-02-08 08:51:20,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535320708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:20,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:20,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124484243] [2025-02-08 08:51:20,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:20,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:20,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:20,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:20,566 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 63 states have internal predecessors, (69), 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:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:20,640 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2025-02-08 08:51:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:20,642 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:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:20,647 INFO L225 Difference]: With dead ends: 87 [2025-02-08 08:51:20,648 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 08:51:20,650 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:20,652 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:20,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 08:51:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2025-02-08 08:51:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.851063829787234) internal successors, (87), 72 states have internal predecessors, (87), 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:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2025-02-08 08:51:20,678 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 4 [2025-02-08 08:51:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:20,679 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2025-02-08 08:51:20,679 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:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2025-02-08 08:51:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 08:51:20,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:20,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 08:51:20,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:51:20,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:20,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash 3231290, now seen corresponding path program 1 times [2025-02-08 08:51:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535074180] [2025-02-08 08:51:20,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:20,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:20,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:51:20,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:51:20,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:20,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:20,741 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:20,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:20,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535074180] [2025-02-08 08:51:20,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535074180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:20,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:20,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:51:20,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142776200] [2025-02-08 08:51:20,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:20,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:20,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:20,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:20,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:20,743 INFO L87 Difference]: Start difference. First operand 73 states and 87 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:20,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:20,809 INFO L93 Difference]: Finished difference Result 143 states and 169 transitions. [2025-02-08 08:51:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:20,810 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:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:20,810 INFO L225 Difference]: With dead ends: 143 [2025-02-08 08:51:20,810 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 08:51:20,811 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:20,811 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 64 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:20,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 52 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 08:51:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-02-08 08:51:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 66 states have internal predecessors, (76), 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:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2025-02-08 08:51:20,816 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 4 [2025-02-08 08:51:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:20,817 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2025-02-08 08:51:20,817 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:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2025-02-08 08:51:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 08:51:20,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:20,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:51:20,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:51:20,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:20,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash 99831560, now seen corresponding path program 1 times [2025-02-08 08:51:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:20,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314736274] [2025-02-08 08:51:20,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:20,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:51:20,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:51:20,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:20,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:20,867 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:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314736274] [2025-02-08 08:51:20,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314736274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:20,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:20,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:20,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599819180] [2025-02-08 08:51:20,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:20,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:20,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:20,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:20,869 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:20,926 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2025-02-08 08:51:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:20,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-02-08 08:51:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:20,927 INFO L225 Difference]: With dead ends: 131 [2025-02-08 08:51:20,927 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 08:51:20,927 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:20,928 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:20,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 08:51:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2025-02-08 08:51:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.673913043478261) internal successors, (77), 67 states have internal predecessors, (77), 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:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-02-08 08:51:20,937 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 5 [2025-02-08 08:51:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:20,937 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-02-08 08:51:20,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-02-08 08:51:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:51:20,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:20,938 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 08:51:20,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:51:20,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:20,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1773313381, now seen corresponding path program 1 times [2025-02-08 08:51:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200162377] [2025-02-08 08:51:20,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:20,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:51:20,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:51:20,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:20,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:21,056 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:21,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:21,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200162377] [2025-02-08 08:51:21,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200162377] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:21,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830411857] [2025-02-08 08:51:21,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:21,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:21,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:21,063 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:21,064 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:21,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:51:21,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:51:21,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:21,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:21,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:21,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:21,133 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:21,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:51:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830411857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:21,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:51:21,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 08:51:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367161997] [2025-02-08 08:51:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:21,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:21,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:21,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:51:21,135 INFO L87 Difference]: Start difference. First operand 68 states and 77 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:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:21,203 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2025-02-08 08:51:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:21,204 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:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:21,204 INFO L225 Difference]: With dead ends: 72 [2025-02-08 08:51:21,204 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 08:51:21,204 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:21,205 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 41 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:21,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 65 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 08:51:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-02-08 08:51:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 65 states have internal predecessors, (75), 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:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-02-08 08:51:21,210 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 7 [2025-02-08 08:51:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:21,210 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-02-08 08:51:21,210 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:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-02-08 08:51:21,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:51:21,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:21,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:21,218 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:21,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:21,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:21,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1773313408, now seen corresponding path program 1 times [2025-02-08 08:51:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:21,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710043047] [2025-02-08 08:51:21,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:21,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:51:21,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:51:21,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:21,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:21,451 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:21,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:21,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710043047] [2025-02-08 08:51:21,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710043047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:21,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:21,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:51:21,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741658872] [2025-02-08 08:51:21,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:21,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:21,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:21,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:21,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:21,453 INFO L87 Difference]: Start difference. First operand 66 states and 75 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:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:21,504 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2025-02-08 08:51:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:21,504 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:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:21,506 INFO L225 Difference]: With dead ends: 109 [2025-02-08 08:51:21,506 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 08:51:21,506 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:21,506 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:21,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 08:51:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2025-02-08 08:51:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.6075949367088607) internal successors, (127), 98 states have internal predecessors, (127), 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:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2025-02-08 08:51:21,513 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 7 [2025-02-08 08:51:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:21,513 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2025-02-08 08:51:21,513 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:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2025-02-08 08:51:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:51:21,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:21,514 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-08 08:51:21,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:51:21,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:21,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash -861859999, now seen corresponding path program 1 times [2025-02-08 08:51:21,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:21,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527621528] [2025-02-08 08:51:21,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:21,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:51:21,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:51:21,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:21,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:21,556 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:21,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:21,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527621528] [2025-02-08 08:51:21,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527621528] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:21,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126283577] [2025-02-08 08:51:21,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:21,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:21,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:21,559 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:21,562 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:21,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:51:21,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:51:21,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:21,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:21,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:21,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:21,610 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:21,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:21,627 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:21,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126283577] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:21,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:21,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 08:51:21,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476052710] [2025-02-08 08:51:21,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:21,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:51:21,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:21,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:51:21,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:51:21,629 INFO L87 Difference]: Start difference. First operand 99 states and 127 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:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:21,709 INFO L93 Difference]: Finished difference Result 201 states and 283 transitions. [2025-02-08 08:51:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:51:21,710 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:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:21,711 INFO L225 Difference]: With dead ends: 201 [2025-02-08 08:51:21,711 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 08:51:21,711 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:21,712 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 134 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:21,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 86 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 08:51:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 183. [2025-02-08 08:51:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 163 states have (on average 1.6625766871165644) internal successors, (271), 182 states have internal predecessors, (271), 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:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 271 transitions. [2025-02-08 08:51:21,722 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 271 transitions. Word has length 8 [2025-02-08 08:51:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:21,722 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 271 transitions. [2025-02-08 08:51:21,722 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:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 271 transitions. [2025-02-08 08:51:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 08:51:21,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:21,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:21,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:51:21,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:21,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:21,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1698533953, now seen corresponding path program 1 times [2025-02-08 08:51:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993153296] [2025-02-08 08:51:21,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:21,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:51:21,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:51:21,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:21,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:51:21,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:21,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993153296] [2025-02-08 08:51:21,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993153296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:21,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:21,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:21,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435260044] [2025-02-08 08:51:21,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:21,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:21,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:21,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:21,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:21,953 INFO L87 Difference]: Start difference. First operand 183 states and 271 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:21,991 INFO L93 Difference]: Finished difference Result 183 states and 271 transitions. [2025-02-08 08:51:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:21,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-02-08 08:51:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:21,992 INFO L225 Difference]: With dead ends: 183 [2025-02-08 08:51:21,992 INFO L226 Difference]: Without dead ends: 179 [2025-02-08 08:51:21,992 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:21,993 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:21,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 26 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-08 08:51:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-02-08 08:51:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 178 states have internal predecessors, (249), 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:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 249 transitions. [2025-02-08 08:51:22,003 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 249 transitions. Word has length 12 [2025-02-08 08:51:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:22,003 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 249 transitions. [2025-02-08 08:51:22,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 249 transitions. [2025-02-08 08:51:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 08:51:22,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:22,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:22,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:51:22,004 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:22,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1114944965, now seen corresponding path program 1 times [2025-02-08 08:51:22,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:22,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416272947] [2025-02-08 08:51:22,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:22,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:51:22,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:51:22,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:22,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:51:22,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:22,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416272947] [2025-02-08 08:51:22,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416272947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:22,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:22,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:22,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697875699] [2025-02-08 08:51:22,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:22,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:22,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:22,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:22,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:22,047 INFO L87 Difference]: Start difference. First operand 179 states and 249 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:22,117 INFO L93 Difference]: Finished difference Result 187 states and 249 transitions. [2025-02-08 08:51:22,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:22,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2025-02-08 08:51:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:22,118 INFO L225 Difference]: With dead ends: 187 [2025-02-08 08:51:22,118 INFO L226 Difference]: Without dead ends: 183 [2025-02-08 08:51:22,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:22,119 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 60 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:22,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 42 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-08 08:51:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2025-02-08 08:51:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 163 states have (on average 1.4539877300613497) internal successors, (237), 176 states have internal predecessors, (237), 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:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 237 transitions. [2025-02-08 08:51:22,128 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 237 transitions. Word has length 13 [2025-02-08 08:51:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:22,128 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 237 transitions. [2025-02-08 08:51:22,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 237 transitions. [2025-02-08 08:51:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 08:51:22,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:22,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 08:51:22,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:51:22,129 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:22,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash 120908407, now seen corresponding path program 1 times [2025-02-08 08:51:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:22,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587353421] [2025-02-08 08:51:22,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:22,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:22,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:51:22,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:51:22,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:22,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:51:22,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:22,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587353421] [2025-02-08 08:51:22,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587353421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:22,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:22,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100293619] [2025-02-08 08:51:22,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:22,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:22,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:22,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:22,168 INFO L87 Difference]: Start difference. First operand 177 states and 237 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:22,218 INFO L93 Difference]: Finished difference Result 183 states and 237 transitions. [2025-02-08 08:51:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:22,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-02-08 08:51:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:22,219 INFO L225 Difference]: With dead ends: 183 [2025-02-08 08:51:22,219 INFO L226 Difference]: Without dead ends: 181 [2025-02-08 08:51:22,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:22,219 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 52 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:22,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 59 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-08 08:51:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2025-02-08 08:51:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 163 states have (on average 1.4417177914110428) internal successors, (235), 174 states have internal predecessors, (235), 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:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 235 transitions. [2025-02-08 08:51:22,228 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 235 transitions. Word has length 14 [2025-02-08 08:51:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:22,228 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 235 transitions. [2025-02-08 08:51:22,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 235 transitions. [2025-02-08 08:51:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 08:51:22,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:22,229 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-02-08 08:51:22,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:51:22,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:22,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash -546806645, now seen corresponding path program 1 times [2025-02-08 08:51:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:22,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527455171] [2025-02-08 08:51:22,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:22,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:51:22,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:51:22,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:22,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:22,273 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:22,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:22,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527455171] [2025-02-08 08:51:22,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527455171] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:22,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250692960] [2025-02-08 08:51:22,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:22,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:22,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:22,275 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:22,280 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:22,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:51:22,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:51:22,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:22,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:22,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:51:22,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:22,372 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:22,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:22,411 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:22,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250692960] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:22,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:22,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 9 [2025-02-08 08:51:22,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116301188] [2025-02-08 08:51:22,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:22,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:51:22,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:22,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:51:22,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:51:22,416 INFO L87 Difference]: Start difference. First operand 175 states and 235 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:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:22,749 INFO L93 Difference]: Finished difference Result 421 states and 566 transitions. [2025-02-08 08:51:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 08:51:22,750 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:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:22,751 INFO L225 Difference]: With dead ends: 421 [2025-02-08 08:51:22,751 INFO L226 Difference]: Without dead ends: 263 [2025-02-08 08:51:22,752 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:22,753 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 659 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:22,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 5 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:51:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-08 08:51:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2025-02-08 08:51:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 239 states have (on average 1.292887029288703) internal successors, (309), 248 states have internal predecessors, (309), 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:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 309 transitions. [2025-02-08 08:51:22,764 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 309 transitions. Word has length 15 [2025-02-08 08:51:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:22,764 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 309 transitions. [2025-02-08 08:51:22,765 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:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 309 transitions. [2025-02-08 08:51:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 08:51:22,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:22,765 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1] [2025-02-08 08:51:22,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:22,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:22,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:22,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1752879463, now seen corresponding path program 2 times [2025-02-08 08:51:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:22,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513009230] [2025-02-08 08:51:22,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:22,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:22,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 08:51:22,981 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:22,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:22,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:22,998 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:22,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:22,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513009230] [2025-02-08 08:51:22,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513009230] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:22,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327326819] [2025-02-08 08:51:22,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:22,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:22,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:23,005 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:23,009 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:23,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 08:51:23,079 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:23,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:23,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:23,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:23,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:23,115 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:23,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:23,164 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:23,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327326819] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:23,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:23,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 08:51:23,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385357283] [2025-02-08 08:51:23,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:23,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:51:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:23,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:51:23,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:51:23,165 INFO L87 Difference]: Start difference. First operand 249 states and 309 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:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:23,221 INFO L93 Difference]: Finished difference Result 249 states and 309 transitions. [2025-02-08 08:51:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:51:23,221 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:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:23,222 INFO L225 Difference]: With dead ends: 249 [2025-02-08 08:51:23,222 INFO L226 Difference]: Without dead ends: 247 [2025-02-08 08:51:23,223 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:23,223 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 54 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:23,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 40 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-08 08:51:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 211. [2025-02-08 08:51:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 203 states have (on average 1.2660098522167487) internal successors, (257), 210 states have internal predecessors, (257), 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:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 257 transitions. [2025-02-08 08:51:23,232 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 257 transitions. Word has length 17 [2025-02-08 08:51:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:23,232 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 257 transitions. [2025-02-08 08:51:23,232 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:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 257 transitions. [2025-02-08 08:51:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 08:51:23,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:23,233 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:23,242 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:23,438 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,SelfDestructingSolverStorable10 [2025-02-08 08:51:23,438 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:23,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash 534386545, now seen corresponding path program 1 times [2025-02-08 08:51:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:23,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875049969] [2025-02-08 08:51:23,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:23,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:51:23,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:51:23,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:23,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 08:51:23,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875049969] [2025-02-08 08:51:23,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875049969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:23,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:23,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132247513] [2025-02-08 08:51:23,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:23,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:23,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:23,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:23,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:23,515 INFO L87 Difference]: Start difference. First operand 211 states and 257 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:23,558 INFO L93 Difference]: Finished difference Result 215 states and 257 transitions. [2025-02-08 08:51:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:23,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 26 [2025-02-08 08:51:23,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:23,560 INFO L225 Difference]: With dead ends: 215 [2025-02-08 08:51:23,560 INFO L226 Difference]: Without dead ends: 201 [2025-02-08 08:51:23,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:23,561 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 51 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:23,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 36 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-08 08:51:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2025-02-08 08:51:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 193 states have (on average 1.2279792746113989) internal successors, (237), 198 states have internal predecessors, (237), 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:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2025-02-08 08:51:23,571 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 26 [2025-02-08 08:51:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:23,573 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2025-02-08 08:51:23,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2025-02-08 08:51:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 08:51:23,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:23,574 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:23,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:51:23,575 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:23,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1078453109, now seen corresponding path program 1 times [2025-02-08 08:51:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:23,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393861495] [2025-02-08 08:51:23,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:23,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:23,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:51:23,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:51:23,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:23,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:51:23,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:23,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393861495] [2025-02-08 08:51:23,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393861495] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:23,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222440972] [2025-02-08 08:51:23,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:23,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:23,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:23,773 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:23,780 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:23,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:51:23,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:51:23,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:23,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:23,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:51:23,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:51:23,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:51:23,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222440972] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:23,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:23,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-08 08:51:23,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920054870] [2025-02-08 08:51:23,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:23,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 08:51:23,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:23,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 08:51:23,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-02-08 08:51:23,985 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 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:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:24,181 INFO L93 Difference]: Finished difference Result 653 states and 806 transitions. [2025-02-08 08:51:24,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:51:24,181 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 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) Word has length 37 [2025-02-08 08:51:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:24,182 INFO L225 Difference]: With dead ends: 653 [2025-02-08 08:51:24,182 INFO L226 Difference]: Without dead ends: 469 [2025-02-08 08:51:24,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-02-08 08:51:24,183 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 416 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:24,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 116 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-08 08:51:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 451. [2025-02-08 08:51:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 445 states have (on average 1.2337078651685394) internal successors, (549), 450 states have internal predecessors, (549), 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:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 549 transitions. [2025-02-08 08:51:24,198 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 549 transitions. Word has length 37 [2025-02-08 08:51:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:24,198 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 549 transitions. [2025-02-08 08:51:24,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 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:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 549 transitions. [2025-02-08 08:51:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 08:51:24,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:24,199 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:24,205 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:24,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 08:51:24,400 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:24,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:24,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1088967221, now seen corresponding path program 2 times [2025-02-08 08:51:24,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:24,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663267746] [2025-02-08 08:51:24,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:24,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:24,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-02-08 08:51:24,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 08:51:24,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:51:24,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-08 08:51:24,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:24,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663267746] [2025-02-08 08:51:24,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663267746] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:24,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663984785] [2025-02-08 08:51:24,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:24,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:24,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:24,498 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:24,502 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:24,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-02-08 08:51:24,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 08:51:24,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:51:24,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:24,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 08:51:24,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:51:24,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:51:25,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663984785] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:25,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:25,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 13, 13] total 27 [2025-02-08 08:51:25,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206555009] [2025-02-08 08:51:25,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:25,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 08:51:25,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:25,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 08:51:25,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=448, Unknown=0, NotChecked=0, Total=756 [2025-02-08 08:51:25,066 INFO L87 Difference]: Start difference. First operand 451 states and 549 transitions. Second operand has 28 states, 28 states have (on average 3.25) internal successors, (91), 27 states have internal predecessors, (91), 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:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:26,587 INFO L93 Difference]: Finished difference Result 1415 states and 1760 transitions. [2025-02-08 08:51:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-02-08 08:51:26,587 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 27 states have internal predecessors, (91), 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 55 [2025-02-08 08:51:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:26,590 INFO L225 Difference]: With dead ends: 1415 [2025-02-08 08:51:26,590 INFO L226 Difference]: Without dead ends: 997 [2025-02-08 08:51:26,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2148 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2509, Invalid=4631, Unknown=0, NotChecked=0, Total=7140 [2025-02-08 08:51:26,595 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 995 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:26,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 164 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 08:51:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-02-08 08:51:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 955. [2025-02-08 08:51:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 949 states have (on average 1.2349841938883035) internal successors, (1172), 954 states have internal predecessors, (1172), 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:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1172 transitions. [2025-02-08 08:51:26,630 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1172 transitions. Word has length 55 [2025-02-08 08:51:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:26,630 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1172 transitions. [2025-02-08 08:51:26,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 27 states have internal predecessors, (91), 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:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1172 transitions. [2025-02-08 08:51:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-08 08:51:26,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:26,637 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:26,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:26,837 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,SelfDestructingSolverStorable13 [2025-02-08 08:51:26,838 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:26,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash -181453304, now seen corresponding path program 3 times [2025-02-08 08:51:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:26,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875061484] [2025-02-08 08:51:26,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:51:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:26,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 161 statements into 46 equivalence classes. [2025-02-08 08:51:26,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 161 statements. [2025-02-08 08:51:26,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:51:26,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2939 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2932 trivial. 0 not checked. [2025-02-08 08:51:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875061484] [2025-02-08 08:51:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875061484] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652617339] [2025-02-08 08:51:26,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:51:26,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:26,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:26,923 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:26,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:51:26,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 161 statements into 46 equivalence classes. [2025-02-08 08:51:26,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 161 statements. [2025-02-08 08:51:26,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:51:26,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:27,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:51:27,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2939 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2932 trivial. 0 not checked. [2025-02-08 08:51:27,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:51:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652617339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:27,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:51:27,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-08 08:51:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026076516] [2025-02-08 08:51:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:27,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:51:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:27,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:51:27,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:51:27,204 INFO L87 Difference]: Start difference. First operand 955 states and 1172 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:27,261 INFO L93 Difference]: Finished difference Result 957 states and 1172 transitions. [2025-02-08 08:51:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:51:27,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 161 [2025-02-08 08:51:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:27,265 INFO L225 Difference]: With dead ends: 957 [2025-02-08 08:51:27,265 INFO L226 Difference]: Without dead ends: 955 [2025-02-08 08:51:27,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:51:27,265 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:27,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 42 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-02-08 08:51:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2025-02-08 08:51:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 949 states have (on average 1.1022128556375133) internal successors, (1046), 952 states have internal predecessors, (1046), 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:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1046 transitions. [2025-02-08 08:51:27,290 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1046 transitions. Word has length 161 [2025-02-08 08:51:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:27,291 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1046 transitions. [2025-02-08 08:51:27,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1046 transitions. [2025-02-08 08:51:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-02-08 08:51:27,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:27,292 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 3, 3, 3, 2, 1, 1] [2025-02-08 08:51:27,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:27,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:27,498 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:27,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1890096350, now seen corresponding path program 2 times [2025-02-08 08:51:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:27,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648692670] [2025-02-08 08:51:27,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:27,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 211 statements into 2 equivalence classes. [2025-02-08 08:51:27,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 211 statements. [2025-02-08 08:51:27,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:27,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6645 backedges. 0 proven. 2998 refuted. 0 times theorem prover too weak. 3647 trivial. 0 not checked. [2025-02-08 08:51:27,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:27,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648692670] [2025-02-08 08:51:27,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648692670] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:27,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630488009] [2025-02-08 08:51:27,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:27,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:27,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:27,580 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:27,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:51:27,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 211 statements into 2 equivalence classes. [2025-02-08 08:51:27,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 211 statements. [2025-02-08 08:51:27,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:27,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:27,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:27,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6645 backedges. 0 proven. 2998 refuted. 0 times theorem prover too weak. 3647 trivial. 0 not checked. [2025-02-08 08:51:27,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6645 backedges. 0 proven. 2998 refuted. 0 times theorem prover too weak. 3647 trivial. 0 not checked. [2025-02-08 08:51:28,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630488009] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:28,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:28,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 08:51:28,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228200233] [2025-02-08 08:51:28,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:28,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:51:28,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:28,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:51:28,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:51:28,174 INFO L87 Difference]: Start difference. First operand 953 states and 1046 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:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:28,259 INFO L93 Difference]: Finished difference Result 953 states and 1046 transitions. [2025-02-08 08:51:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:28,259 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 211 [2025-02-08 08:51:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:28,262 INFO L225 Difference]: With dead ends: 953 [2025-02-08 08:51:28,262 INFO L226 Difference]: Without dead ends: 951 [2025-02-08 08:51:28,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 418 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:28,264 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:28,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 11 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-02-08 08:51:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 634. [2025-02-08 08:51:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 632 states have (on average 1.0775316455696202) internal successors, (681), 633 states have internal predecessors, (681), 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:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 681 transitions. [2025-02-08 08:51:28,282 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 681 transitions. Word has length 211 [2025-02-08 08:51:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:28,283 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 681 transitions. [2025-02-08 08:51:28,283 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:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 681 transitions. [2025-02-08 08:51:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-02-08 08:51:28,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:28,310 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:28,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 08:51:28,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 08:51:28,511 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:28,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash -917760171, now seen corresponding path program 1 times [2025-02-08 08:51:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930178871] [2025-02-08 08:51:28,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:28,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:28,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-08 08:51:28,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-08 08:51:28,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:28,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5563 backedges. 1499 proven. 715 refuted. 0 times theorem prover too weak. 3349 trivial. 0 not checked. [2025-02-08 08:51:29,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930178871] [2025-02-08 08:51:29,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930178871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172233310] [2025-02-08 08:51:29,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:29,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:29,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:29,948 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:29,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:51:30,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-08 08:51:30,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-08 08:51:30,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:30,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:30,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 08:51:30,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5563 backedges. 1499 proven. 715 refuted. 0 times theorem prover too weak. 3349 trivial. 0 not checked. [2025-02-08 08:51:30,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5563 backedges. 1499 proven. 715 refuted. 0 times theorem prover too weak. 3349 trivial. 0 not checked. [2025-02-08 08:51:31,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172233310] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:31,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:31,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2025-02-08 08:51:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660405714] [2025-02-08 08:51:31,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:31,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-02-08 08:51:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:31,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-02-08 08:51:31,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-02-08 08:51:31,414 INFO L87 Difference]: Start difference. First operand 634 states and 681 transitions. Second operand has 73 states, 73 states have (on average 3.1506849315068495) internal successors, (230), 72 states have internal predecessors, (230), 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:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:33,133 INFO L93 Difference]: Finished difference Result 1961 states and 2108 transitions. [2025-02-08 08:51:33,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-08 08:51:33,133 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 3.1506849315068495) internal successors, (230), 72 states have internal predecessors, (230), 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 392 [2025-02-08 08:51:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:33,137 INFO L225 Difference]: With dead ends: 1961 [2025-02-08 08:51:33,138 INFO L226 Difference]: Without dead ends: 1396 [2025-02-08 08:51:33,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-02-08 08:51:33,140 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 2858 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2858 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:33,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2858 Valid, 373 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:51:33,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-02-08 08:51:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1306. [2025-02-08 08:51:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1304 states have (on average 1.0743865030674846) internal successors, (1401), 1305 states have internal predecessors, (1401), 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:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1401 transitions. [2025-02-08 08:51:33,201 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1401 transitions. Word has length 392 [2025-02-08 08:51:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:33,202 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1401 transitions. [2025-02-08 08:51:33,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.1506849315068495) internal successors, (230), 72 states have internal predecessors, (230), 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:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1401 transitions. [2025-02-08 08:51:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2025-02-08 08:51:33,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:33,211 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 47, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:33,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:33,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:33,412 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 08:51:33,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1956486229, now seen corresponding path program 2 times [2025-02-08 08:51:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:33,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614298033] [2025-02-08 08:51:33,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:33,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 800 statements into 2 equivalence classes. [2025-02-08 08:51:33,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 800 of 800 statements. [2025-02-08 08:51:33,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:51:33,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 24319 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 24179 trivial. 0 not checked. [2025-02-08 08:51:34,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:34,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614298033] [2025-02-08 08:51:34,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614298033] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838700010] [2025-02-08 08:51:34,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:34,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:34,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:34,204 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:34,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 08:51:34,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 800 statements into 2 equivalence classes. [2025-02-08 08:51:34,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 800 of 800 statements. [2025-02-08 08:51:34,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:51:34,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:34,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 1882 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 08:51:34,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 24319 backedges. 6443 proven. 3151 refuted. 0 times theorem prover too weak. 14725 trivial. 0 not checked. [2025-02-08 08:51:35,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 24319 backedges. 6443 proven. 3151 refuted. 0 times theorem prover too weak. 14725 trivial. 0 not checked. [2025-02-08 08:51:37,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838700010] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:37,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:37,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 49, 49] total 100 [2025-02-08 08:51:37,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843105998] [2025-02-08 08:51:37,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:37,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-02-08 08:51:37,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:37,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-02-08 08:51:37,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4666, Invalid=5434, Unknown=0, NotChecked=0, Total=10100 [2025-02-08 08:51:37,863 INFO L87 Difference]: Start difference. First operand 1306 states and 1401 transitions. Second operand has 101 states, 101 states have (on average 3.3069306930693068) internal successors, (334), 100 states have internal predecessors, (334), 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:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:54,361 INFO L93 Difference]: Finished difference Result 3815 states and 4294 transitions. [2025-02-08 08:51:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-02-08 08:51:54,361 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.3069306930693068) internal successors, (334), 100 states have internal predecessors, (334), 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 800 [2025-02-08 08:51:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:54,362 INFO L225 Difference]: With dead ends: 3815 [2025-02-08 08:51:54,362 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:51:54,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1791 GetRequests, 1502 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22375 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=23666, Invalid=60724, Unknown=0, NotChecked=0, Total=84390 [2025-02-08 08:51:54,375 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 12285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2769 mSolverCounterSat, 1048 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12285 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1048 IncrementalHoareTripleChecker+Valid, 2769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:54,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12285 Valid, 1 Invalid, 3817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1048 Valid, 2769 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-08 08:51:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:51:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:51:54,378 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:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:51:54,379 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 800 [2025-02-08 08:51:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:54,380 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:51:54,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.3069306930693068) internal successors, (334), 100 states have internal predecessors, (334), 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:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:51:54,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:51:54,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2025-02-08 08:51:54,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2025-02-08 08:51:54,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2025-02-08 08:51:54,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2025-02-08 08:51:54,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2025-02-08 08:51:54,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:54,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 08:51:54,588 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:54,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:52:05,017 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:52:05,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:52:05 BoogieIcfgContainer [2025-02-08 08:52:05,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:52:05,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:52:05,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:52:05,035 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:52:05,036 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:20" (3/4) ... [2025-02-08 08:52:05,037 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:52:05,050 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 08:52:05,050 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:52:05,051 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:52:05,051 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:52:05,121 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:52:05,122 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:52:05,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:52:05,123 INFO L158 Benchmark]: Toolchain (without parser) took 45299.01ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 106.7MB in the beginning and 607.7MB in the end (delta: -501.0MB). Peak memory consumption was 840.0MB. Max. memory is 16.1GB. [2025-02-08 08:52:05,123 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:52:05,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.19ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 96.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:52:05,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.05ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:52:05,124 INFO L158 Benchmark]: Boogie Preprocessor took 22.30ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:52:05,124 INFO L158 Benchmark]: IcfgBuilder took 267.70ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 76.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:52:05,125 INFO L158 Benchmark]: TraceAbstraction took 44708.58ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 76.2MB in the beginning and 615.8MB in the end (delta: -539.6MB). Peak memory consumption was 898.4MB. Max. memory is 16.1GB. [2025-02-08 08:52:05,127 INFO L158 Benchmark]: Witness Printer took 86.65ms. Allocated memory is still 1.5GB. Free memory was 615.8MB in the beginning and 607.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:52:05,128 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.19ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 96.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.05ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.30ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 267.70ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 76.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 44708.58ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 76.2MB in the beginning and 615.8MB in the end (delta: -539.6MB). Peak memory consumption was 898.4MB. Max. memory is 16.1GB. * Witness Printer took 86.65ms. Allocated memory is still 1.5GB. Free memory was 615.8MB in the beginning and 607.7MB in the end (delta: 8.1MB). 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: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: 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: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: 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, 64 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 34.2s, OverallIterations: 18, TraceHistogramMax: 92, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17850 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17850 mSDsluCounter, 1302 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 865 mSDsCounter, 1485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4593 IncrementalHoareTripleChecker+Invalid, 6078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1485 mSolverCounterUnsat, 437 mSDtfsCounter, 4593 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3580 GetRequests, 3035 SyntacticMatches, 0 SemanticMatches, 545 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27994 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1306occurred in iteration=17, InterpolantAutomatonStates: 396, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 577 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 3491 NumberOfCodeBlocks, 2783 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 4990 ConstructedInterpolants, 0 QuantifiedInterpolants, 14120 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3625 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 36 InterpolantComputations, 10 PerfectInterpolantSequences, 98191/116182 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 28 specifications checked. All of them hold - InvariantResult [Line: 54]: Location Invariant Derived location invariant: (((m <= 1000) && (i == 0)) && (n == 1500)) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((((((((i == 0) && (m == 1000)) && (1 <= j)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (((long long) i + 1) <= m)) && (1 <= i)) && (1 <= j)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (((long long) i + 1) <= m)) && (1 <= i)) && (j == 0)) && (n == 1500))) || ((((i == 0) && (m == 1000)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 56]: Location Invariant Derived location invariant: (((((m <= 1000) && (i == 0)) && (1 <= m)) && (j == 0)) && (n == 1500)) - InvariantResult [Line: 25]: Location Invariant Derived location invariant: (((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (n == 1500)) || (((i == 0) && (m == 1000)) && (n == 1500))) - InvariantResult [Line: 38]: Location Invariant Derived location invariant: (((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (n == 1500)) || (((m <= 1000) && (i == 0)) && (n == 1500))) - InvariantResult [Line: 40]: Location Invariant Derived location invariant: ((((((((m <= 1000) && (i == 0)) && (1 <= m)) && (j == 0)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (1 <= m)) && (j <= 2147483646)) && (n == 1500))) || ((((((m <= 1000) && (((long long) i + 1) <= m)) && (1 <= i)) && (1 <= j)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (((long long) i + 1) <= m)) && (1 <= i)) && (j == 0)) && (n == 1500))) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:52:05,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE