./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/yes-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/yes-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash bacdcb0022ed9da204b2f4dd75716ae7304df31b79785d3f644890abf5aef4c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:31:28,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:31:29,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:31:29,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:31:29,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:31:29,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:31:29,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:31:29,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:31:29,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:31:29,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:31:29,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:31:29,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:31:29,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:31:29,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:31:29,041 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:31:29,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:31:29,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:31:29,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:31:29,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:31:29,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:31:29,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:31:29,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:31:29,042 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:31:29,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:31:29,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:31:29,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:31:29,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:31:29,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:31:29,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:31:29,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:31:29,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:31:29,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:31:29,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:31:29,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:31:29,043 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:31:29,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:31:29,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:31:29,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:31:29,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:31:29,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:31:29,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:31:29,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:31:29,044 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bacdcb0022ed9da204b2f4dd75716ae7304df31b79785d3f644890abf5aef4c3 [2025-02-08 13:31:29,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:31:29,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:31:29,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:31:29,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:31:29,274 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:31:29,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/yes-1.i [2025-02-08 13:31:30,463 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/952c5256e/82103f9058f744b5a224effb95ac021c/FLAG4ca51998e [2025-02-08 13:31:30,842 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:31:30,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/yes-1.i [2025-02-08 13:31:30,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/952c5256e/82103f9058f744b5a224effb95ac021c/FLAG4ca51998e [2025-02-08 13:31:31,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/952c5256e/82103f9058f744b5a224effb95ac021c [2025-02-08 13:31:31,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:31:31,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:31:31,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:31:31,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:31:31,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:31:31,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a4544d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31, skipping insertion in model container [2025-02-08 13:31:31,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:31:31,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:31:31,621 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:31:31,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:31:31,798 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:31:31,803 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:31:31,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31 WrapperNode [2025-02-08 13:31:31,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:31:31,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:31:31,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:31:31,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:31:31,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,857 INFO L138 Inliner]: procedures = 596, calls = 482, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 784 [2025-02-08 13:31:31,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:31:31,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:31:31,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:31:31,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:31:31,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,879 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:31:31,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:31:31,918 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:31:31,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:31:31,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:31:31,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (1/1) ... [2025-02-08 13:31:31,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:31:31,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:31,950 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 13:31:31,953 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 13:31:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:31:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:31:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:31:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:31:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:31:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:31:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:31:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:31:31,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:31:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:31:31,968 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:31:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:31:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:31:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:31:31,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:31:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:31:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:31:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:31:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:31:32,208 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:31:32,210 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:31:32,675 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2332: bb_verror_msg_#t~ret100#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet106#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= bb_verror_msg_#t~ret100#1 && bb_verror_msg_#t~ret100#1 <= 2147483647;havoc bb_verror_msg_#t~ret100#1;call bb_verror_msg_#t~mem101#1.base, bb_verror_msg_#t~mem101#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, bb_verror_msg_#t~mem101#1.base, bb_verror_msg_#t~mem101#1.offset, bb_verror_msg_~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret107#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 13:31:32,675 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2349: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret108#1, safe_write_#t~mem109#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~0#1; [2025-02-08 13:31:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2349: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:31:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2333: bb_verror_msg_#t~ret102#1 := full_write_#res#1;havoc full_write_#t~ret107#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= bb_verror_msg_#t~ret102#1 && bb_verror_msg_#t~ret102#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem101#1.base, bb_verror_msg_#t~mem101#1.offset;havoc bb_verror_msg_#t~ret102#1; [2025-02-08 13:31:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:31:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:31:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:31:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:31:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 13:31:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 13:31:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet148#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet148#1;assume -9223372036854775808 <= write_#t~nondet148#1 && write_#t~nondet148#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet148#1;havoc write_#t~nondet148#1; [2025-02-08 13:31:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367: assume !true; [2025-02-08 13:31:32,677 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2351: full_write_#t~ret107#1 := safe_write_#res#1;havoc safe_write_#t~ret108#1, safe_write_#t~mem109#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret107#1 && full_write_#t~ret107#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret107#1;havoc full_write_#t~ret107#1; [2025-02-08 13:31:32,677 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:31:32,677 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2352: assume full_write_~cc~0#1 < 0; [2025-02-08 13:31:32,677 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2352: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:31:32,677 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2369: safe_write_#t~ret108#1 := write_#res#1;havoc write_#t~nondet148#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret108#1 && safe_write_#t~ret108#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret108#1;havoc safe_write_#t~ret108#1; [2025-02-08 13:31:32,677 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2477-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:31:32,677 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2477: write_#res#1 := write_~ret~1#1; [2025-02-08 13:31:32,677 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2370: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem109#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem109#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:31:32,677 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2370: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 13:31:32,677 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2354: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:31:32,678 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2354: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:31:32,723 INFO L? ?]: Removed 177 outVars from TransFormulas that were not future-live. [2025-02-08 13:31:32,723 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:31:32,740 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:31:32,741 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:31:32,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:31:32 BoogieIcfgContainer [2025-02-08 13:31:32,741 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:31:32,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:31:32,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:31:32,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:31:32,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:31:31" (1/3) ... [2025-02-08 13:31:32,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebfb6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:31:32, skipping insertion in model container [2025-02-08 13:31:32,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:31" (2/3) ... [2025-02-08 13:31:32,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebfb6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:31:32, skipping insertion in model container [2025-02-08 13:31:32,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:31:32" (3/3) ... [2025-02-08 13:31:32,749 INFO L128 eAbstractionObserver]: Analyzing ICFG yes-1.i [2025-02-08 13:31:32,758 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:31:32,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG yes-1.i that has 3 procedures, 140 locations, 1 initial locations, 14 loop locations, and 41 error locations. [2025-02-08 13:31:32,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:31:32,801 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;@46eb10e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:31:32,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-02-08 13:31:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 91 states have (on average 1.7692307692307692) internal successors, (161), 133 states have internal predecessors, (161), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:31:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:31:32,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:32,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:31:32,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:32,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash 232330, now seen corresponding path program 1 times [2025-02-08 13:31:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:32,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862862716] [2025-02-08 13:31:32,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:32,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:32,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:31:33,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:31:33,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:33,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:33,317 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 13:31:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862862716] [2025-02-08 13:31:33,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862862716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:33,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:33,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:31:33,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761465647] [2025-02-08 13:31:33,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:33,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:33,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:33,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:33,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:33,333 INFO L87 Difference]: Start difference. First operand has 140 states, 91 states have (on average 1.7692307692307692) internal successors, (161), 133 states have internal predecessors, (161), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 13:31:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:33,359 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2025-02-08 13:31:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:33,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-02-08 13:31:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:33,363 INFO L225 Difference]: With dead ends: 175 [2025-02-08 13:31:33,363 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 13:31:33,365 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 13:31:33,366 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:33,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 13:31:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-08 13:31:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-02-08 13:31:33,388 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 3 [2025-02-08 13:31:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:33,389 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-02-08 13:31:33,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 13:31:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-02-08 13:31:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:31:33,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:33,389 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:31:33,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:31:33,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:33,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:33,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1668423619, now seen corresponding path program 1 times [2025-02-08 13:31:33,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:33,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799033067] [2025-02-08 13:31:33,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:33,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:33,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:31:33,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:31:33,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:33,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:33,643 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 13:31:33,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:33,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799033067] [2025-02-08 13:31:33,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799033067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:33,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61856047] [2025-02-08 13:31:33,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:33,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:33,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:33,651 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 13:31:33,652 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 13:31:33,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:31:33,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:31:33,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:33,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:33,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:33,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:33,931 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 13:31:33,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:33,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61856047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:33,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:33,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:31:33,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269493476] [2025-02-08 13:31:33,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:33,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:31:33,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:33,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:31:33,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:33,934 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 13:31:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:33,966 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-02-08 13:31:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:31:33,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-08 13:31:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:33,967 INFO L225 Difference]: With dead ends: 39 [2025-02-08 13:31:33,967 INFO L226 Difference]: Without dead ends: 38 [2025-02-08 13:31:33,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 13:31:33,967 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:33,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-08 13:31:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-08 13:31:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.5) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-02-08 13:31:33,971 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 6 [2025-02-08 13:31:33,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:33,971 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-02-08 13:31:33,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 13:31:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-02-08 13:31:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:31:33,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:33,971 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:31:33,979 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 13:31:34,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:34,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:34,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:34,173 INFO L85 PathProgramCache]: Analyzing trace with hash -181524468, now seen corresponding path program 1 times [2025-02-08 13:31:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419827501] [2025-02-08 13:31:34,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:34,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:31:34,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:31:34,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:34,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:31:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419827501] [2025-02-08 13:31:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419827501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:34,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:34,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789563605] [2025-02-08 13:31:34,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:34,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:34,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:34,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:34,313 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 13:31:34,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:34,334 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2025-02-08 13:31:34,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:34,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 13:31:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:34,335 INFO L225 Difference]: With dead ends: 38 [2025-02-08 13:31:34,335 INFO L226 Difference]: Without dead ends: 37 [2025-02-08 13:31:34,335 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 13:31:34,335 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:34,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-08 13:31:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-02-08 13:31:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.5) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-02-08 13:31:34,346 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 7 [2025-02-08 13:31:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:34,346 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-02-08 13:31:34,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 13:31:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-02-08 13:31:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:31:34,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:34,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:34,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:31:34,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:34,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash -505162489, now seen corresponding path program 1 times [2025-02-08 13:31:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:34,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269098725] [2025-02-08 13:31:34,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:34,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:34,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:31:34,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:31:34,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:34,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:31:34,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:34,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269098725] [2025-02-08 13:31:34,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269098725] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:34,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164970187] [2025-02-08 13:31:34,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:34,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:34,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:34,567 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 13:31:34,568 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 13:31:34,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:31:34,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:31:34,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:34,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:34,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:31:34,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:34,814 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 13:31:34,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:34,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164970187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:34,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:34,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:31:34,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874026870] [2025-02-08 13:31:34,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:34,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:34,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:34,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:34,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:34,815 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:34,850 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-02-08 13:31:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:34,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 13:31:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:34,851 INFO L225 Difference]: With dead ends: 35 [2025-02-08 13:31:34,851 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 13:31:34,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:34,852 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:34,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 34 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:34,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 13:31:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-08 13:31:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-02-08 13:31:34,857 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 11 [2025-02-08 13:31:34,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:34,857 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-02-08 13:31:34,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-02-08 13:31:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:31:34,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:34,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:34,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:31:35,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:35,061 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:35,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1519832188, now seen corresponding path program 1 times [2025-02-08 13:31:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:35,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047337387] [2025-02-08 13:31:35,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:35,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:31:35,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:31:35,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:35,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:31:35,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:35,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047337387] [2025-02-08 13:31:35,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047337387] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:35,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143926797] [2025-02-08 13:31:35,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:35,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:35,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:35,206 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 13:31:35,210 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 13:31:35,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:31:35,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:31:35,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:35,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:35,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:35,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:31:35,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:31:35,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143926797] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:35,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:35,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:31:35,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955540910] [2025-02-08 13:31:35,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:35,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:31:35,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:35,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:31:35,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:35,469 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:35,495 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2025-02-08 13:31:35,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:35,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:31:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:35,496 INFO L225 Difference]: With dead ends: 70 [2025-02-08 13:31:35,496 INFO L226 Difference]: Without dead ends: 42 [2025-02-08 13:31:35,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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 13:31:35,497 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:35,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 122 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-08 13:31:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-08 13:31:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2025-02-08 13:31:35,507 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 12 [2025-02-08 13:31:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:35,507 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2025-02-08 13:31:35,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2025-02-08 13:31:35,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:31:35,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:35,508 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:35,523 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 13:31:35,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:35,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:35,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash 386941001, now seen corresponding path program 2 times [2025-02-08 13:31:35,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:35,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633686395] [2025-02-08 13:31:35,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:35,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:35,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:31:35,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:31:35,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:31:35,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:31:35,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:35,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633686395] [2025-02-08 13:31:35,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633686395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:35,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:35,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:31:35,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798252643] [2025-02-08 13:31:35,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:35,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:31:35,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:35,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:31:35,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:35,922 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:35,967 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2025-02-08 13:31:35,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:31:35,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:31:35,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:35,968 INFO L225 Difference]: With dead ends: 42 [2025-02-08 13:31:35,968 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 13:31:35,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:35,969 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:35,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 76 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 13:31:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 13:31:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-02-08 13:31:35,976 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 21 [2025-02-08 13:31:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:35,976 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-02-08 13:31:35,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-02-08 13:31:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:31:35,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:35,976 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 13:31:35,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:31:35,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:35,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:35,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1898907499, now seen corresponding path program 1 times [2025-02-08 13:31:35,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:35,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245569843] [2025-02-08 13:31:35,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:35,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:36,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:31:36,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:31:36,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:36,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:31:36,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:36,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245569843] [2025-02-08 13:31:36,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245569843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:36,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:36,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:31:36,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177519566] [2025-02-08 13:31:36,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:36,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:36,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:36,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:36,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:36,158 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:36,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:36,188 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2025-02-08 13:31:36,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:36,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:31:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:36,189 INFO L225 Difference]: With dead ends: 60 [2025-02-08 13:31:36,189 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 13:31:36,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 13:31:36,189 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:36,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 13:31:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 13:31:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2025-02-08 13:31:36,195 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2025-02-08 13:31:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:36,196 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2025-02-08 13:31:36,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2025-02-08 13:31:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:31:36,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:36,197 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:36,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:31:36,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:36,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1334128638, now seen corresponding path program 1 times [2025-02-08 13:31:36,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:36,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38264134] [2025-02-08 13:31:36,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:36,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:36,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:36,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:36,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:36,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:31:36,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38264134] [2025-02-08 13:31:36,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38264134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219938777] [2025-02-08 13:31:36,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:36,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:36,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:36,371 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 13:31:36,376 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 13:31:36,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:36,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:36,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:36,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:36,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:31:36,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:36,637 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 13:31:36,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219938777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:36,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:36,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:31:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327252514] [2025-02-08 13:31:36,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:36,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:36,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:36,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:36,639 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:36,671 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2025-02-08 13:31:36,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:36,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 13:31:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:36,672 INFO L225 Difference]: With dead ends: 43 [2025-02-08 13:31:36,672 INFO L226 Difference]: Without dead ends: 42 [2025-02-08 13:31:36,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:36,673 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:36,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-08 13:31:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-08 13:31:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2025-02-08 13:31:36,679 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 29 [2025-02-08 13:31:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:36,680 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2025-02-08 13:31:36,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2025-02-08 13:31:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:31:36,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:36,680 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:36,692 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 13:31:36,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 13:31:36,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:36,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:36,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1334128478, now seen corresponding path program 1 times [2025-02-08 13:31:36,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:36,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059862283] [2025-02-08 13:31:36,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:36,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:36,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:36,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:36,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:36,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:31:37,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:37,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059862283] [2025-02-08 13:31:37,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059862283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:37,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429462426] [2025-02-08 13:31:37,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:37,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:37,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:37,059 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 13:31:37,062 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 13:31:37,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:37,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:37,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:37,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:37,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:31:37,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:31:37,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:31:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429462426] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:37,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:31:37,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144557783] [2025-02-08 13:31:37,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:37,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:31:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:37,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:31:37,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:31:37,445 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:31:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:37,553 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2025-02-08 13:31:37,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:31:37,553 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-02-08 13:31:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:37,554 INFO L225 Difference]: With dead ends: 87 [2025-02-08 13:31:37,554 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 13:31:37,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:31:37,555 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:37,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 13:31:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-08 13:31:37,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2025-02-08 13:31:37,558 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 29 [2025-02-08 13:31:37,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:37,559 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2025-02-08 13:31:37,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:31:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2025-02-08 13:31:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:31:37,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:37,559 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:37,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 13:31:37,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:37,760 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:37,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash 784446406, now seen corresponding path program 1 times [2025-02-08 13:31:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:37,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218389596] [2025-02-08 13:31:37,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:37,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:37,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:31:37,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:31:37,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:37,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:38,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:38,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218389596] [2025-02-08 13:31:38,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218389596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:38,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:38,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:31:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758353499] [2025-02-08 13:31:38,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:38,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:31:38,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:38,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:31:38,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:38,153 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:38,212 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2025-02-08 13:31:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:38,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:31:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:38,213 INFO L225 Difference]: With dead ends: 77 [2025-02-08 13:31:38,213 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 13:31:38,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:38,214 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:38,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 78 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 13:31:38,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-02-08 13:31:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 65 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2025-02-08 13:31:38,218 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 48 [2025-02-08 13:31:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:38,218 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2025-02-08 13:31:38,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2025-02-08 13:31:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:31:38,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:38,219 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:38,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:31:38,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:38,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2012491049, now seen corresponding path program 1 times [2025-02-08 13:31:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:38,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108234364] [2025-02-08 13:31:38,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:38,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:31:38,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:31:38,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:38,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:31:38,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:38,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108234364] [2025-02-08 13:31:38,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108234364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:38,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:38,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:38,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968439888] [2025-02-08 13:31:38,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:38,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:38,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:38,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:38,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:38,349 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:38,371 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2025-02-08 13:31:38,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:38,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:31:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:38,372 INFO L225 Difference]: With dead ends: 68 [2025-02-08 13:31:38,372 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 13:31:38,373 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 13:31:38,373 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:38,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 13:31:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-02-08 13:31:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 60 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-02-08 13:31:38,377 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 48 [2025-02-08 13:31:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:38,377 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-02-08 13:31:38,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-02-08 13:31:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:31:38,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:38,378 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:38,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:31:38,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:38,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash 165466491, now seen corresponding path program 1 times [2025-02-08 13:31:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:38,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910457179] [2025-02-08 13:31:38,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:38,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:38,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:31:38,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:31:38,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:38,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:38,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:38,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910457179] [2025-02-08 13:31:38,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910457179] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:38,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781812612] [2025-02-08 13:31:38,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:38,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:38,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:38,567 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 13:31:38,568 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 13:31:38,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:31:38,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:31:38,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:38,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:38,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:38,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:38,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:38,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781812612] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:38,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:38,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:31:38,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333746018] [2025-02-08 13:31:38,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:38,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:31:38,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:38,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:31:38,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:38,914 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:38,962 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2025-02-08 13:31:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:38,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-08 13:31:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:38,964 INFO L225 Difference]: With dead ends: 98 [2025-02-08 13:31:38,964 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 13:31:38,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 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 13:31:38,965 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:38,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 147 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 13:31:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 13:31:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2025-02-08 13:31:38,972 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 55 [2025-02-08 13:31:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:38,973 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2025-02-08 13:31:38,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2025-02-08 13:31:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 13:31:38,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:38,973 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:38,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:31:39,173 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,SelfDestructingSolverStorable11 [2025-02-08 13:31:39,174 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:39,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash 732936718, now seen corresponding path program 2 times [2025-02-08 13:31:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:39,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783392057] [2025-02-08 13:31:39,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:39,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-02-08 13:31:39,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 13:31:39,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:31:39,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:39,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:39,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783392057] [2025-02-08 13:31:39,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783392057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:39,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985874850] [2025-02-08 13:31:39,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:39,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:39,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:39,434 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 13:31:39,436 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 13:31:39,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-02-08 13:31:39,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 13:31:39,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:31:39,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:39,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:31:39,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:39,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:39,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985874850] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:39,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:39,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 13:31:39,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414577717] [2025-02-08 13:31:39,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:39,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:31:39,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:39,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:31:39,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:31:39,843 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:39,910 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2025-02-08 13:31:39,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:31:39,911 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2025-02-08 13:31:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:39,911 INFO L225 Difference]: With dead ends: 143 [2025-02-08 13:31:39,911 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 13:31:39,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:31:39,912 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:39,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 147 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 13:31:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-08 13:31:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 113 states have (on average 1.0530973451327434) internal successors, (119), 114 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2025-02-08 13:31:39,918 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 64 [2025-02-08 13:31:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:39,918 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2025-02-08 13:31:39,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2025-02-08 13:31:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-08 13:31:39,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:39,919 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:39,928 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 13:31:40,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:40,123 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:40,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1569509550, now seen corresponding path program 3 times [2025-02-08 13:31:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404859677] [2025-02-08 13:31:40,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 13:31:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:40,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 12 equivalence classes. [2025-02-08 13:31:40,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 13:31:40,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-08 13:31:40,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:31:40,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:31:40,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 13:31:41,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 13:31:41,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:41,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:31:41,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:31:41,077 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:31:41,078 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONUNSUPPORTED_FEATURE (40 of 41 remaining) [2025-02-08 13:31:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2025-02-08 13:31:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2025-02-08 13:31:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2025-02-08 13:31:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2025-02-08 13:31:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONUNSUPPORTED_FEATURE (35 of 41 remaining) [2025-02-08 13:31:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2025-02-08 13:31:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2025-02-08 13:31:41,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2025-02-08 13:31:41,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE (10 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2025-02-08 13:31:41,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2025-02-08 13:31:41,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2025-02-08 13:31:41,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 13:31:41,083 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:41,162 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 13:31:41,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:31:41 BoogieIcfgContainer [2025-02-08 13:31:41,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 13:31:41,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 13:31:41,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 13:31:41,166 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 13:31:41,166 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:31:32" (3/4) ... [2025-02-08 13:31:41,167 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 13:31:41,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 13:31:41,169 INFO L158 Benchmark]: Toolchain (without parser) took 10145.32ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 100.2MB in the beginning and 345.2MB in the end (delta: -245.0MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2025-02-08 13:31:41,169 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:31:41,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 779.60ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 81.4MB in the end (delta: 18.9MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. [2025-02-08 13:31:41,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.11ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 73.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:31:41,170 INFO L158 Benchmark]: Boogie Preprocessor took 59.48ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 67.1MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:31:41,170 INFO L158 Benchmark]: IcfgBuilder took 822.95ms. Allocated memory is still 142.6MB. Free memory was 66.4MB in the beginning and 51.4MB in the end (delta: 15.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2025-02-08 13:31:41,170 INFO L158 Benchmark]: TraceAbstraction took 8421.24ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 50.5MB in the beginning and 345.2MB in the end (delta: -294.7MB). Peak memory consumption was 212.0MB. Max. memory is 16.1GB. [2025-02-08 13:31:41,170 INFO L158 Benchmark]: Witness Printer took 2.29ms. Allocated memory is still 436.2MB. Free memory was 345.2MB in the beginning and 345.2MB in the end (delta: 56.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:31:41,173 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.14ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 779.60ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 81.4MB in the end (delta: 18.9MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.11ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 73.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.48ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 67.1MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 822.95ms. Allocated memory is still 142.6MB. Free memory was 66.4MB in the beginning and 51.4MB in the end (delta: 15.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8421.24ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 50.5MB in the beginning and 345.2MB in the end (delta: -294.7MB). Peak memory consumption was 212.0MB. Max. memory is 16.1GB. * Witness Printer took 2.29ms. Allocated memory is still 436.2MB. Free memory was 345.2MB in the beginning and 345.2MB in the end (delta: 56.6kB). There was no memory consumed. 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 - UnprovableResult [Line: 2403]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fputs at line 2403. Possible FailurePath: [L2232] static const char *applet_name; [L2233] static signed int bb_errno_location; [L2234] static signed int * const bb_errno = &bb_errno_location; [L2235] static struct __jmp_buf_tag die_jmp[1l]; [L2236] static signed int die_sleep; [L2237] static signed char logmode = (signed char)1; [L2238] static const char *msg_eol = "\n"; [L2239] static unsigned char xfunc_error_retval = (unsigned char)1; [L2419] static struct utmp dummy_utmp; [L2482] char *a = malloc(11); [L2483] a[10] = 0 [L2484] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] COND TRUE i<10 [L2485] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] COND TRUE i<10 [L2485] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] COND TRUE i<10 [L2485] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] COND TRUE i<10 [L2485] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] COND TRUE i<10 [L2485] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] COND TRUE i<10 [L2485] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] COND TRUE i<10 [L2485] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] COND TRUE i<10 [L2485] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] COND TRUE i<10 [L2485] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] COND TRUE i<10 [L2485] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=10, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2484] COND FALSE !(i<10) [L2486] applet_name = a [L2487] bb_errno_location = __VERIFIER_nondet_int() [L2488] optind = 1 [L2489] int argc = __VERIFIER_nondet_int(); [L2490] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2490] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2491] EXPR argc+1 [L2491] char **argv=malloc((argc+1)*sizeof(char*)); [L2492] EXPR argc+1 [L2492] char **mem_track=malloc((argc+1)*sizeof(char*)); [L2493] argv[argc]=0 [L2494] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-13:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, mem_track={-14:0}, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2494] COND TRUE i 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bacdcb0022ed9da204b2f4dd75716ae7304df31b79785d3f644890abf5aef4c3 [2025-02-08 13:31:43,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:31:43,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:31:43,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:31:43,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:31:43,693 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:31:43,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/yes-1.i [2025-02-08 13:31:44,894 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d7c8d6a1/06bdb38afbdc41c89feeaddeb567bad5/FLAG29b6dc2a3 [2025-02-08 13:31:45,216 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:31:45,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/yes-1.i [2025-02-08 13:31:45,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d7c8d6a1/06bdb38afbdc41c89feeaddeb567bad5/FLAG29b6dc2a3 [2025-02-08 13:31:45,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d7c8d6a1/06bdb38afbdc41c89feeaddeb567bad5 [2025-02-08 13:31:45,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:31:45,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:31:45,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:31:45,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:31:45,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:31:45,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:31:45" (1/1) ... [2025-02-08 13:31:45,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64447b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:45, skipping insertion in model container [2025-02-08 13:31:45,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:31:45" (1/1) ... [2025-02-08 13:31:45,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:31:46,053 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,054 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,055 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,056 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,057 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,065 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,065 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,066 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,068 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,069 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,073 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,073 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,089 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,090 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,091 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,101 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 13:31:46,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:31:46,135 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:31:46,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:31:46,417 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:31:46,422 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:31:46,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46 WrapperNode [2025-02-08 13:31:46,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:31:46,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:31:46,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:31:46,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:31:46,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,495 INFO L138 Inliner]: procedures = 607, calls = 482, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 763 [2025-02-08 13:31:46,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:31:46,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:31:46,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:31:46,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:31:46,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,553 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:31:46,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:31:46,609 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:31:46,609 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:31:46,609 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:31:46,610 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (1/1) ... [2025-02-08 13:31:46,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:31:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:46,650 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 13:31:46,654 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 13:31:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:31:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-02-08 13:31:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-02-08 13:31:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-02-08 13:31:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:31:46,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:31:46,673 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:31:46,673 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-02-08 13:31:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-02-08 13:31:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-02-08 13:31:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-02-08 13:31:46,932 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:31:46,934 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:31:48,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2332: bb_verror_msg_#t~ret100#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet105#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;havoc bb_verror_msg_#t~ret100#1;call bb_verror_msg_#t~mem101#1.base, bb_verror_msg_#t~mem101#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8bv64);assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2bv32, bb_verror_msg_#t~mem101#1.base, bb_verror_msg_#t~mem101#1.offset, ~sign_extend~64~32(bb_verror_msg_~used~0#1);havoc full_write_#res#1;havoc full_write_#t~ret106#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0bv64; [2025-02-08 13:31:48,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2349: assume !(0bv64 == full_write_~len#1);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret107#1, safe_write_#t~mem108#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~0#1; [2025-02-08 13:31:48,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2349: assume !!(0bv64 == full_write_~len#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:31:48,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2333: bb_verror_msg_#t~ret102#1 := full_write_#res#1;havoc full_write_#t~ret106#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;havoc bb_verror_msg_#t~mem101#1.base, bb_verror_msg_#t~mem101#1.offset;havoc bb_verror_msg_#t~ret102#1; [2025-02-08 13:31:48,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358: assume ~bvsle~65(~bvadd~65(~sign_extend~65~64(full_write_~total~0#1), ~sign_extend~65~64(full_write_~cc~0#1)), 9223372036854775807bv65);full_write_~total~0#1 := ~bvadd~64(full_write_~total~0#1, full_write_~cc~0#1);full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, ~bvadd~64(full_write_~buf#1.offset, full_write_~cc~0#1);full_write_~len#1 := ~bvsub~64(full_write_~len#1, full_write_~cc~0#1); [2025-02-08 13:31:48,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358: assume !~bvsle~65(~bvadd~65(~sign_extend~65~64(full_write_~total~0#1), ~sign_extend~65~64(full_write_~cc~0#1)), 9223372036854775807bv65); [2025-02-08 13:31:48,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358-1: assume ~bvsle~65(27670116110564327424bv65, ~bvadd~65(~sign_extend~65~64(full_write_~total~0#1), ~sign_extend~65~64(full_write_~cc~0#1))); [2025-02-08 13:31:48,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358-1: assume !~bvsle~65(27670116110564327424bv65, ~bvadd~65(~sign_extend~65~64(full_write_~total~0#1), ~sign_extend~65~64(full_write_~cc~0#1))); [2025-02-08 13:31:48,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367-1: assume 0bv8 != safe_write_~tmp_if_expr$1~0#1; [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367-1: assume !(0bv8 != safe_write_~tmp_if_expr$1~0#1); [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet147#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet147#1;write_~ret~1#1 := write_#t~nondet147#1;havoc write_#t~nondet147#1; [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367: assume !true; [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2351: full_write_#t~ret106#1 := safe_write_#res#1;havoc safe_write_#t~ret107#1, safe_write_#t~mem108#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;full_write_~cc~0#1 := full_write_#t~ret106#1;havoc full_write_#t~ret106#1; [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2352: assume ~bvslt~64(full_write_~cc~0#1, 0bv64); [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2352: assume !~bvslt~64(full_write_~cc~0#1, 0bv64); [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2369: safe_write_#t~ret107#1 := write_#res#1;havoc write_#t~nondet147#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;safe_write_~n~0#1 := safe_write_#t~ret107#1;havoc safe_write_#t~ret107#1; [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2477-1: SUMMARY for call assume_abort_if_not((if 18446744073709551615bv64 == write_~ret~1#1 || (~bvsge~64(write_~ret~1#1, 0bv64) && ~bvule~64(write_~ret~1#1, write_~nbyte#1)) then 1bv32 else 0bv32)); srcloc: null [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2477: write_#res#1 := write_~ret~1#1; [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2370: assume ~bvslt~64(safe_write_~n~0#1, 0bv64);call safe_write_#t~mem108#1 := read~intINTTYPE4(~bb_errno~0.base, ~bb_errno~0.offset, 4bv64);safe_write_~tmp_if_expr$1~0#1 := (if 0bv32 == (if 0bv32 != (if 4bv32 == safe_write_#t~mem108#1 then 1bv32 else 0bv32) then 1bv32 else 0bv32) then 0bv8 else 1bv8); [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2370: assume !~bvslt~64(safe_write_~n~0#1, 0bv64);safe_write_~tmp_if_expr$1~0#1 := 0bv8; [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2354: assume !(0bv64 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:31:48,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2354: assume !!(0bv64 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:31:48,153 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2025-02-08 13:31:48,153 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:31:48,161 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:31:48,161 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:31:48,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:31:48 BoogieIcfgContainer [2025-02-08 13:31:48,161 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:31:48,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:31:48,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:31:48,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:31:48,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:31:45" (1/3) ... [2025-02-08 13:31:48,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f44e4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:31:48, skipping insertion in model container [2025-02-08 13:31:48,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:46" (2/3) ... [2025-02-08 13:31:48,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f44e4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:31:48, skipping insertion in model container [2025-02-08 13:31:48,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:31:48" (3/3) ... [2025-02-08 13:31:48,168 INFO L128 eAbstractionObserver]: Analyzing ICFG yes-1.i [2025-02-08 13:31:48,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:31:48,184 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG yes-1.i that has 3 procedures, 137 locations, 1 initial locations, 14 loop locations, and 41 error locations. [2025-02-08 13:31:48,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:31:48,235 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;@734a73ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:31:48,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-02-08 13:31:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 130 states have internal predecessors, (156), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:31:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:31:48,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:48,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:31:48,243 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:48,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:48,246 INFO L85 PathProgramCache]: Analyzing trace with hash 226372, now seen corresponding path program 1 times [2025-02-08 13:31:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 13:31:48,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115682055] [2025-02-08 13:31:48,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:48,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:48,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:48,258 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 13:31:48,260 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 13:31:48,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:31:48,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:31:48,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:48,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:48,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 13:31:48,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:48,886 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 13:31:48,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:48,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 13:31:48,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115682055] [2025-02-08 13:31:48,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115682055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:48,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:48,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:31:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755472089] [2025-02-08 13:31:48,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:48,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 13:31:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 13:31:48,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 13:31:48,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:31:48,904 INFO L87 Difference]: Start difference. First operand has 137 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 130 states have internal predecessors, (156), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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 13:31:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:48,917 INFO L93 Difference]: Finished difference Result 160 states and 197 transitions. [2025-02-08 13:31:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 13:31:48,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-02-08 13:31:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:48,921 INFO L225 Difference]: With dead ends: 160 [2025-02-08 13:31:48,921 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 13:31:48,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:31:48,925 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:48,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 13:31:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-08 13:31:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.391304347826087) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-02-08 13:31:48,947 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 3 [2025-02-08 13:31:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:48,948 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-02-08 13:31:48,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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 13:31:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-02-08 13:31:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 13:31:48,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:48,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 13:31:48,972 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 13:31:49,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:49,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:49,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:49,154 INFO L85 PathProgramCache]: Analyzing trace with hash 7017695, now seen corresponding path program 1 times [2025-02-08 13:31:49,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 13:31:49,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865897806] [2025-02-08 13:31:49,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:49,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:49,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:49,158 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 13:31:49,159 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 13:31:49,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 13:31:49,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 13:31:49,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:49,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:49,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:31:49,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:49,786 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 13:31:49,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:49,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 13:31:49,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865897806] [2025-02-08 13:31:49,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865897806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:49,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:49,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:31:49,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047451642] [2025-02-08 13:31:49,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:49,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:49,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 13:31:49,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:49,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:49,792 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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 13:31:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:49,831 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-02-08 13:31:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:49,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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 13:31:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:49,832 INFO L225 Difference]: With dead ends: 61 [2025-02-08 13:31:49,832 INFO L226 Difference]: Without dead ends: 34 [2025-02-08 13:31:49,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 13:31:49,833 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:49,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-08 13:31:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 13:31:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-02-08 13:31:49,838 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 4 [2025-02-08 13:31:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:49,839 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-02-08 13:31:49,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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 13:31:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-02-08 13:31:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:31:49,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:49,840 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:31:49,866 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 13:31:50,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:50,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:50,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1389079994, now seen corresponding path program 1 times [2025-02-08 13:31:50,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 13:31:50,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101897807] [2025-02-08 13:31:50,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:50,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:50,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:50,045 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 13:31:50,046 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 13:31:50,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:31:50,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:31:50,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:50,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:50,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:50,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:50,689 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 13:31:50,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:50,727 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 13:31:50,727 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 13:31:50,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101897807] [2025-02-08 13:31:50,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101897807] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:50,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 13:31:50,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2025-02-08 13:31:50,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604070124] [2025-02-08 13:31:50,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:50,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:31:50,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 13:31:50,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:31:50,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:50,728 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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 13:31:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:51,089 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-02-08 13:31:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:51,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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 7 [2025-02-08 13:31:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:51,090 INFO L225 Difference]: With dead ends: 64 [2025-02-08 13:31:51,090 INFO L226 Difference]: Without dead ends: 37 [2025-02-08 13:31:51,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:51,090 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:51,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:31:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-08 13:31:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2025-02-08 13:31:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-02-08 13:31:51,096 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 7 [2025-02-08 13:31:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:51,097 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-02-08 13:31:51,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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 13:31:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-02-08 13:31:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 13:31:51,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:51,097 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:51,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:31:51,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:51,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:51,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1730815651, now seen corresponding path program 1 times [2025-02-08 13:31:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 13:31:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055900184] [2025-02-08 13:31:51,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:51,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:51,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:51,303 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 13:31:51,304 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 13:31:51,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 13:31:51,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 13:31:51,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:51,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:51,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:31:51,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 13:31:52,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:52,025 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 13:31:52,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055900184] [2025-02-08 13:31:52,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055900184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:52,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:52,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:31:52,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587373021] [2025-02-08 13:31:52,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:52,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:31:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 13:31:52,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:31:52,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:52,026 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:52,470 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-02-08 13:31:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:31:52,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-08 13:31:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:52,474 INFO L225 Difference]: With dead ends: 34 [2025-02-08 13:31:52,474 INFO L226 Difference]: Without dead ends: 32 [2025-02-08 13:31:52,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:52,475 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:52,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 70 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:31:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-08 13:31:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-08 13:31:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-02-08 13:31:52,479 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 15 [2025-02-08 13:31:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:52,479 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-02-08 13:31:52,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-02-08 13:31:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:31:52,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:52,479 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:52,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 13:31:52,680 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 [2025-02-08 13:31:52,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:52,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1445274227, now seen corresponding path program 1 times [2025-02-08 13:31:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 13:31:52,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451553492] [2025-02-08 13:31:52,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:52,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:52,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:52,683 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 13:31:52,685 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 13:31:52,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 13:31:53,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 13:31:53,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:53,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:53,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:31:53,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 13:31:53,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:53,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 13:31:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451553492] [2025-02-08 13:31:53,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451553492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:53,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:53,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:53,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875224671] [2025-02-08 13:31:53,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:53,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:53,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 13:31:53,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:53,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:53,345 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:53,704 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-02-08 13:31:53,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:53,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:31:53,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:53,704 INFO L225 Difference]: With dead ends: 40 [2025-02-08 13:31:53,704 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 13:31:53,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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 13:31:53,705 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:53,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:31:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 13:31:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-02-08 13:31:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-02-08 13:31:53,708 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 21 [2025-02-08 13:31:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:53,708 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-02-08 13:31:53,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-02-08 13:31:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:31:53,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:53,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:53,739 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 13:31:53,909 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 [2025-02-08 13:31:53,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:53,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:53,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1445279192, now seen corresponding path program 1 times [2025-02-08 13:31:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 13:31:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258340397] [2025-02-08 13:31:53,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:53,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:53,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:53,914 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 13:31:53,917 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 13:31:54,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 13:31:54,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 13:31:54,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:54,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:54,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:31:54,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 13:31:54,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:54,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 13:31:54,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258340397] [2025-02-08 13:31:54,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258340397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:54,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:54,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:54,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358305171] [2025-02-08 13:31:54,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:54,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:54,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 13:31:54,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:54,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:54,563 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:54,881 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2025-02-08 13:31:54,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:54,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:31:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:54,882 INFO L225 Difference]: With dead ends: 61 [2025-02-08 13:31:54,882 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 13:31:54,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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 13:31:54,888 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:54,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:31:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 13:31:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-08 13:31:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-02-08 13:31:54,894 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2025-02-08 13:31:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:54,894 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-02-08 13:31:54,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-02-08 13:31:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 13:31:54,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:54,894 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:54,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:31:55,095 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 [2025-02-08 13:31:55,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:55,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:55,095 INFO L85 PathProgramCache]: Analyzing trace with hash -734583651, now seen corresponding path program 1 times [2025-02-08 13:31:55,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 13:31:55,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229646869] [2025-02-08 13:31:55,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:55,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:55,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:55,098 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 13:31:55,099 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 13:31:55,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 13:31:55,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 13:31:55,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:55,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:55,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:55,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 13:31:55,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 13:31:55,895 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 13:31:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229646869] [2025-02-08 13:31:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229646869] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:55,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 13:31:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-02-08 13:31:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264341307] [2025-02-08 13:31:55,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:55,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:31:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 13:31:55,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:31:55,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:55,897 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:56,682 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2025-02-08 13:31:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:56,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-08 13:31:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:56,684 INFO L225 Difference]: With dead ends: 71 [2025-02-08 13:31:56,684 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 13:31:56,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:56,685 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:56,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 13:31:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 13:31:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2025-02-08 13:31:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.170731707317073) internal successors, (48), 42 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-02-08 13:31:56,706 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 24 [2025-02-08 13:31:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:56,707 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-02-08 13:31:56,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-02-08 13:31:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 13:31:56,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:56,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:56,734 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 13:31:56,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:56,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:56,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2033724653, now seen corresponding path program 1 times [2025-02-08 13:31:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 13:31:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386093310] [2025-02-08 13:31:56,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:56,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:56,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:56,912 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 13:31:56,913 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 13:31:57,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 13:31:57,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 13:31:57,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:57,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:57,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:31:57,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 13:31:57,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:57,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 13:31:57,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386093310] [2025-02-08 13:31:57,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386093310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:57,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:57,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:31:57,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933542261] [2025-02-08 13:31:57,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:57,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:31:57,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 13:31:57,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:31:57,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:57,588 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:58,438 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-02-08 13:31:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:58,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-08 13:31:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:58,442 INFO L225 Difference]: With dead ends: 52 [2025-02-08 13:31:58,442 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 13:31:58,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:58,443 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:58,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 13:31:58,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 13:31:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-08 13:31:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-02-08 13:31:58,449 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 24 [2025-02-08 13:31:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:58,449 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-02-08 13:31:58,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-02-08 13:31:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 13:31:58,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:58,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:58,483 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 13:31:58,650 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 [2025-02-08 13:31:58,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:31:58,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:58,651 INFO L85 PathProgramCache]: Analyzing trace with hash 603742997, now seen corresponding path program 1 times [2025-02-08 13:31:58,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 13:31:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405397322] [2025-02-08 13:31:58,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:58,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:58,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:58,655 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 13:31:58,656 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 13:31:58,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 13:31:59,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 13:31:59,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:59,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:59,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:31:59,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 13:31:59,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 13:31:59,468 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 13:31:59,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405397322] [2025-02-08 13:31:59,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405397322] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:59,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 13:31:59,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-02-08 13:31:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534839601] [2025-02-08 13:31:59,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:59,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 13:31:59,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 13:31:59,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 13:31:59,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:31:59,470 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:32:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:32:00,373 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2025-02-08 13:32:00,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 13:32:00,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-02-08 13:32:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:32:00,374 INFO L225 Difference]: With dead ends: 94 [2025-02-08 13:32:00,374 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 13:32:00,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:32:00,375 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 13:32:00,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 102 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 13:32:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 13:32:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-08 13:32:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 54 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:32:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-02-08 13:32:00,379 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2025-02-08 13:32:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:32:00,379 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-02-08 13:32:00,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:32:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-02-08 13:32:00,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 13:32:00,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:32:00,380 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:32:00,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 13:32:00,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:32:00,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:32:00,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:32:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1426284459, now seen corresponding path program 2 times [2025-02-08 13:32:00,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 13:32:00,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566490840] [2025-02-08 13:32:00,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:32:00,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:32:00,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:32:00,584 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 13:32:00,585 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 13:32:00,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-08 13:32:09,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 13:32:09,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:32:09,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:32:09,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:32:09,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:32:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 13:32:09,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:32:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 13:32:09,659 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 13:32:09,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566490840] [2025-02-08 13:32:09,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566490840] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:32:09,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 13:32:09,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-08 13:32:09,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063897859] [2025-02-08 13:32:09,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 13:32:09,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 13:32:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 13:32:09,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 13:32:09,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:32:09,661 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:32:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:32:11,210 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2025-02-08 13:32:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 13:32:11,211 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2025-02-08 13:32:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:32:11,213 INFO L225 Difference]: With dead ends: 101 [2025-02-08 13:32:11,213 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 13:32:11,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:32:11,214 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:32:11,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 123 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 13:32:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 13:32:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 13:32:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:32:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2025-02-08 13:32:11,232 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 46 [2025-02-08 13:32:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:32:11,233 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2025-02-08 13:32:11,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:32:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2025-02-08 13:32:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 13:32:11,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:32:11,236 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:32:11,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 13:32:11,440 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 [2025-02-08 13:32:11,440 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 13:32:11,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:32:11,441 INFO L85 PathProgramCache]: Analyzing trace with hash -113171307, now seen corresponding path program 3 times [2025-02-08 13:32:11,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 13:32:11,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376363047] [2025-02-08 13:32:11,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 13:32:11,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:32:11,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:32:11,445 INFO L229 MonitoredProcess]: Starting monitored process 12 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 13:32:11,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 13:32:11,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 8 equivalence classes.