./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/who-2.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/who-2.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 e0b6053e1bcaf28528cb48e3712d575ac5a666d224e39ce4315a9d6b0f4fb21c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:30:56,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:30:56,457 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:30:56,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:30:56,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:30:56,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:30:56,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:30:56,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:30:56,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:30:56,481 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:30:56,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:30:56,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:30:56,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:30:56,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:30:56,481 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:30:56,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:30:56,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:30:56,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:30:56,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:30:56,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:30:56,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:30:56,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:30:56,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:30:56,483 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:30:56,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:30:56,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:30:56,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:30:56,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:30:56,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:30:56,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:30:56,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:30:56,483 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 -> e0b6053e1bcaf28528cb48e3712d575ac5a666d224e39ce4315a9d6b0f4fb21c [2025-02-08 13:30:56,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:30:56,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:30:56,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:30:56,784 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:30:56,785 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:30:56,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/who-2.i [2025-02-08 13:30:58,117 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aaa0c1720/7fb36cc1d1b04b20abfe74506edcdd4c/FLAG0fa30e609 [2025-02-08 13:30:58,552 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:30:58,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/who-2.i [2025-02-08 13:30:58,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aaa0c1720/7fb36cc1d1b04b20abfe74506edcdd4c/FLAG0fa30e609 [2025-02-08 13:30:58,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aaa0c1720/7fb36cc1d1b04b20abfe74506edcdd4c [2025-02-08 13:30:58,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:30:58,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:30:58,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:30:58,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:30:58,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:30:58,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:30:58" (1/1) ... [2025-02-08 13:30:58,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f121fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:58, skipping insertion in model container [2025-02-08 13:30:58,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:30:58" (1/1) ... [2025-02-08 13:30:58,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:31:00,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:31:00,630 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:31:00,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:31:01,072 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:31:01,084 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:31:01,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:01 WrapperNode [2025-02-08 13:31:01,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:31:01,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:31:01,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:31:01,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:31:01,093 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:01" (1/1) ... [2025-02-08 13:31:01,155 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:01" (1/1) ... [2025-02-08 13:31:01,234 INFO L138 Inliner]: procedures = 639, calls = 723, calls flagged for inlining = 29, calls inlined = 28, statements flattened = 1971 [2025-02-08 13:31:01,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:31:01,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:31:01,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:31:01,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:31:01,245 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:01" (1/1) ... [2025-02-08 13:31:01,245 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:01" (1/1) ... [2025-02-08 13:31:01,264 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:01" (1/1) ... [2025-02-08 13:31:01,327 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:31:01,327 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:01" (1/1) ... [2025-02-08 13:31:01,332 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:01" (1/1) ... [2025-02-08 13:31:01,380 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:01" (1/1) ... [2025-02-08 13:31:01,384 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:01" (1/1) ... [2025-02-08 13:31:01,396 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:01" (1/1) ... [2025-02-08 13:31:01,406 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:01" (1/1) ... [2025-02-08 13:31:01,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:31:01,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:31:01,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:31:01,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:31:01,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:01" (1/1) ... [2025-02-08 13:31:01,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:31:01,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:01,472 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:01,475 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:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:31:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:31:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:31:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:31:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:31:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:31:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:31:01,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:31:01,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:31:01,498 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-08 13:31:01,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:31:01,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:31:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:31:01,498 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:31:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:31:01,927 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:31:01,930 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:31:02,311 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025-1: assume 0 != safe_write_~tmp_if_expr$1~1#1 % 256; [2025-02-08 13:31:02,311 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025-1: assume !(0 != safe_write_~tmp_if_expr$1~1#1 % 256); [2025-02-08 13:31:02,311 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025: 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~nondet267#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~nondet267#1;assume -9223372036854775808 <= write_#t~nondet267#1 && write_#t~nondet267#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet267#1;havoc write_#t~nondet267#1; [2025-02-08 13:31:02,311 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025: assume !true; [2025-02-08 13:31:02,311 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2555: bb_verror_msg_#t~ret60#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet66#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= bb_verror_msg_#t~ret60#1 && bb_verror_msg_#t~ret60#1 <= 2147483647;havoc bb_verror_msg_#t~ret60#1;call bb_verror_msg_#t~mem61#1.base, bb_verror_msg_#t~mem61#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~mem61#1.base, bb_verror_msg_#t~mem61#1.offset, bb_verror_msg_~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret67#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:02,313 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3034-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:31:02,313 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2572: 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~ret187#1, safe_write_#t~mem188#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~1#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~1#1; [2025-02-08 13:31:02,313 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2572: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:31:02,314 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2556: bb_verror_msg_#t~ret62#1 := full_write_#res#1;havoc full_write_#t~ret67#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~ret62#1 && bb_verror_msg_#t~ret62#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem61#1.base, bb_verror_msg_#t~mem61#1.offset;havoc bb_verror_msg_#t~ret62#1; [2025-02-08 13:31:02,314 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:31:02,314 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:31:02,314 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581: 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:02,314 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:31:02,314 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027: safe_write_#t~ret187#1 := write_#res#1;havoc write_#t~nondet267#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~ret187#1 && safe_write_#t~ret187#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret187#1;havoc safe_write_#t~ret187#1; [2025-02-08 13:31:02,315 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3028: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem188#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~1#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem188#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:31:02,316 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3028: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~1#1 := 0; [2025-02-08 13:31:02,316 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2574: full_write_#t~ret67#1 := safe_write_#res#1;havoc safe_write_#t~ret187#1, safe_write_#t~mem188#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~1#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~ret67#1 && full_write_#t~ret67#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret67#1;havoc full_write_#t~ret67#1; [2025-02-08 13:31:02,316 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2575: assume full_write_~cc~0#1 < 0; [2025-02-08 13:31:02,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2575: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:31:02,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287-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:02,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287: write_#res#1 := write_~ret~1#1; [2025-02-08 13:31:02,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2577: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:31:02,317 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2577: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:31:04,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3041-1: SUMMARY for call assume_abort_if_not((if stat_#t~mem191#1 >= 0 then 1 else 0)); srcloc: null [2025-02-08 13:31:04,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3041: havoc stat_#t~mem191#1;stat_#res#1 := 0; [2025-02-08 13:31:04,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3273: havoc getopt_long_#t~ret263#1;getopt32_#t~ret144#1 := getopt_long_#res#1;havoc getopt_long_#t~mem259#1.base, getopt_long_#t~mem259#1.offset, getopt_long_#t~mem260#1, getopt_long_#t~mem261#1.base, getopt_long_#t~mem261#1.offset, getopt_long_#t~mem262#1, getopt_long_#t~ret263#1, getopt_long_~argc#1, getopt_long_~#argv#1.base, getopt_long_~#argv#1.offset, getopt_long_~optstring#1.base, getopt_long_~optstring#1.offset, getopt_long_~longopts#1.base, getopt_long_~longopts#1.offset, getopt_long_~longindex#1.base, getopt_long_~longindex#1.offset;havoc getopt_long_#in~argc#1, getopt_long_#in~argv#1.base, getopt_long_#in~argv#1.offset, getopt_long_#in~optstring#1.base, getopt_long_#in~optstring#1.offset, getopt_long_#in~longopts#1.base, getopt_long_#in~longopts#1.offset, getopt_long_#in~longindex#1.base, getopt_long_#in~longindex#1.offset;assume { :end_inline_getopt_long } true;assume -2147483648 <= getopt32_#t~ret144#1 && getopt32_#t~ret144#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret144#1;havoc getopt32_#t~ret144#1; [2025-02-08 13:31:04,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3273-2: getopt_long_#t~ret263#1 := getopt_#res#1;havoc getopt_#t~mem243#1.base, getopt_#t~mem243#1.offset, getopt_#t~mem244#1, getopt_#t~short245#1, getopt_#t~nondet246#1, getopt_#t~nondet247#1, getopt_#t~mem248#1, getopt_#t~short249#1, getopt_#t~nondet250#1, getopt_#t~mem251#1, getopt_#t~nondet252#1, getopt_#t~pre253#1, getopt_#t~mem254#1, getopt_#t~short255#1, getopt_#t~nondet256#1, getopt_#t~mem257#1.base, getopt_#t~mem257#1.offset, getopt_#t~pre258#1, getopt_~argc#1, getopt_~argv#1.base, getopt_~argv#1.offset, getopt_~optstring#1.base, getopt_~optstring#1.offset, getopt_~result~0#1, getopt_~opt_index~0#1;havoc getopt_#in~argc#1, getopt_#in~argv#1.base, getopt_#in~argv#1.offset, getopt_#in~optstring#1.base, getopt_#in~optstring#1.offset;assume { :end_inline_getopt } true;assume -2147483648 <= getopt_long_#t~ret263#1 && getopt_long_#t~ret263#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret263#1;havoc getopt_long_#t~ret263#1; [2025-02-08 13:31:04,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108: __main_#t~ret208#1 := bb_putchar_#res#1;havoc bb_putchar_#t~nondet37#1, bb_putchar_~ch#1, bb_putchar_~return_value_putchar_unlocked$1~0#1;havoc bb_putchar_#in~ch#1;assume { :end_inline_bb_putchar } true;assume -2147483648 <= __main_#t~ret208#1 && __main_#t~ret208#1 <= 2147483647; [2025-02-08 13:31:04,462 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3075: assume 0 == __main_~do_users~0#1;call __main_~#str6~0#1.base, __main_~#str6~0#1.offset := #Ultimate.allocOnStack(6);call __main_~#name~0#1.base, __main_~#name~0#1.offset := #Ultimate.allocOnStack(39);call __main_~#st~0#1.base, __main_~#st~0#1.offset := #Ultimate.allocOnStack(144);call __main_~#seconds~0#1.base, __main_~#seconds~0#1.offset := #Ultimate.allocOnStack(8);call write~int(63, __main_~#str6~0#1.base, __main_~#str6~0#1.offset, 1);call write~int(0, __main_~#str6~0#1.base, 1 + __main_~#str6~0#1.offset, 1); [2025-02-08 13:31:04,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3075: assume !(0 == __main_~do_users~0#1);havoc __main_#t~ret207#1;havoc __main_#t~ret207#1;__main_~fmt~0#1.base, __main_~fmt~0#1.offset := 13, 0; [2025-02-08 13:31:04,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2910-1: assume true; [2025-02-08 13:31:04,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2910-1: assume !true; [2025-02-08 13:31:04,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:31:04,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:31:04,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209-1: SUMMARY for call bb_error_msg_and_die(15, 0, xstrtou_range_sfx_#t~varargs229#1.base, xstrtou_range_sfx_#t~varargs229#1.offset); srcloc: null [2025-02-08 13:31:04,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3176: assume true;call xstrtou_range_sfx_#t~mem221#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:31:04,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3176: assume !true; [2025-02-08 13:31:04,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: havoc xstrtou_range_sfx_#t~varargs229#1.base, xstrtou_range_sfx_#t~varargs229#1.offset;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset;xatou_range_#t~ret210#1 := xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem214#1, xstrtou_range_sfx_#t~mem215#1, xstrtou_range_sfx_#t~mem216#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem217#1, xstrtou_range_sfx_#t~ret218#1, xstrtou_range_sfx_#t~mem219#1.base, xstrtou_range_sfx_#t~mem219#1.offset, xstrtou_range_sfx_#t~mem220#1, xstrtou_range_sfx_#t~mem221#1, xstrtou_range_sfx_#t~mem222#1.base, xstrtou_range_sfx_#t~mem222#1.offset, xstrtou_range_sfx_#t~nondet223#1, xstrtou_range_sfx_#t~mem224#1, xstrtou_range_sfx_#t~mem225#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem226#1.base, xstrtou_range_sfx_#t~mem226#1.offset, xstrtou_range_sfx_#t~mem227#1, xstrtou_range_sfx_#t~varargs228#1.base, xstrtou_range_sfx_#t~varargs228#1.offset, xstrtou_range_sfx_#t~varargs229#1.base, xstrtou_range_sfx_#t~varargs229#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~0#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~3#1, xstrtou_range_sfx_~tmp_if_expr$3~1#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;havoc xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;assume { :end_inline_xstrtou_range_sfx } true;xatou_range_~return_value_xstrtou_range_sfx$1~0#1 := xatou_range_#t~ret210#1;havoc xatou_range_#t~ret210#1;xatou_range_#res#1 := xatou_range_~return_value_xstrtou_range_sfx$1~0#1; [2025-02-08 13:31:04,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209-2: call xstrtou_range_sfx_#t~varargs229#1.base, xstrtou_range_sfx_#t~varargs229#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs229#1.base, xstrtou_range_sfx_#t~varargs229#1.offset, 8); [2025-02-08 13:31:04,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3176-1: assume !(0 == xstrtou_range_sfx_#t~mem221#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem221#1; [2025-02-08 13:31:04,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3176-1: assume !!(0 == xstrtou_range_sfx_#t~mem221#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem221#1; [2025-02-08 13:31:04,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2913: assume -1 == getopt32_~c~0#1; [2025-02-08 13:31:04,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2913: assume !(-1 == getopt32_~c~0#1);getopt32_~c~0#1 := getopt32_~c~0#1 % 256;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:31:04,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3178: havoc xstrtou_range_sfx_~__s1_len~0#1;havoc xstrtou_range_sfx_~__s2_len~0#1;havoc xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;call xstrtou_range_sfx_#t~mem222#1.base, xstrtou_range_sfx_#t~mem222#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1 := xstrtou_range_sfx_#t~nondet223#1;havoc xstrtou_range_sfx_#t~mem222#1.base, xstrtou_range_sfx_#t~mem222#1.offset;havoc xstrtou_range_sfx_#t~nondet223#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:31:04,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3013: assume 0 == safe_strncpy_~size#1 % 18446744073709551616;safe_strncpy_#res#1.base, safe_strncpy_#res#1.offset := safe_strncpy_~dst#1.base, safe_strncpy_~dst#1.offset; [2025-02-08 13:31:04,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3013: assume !(0 == safe_strncpy_~size#1 % 18446744073709551616); [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3114: xatoi_positive_#t~ret209#1 := xatou_range_#res#1;havoc xatou_range_#t~ret210#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;havoc xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1;assume { :end_inline_xatou_range } true;xatoi_positive_~return_value_xatou_range$1~0#1 := xatoi_positive_#t~ret209#1;havoc xatoi_positive_#t~ret209#1;xatoi_positive_#res#1 := (if xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 <= 2147483647 then xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 else xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3015: safe_strncpy_~size#1 := safe_strncpy_~size#1 - 1;call write~int(0, safe_strncpy_~dst#1.base, safe_strncpy_~dst#1.offset + (if safe_strncpy_~size#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then safe_strncpy_~size#1 % 18446744073709551616 % 18446744073709551616 else safe_strncpy_~size#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);havoc safe_strncpy_~return_value_strncpy$1~0#1.base, safe_strncpy_~return_value_strncpy$1~0#1.offset;safe_strncpy_~return_value_strncpy$1~0#1.base, safe_strncpy_~return_value_strncpy$1~0#1.offset := safe_strncpy_#t~nondet186#1.base, safe_strncpy_#t~nondet186#1.offset;havoc safe_strncpy_#t~nondet186#1.base, safe_strncpy_#t~nondet186#1.offset;safe_strncpy_#res#1.base, safe_strncpy_#res#1.offset := safe_strncpy_~return_value_strncpy$1~0#1.base, safe_strncpy_~return_value_strncpy$1~0#1.offset; [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3214: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret230#1.base, xzalloc_#t~ret230#1.offset;havoc xzalloc_#t~ret230#1.base, xzalloc_#t~ret230#1.offset; [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3214-1: SUMMARY for call xzalloc_#t~ret230#1.base, xzalloc_#t~ret230#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2917: assume true;call getopt32_#t~mem145#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2917: assume !true; [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2917-2: assume !!((if getopt32_#t~mem145#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem145#1 % 256 % 4294967296 else getopt32_#t~mem145#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem145#1; [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2917-2: assume !((if getopt32_#t~mem145#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem145#1 % 256 % 4294967296 else getopt32_#t~mem145#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem145#1;call getopt32_#t~mem146#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215-1: SUMMARY for call xzalloc_#t~memset~res231#1.base, xzalloc_#t~memset~res231#1.offset := #Ultimate.C_memset(xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset, 0, xzalloc_~size#1); srcloc: null [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: havoc xzalloc_#t~memset~res231#1.base, xzalloc_#t~memset~res231#1.offset;xzalloc_#res#1.base, xzalloc_#res#1.offset := xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083-1: SUMMARY for call __main_#t~strcpy~res199#1.base, __main_#t~strcpy~res199#1.offset := #Ultimate.C_strcpy(__main_~#name~0#1.base, __main_~#name~0#1.offset, 12, 0); srcloc: null [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083: havoc __main_#t~strcpy~res199#1.base, __main_#t~strcpy~res199#1.offset;call __main_#t~mem200#1 := read~int(__main_~ut~0#1.base, 6 + __main_~ut~0#1.offset, 1); [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2918: assume 0 == (if getopt32_#t~mem146#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem146#1 % 256 % 4294967296 else getopt32_#t~mem146#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem146#1; [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2918: assume !(0 == (if getopt32_#t~mem146#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem146#1 % 256 % 4294967296 else getopt32_#t~mem146#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem146#1;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~on_off~0#1.base, 34 + getopt32_~on_off~0#1.offset; [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: assume 45 == xstrtou_range_sfx_#t~mem214#1;havoc xstrtou_range_sfx_#t~mem214#1;xstrtou_range_sfx_~tmp_if_expr$1~3#1 := 1; [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: assume !(45 == xstrtou_range_sfx_#t~mem214#1);havoc xstrtou_range_sfx_#t~mem214#1;call xstrtou_range_sfx_#t~mem215#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1);xstrtou_range_sfx_~tmp_if_expr$1~3#1 := (if 0 == (if 0 != (if 43 == xstrtou_range_sfx_#t~mem215#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3183: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem224#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:31:04,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3183: assume !(0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1);havoc xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_~suffixes#1.base, 8 + xstrtou_range_sfx_~suffixes#1.offset; [2025-02-08 13:31:04,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084: assume 47 == __main_#t~mem200#1;havoc __main_#t~mem200#1;__main_~tmp_if_expr$1~2#1.base, __main_~tmp_if_expr$1~2#1.offset := __main_~#name~0#1.base, __main_~#name~0#1.offset; [2025-02-08 13:31:04,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084: assume !(47 == __main_#t~mem200#1);havoc __main_#t~mem200#1;__main_~tmp_if_expr$1~2#1.base, __main_~tmp_if_expr$1~2#1.offset := __main_~#name~0#1.base, 6 + __main_~#name~0#1.offset - 1; [2025-02-08 13:31:04,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2920: assume 0 != getopt32_#t~bitwise148#1 % 4294967296;havoc getopt32_#t~mem147#1;havoc getopt32_#t~bitwise148#1; [2025-02-08 13:31:04,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2920: assume !(0 != getopt32_#t~bitwise148#1 % 4294967296);havoc getopt32_#t~mem147#1;havoc getopt32_#t~bitwise148#1;call getopt32_#t~mem149#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem150#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:31:04,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2920-2: havoc getopt32_#t~bitwise148#1;assume getopt32_#t~bitwise148#1 % 4294967296 <= getopt32_#t~mem147#1 % 4294967296 && getopt32_#t~bitwise148#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:31:04,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2920-1: [2025-02-08 13:31:04,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2920-4: assume 0 == getopt32_#t~mem147#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise148#1 := 0; [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2920-4: assume !(0 == getopt32_#t~mem147#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2920-3: assume getopt32_#t~mem147#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise148#1 := getopt32_#t~mem147#1; [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2920-3: assume !(getopt32_#t~mem147#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2920-5: call getopt32_#t~mem147#1 := read~int(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3185: assume !(4294967295 / (xstrtou_range_sfx_#t~mem224#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem224#1; [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3185: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem224#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem224#1;call xstrtou_range_sfx_#t~mem225#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_~r~0#1 * xstrtou_range_sfx_#t~mem225#1;havoc xstrtou_range_sfx_#t~mem225#1; [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2591: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2922: getopt32_~trigger~0#1 := getopt32_#t~bitwise151#1;havoc getopt32_#t~mem149#1;havoc getopt32_#t~mem150#1;havoc getopt32_#t~bitwise151#1;call getopt32_#t~mem152#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2922-2: havoc getopt32_#t~bitwise151#1;assume getopt32_#t~bitwise151#1 % 4294967296 <= getopt32_#t~mem149#1 % 4294967296 && getopt32_#t~bitwise151#1 % 4294967296 <= getopt32_#t~mem150#1 % 4294967296; [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2922-1: [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2922-4: assume 0 == getopt32_#t~mem149#1 % 4294967296 || 0 == getopt32_#t~mem150#1 % 4294967296;getopt32_#t~bitwise151#1 := 0; [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2922-4: assume !(0 == getopt32_#t~mem149#1 % 4294967296 || 0 == getopt32_#t~mem150#1 % 4294967296); [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2922-3: assume getopt32_#t~mem149#1 % 4294967296 == getopt32_#t~mem150#1 % 4294967296;getopt32_#t~bitwise151#1 := getopt32_#t~mem149#1; [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2922-3: assume !(getopt32_#t~mem149#1 % 4294967296 == getopt32_#t~mem150#1 % 4294967296); [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3154: havoc xstrtou_range_sfx_~tmp_if_expr$3~1#1;havoc xstrtou_range_sfx_~tmp_statement_expression$2~0#1; [2025-02-08 13:31:04,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088: __main_#t~ret201#1.base, __main_#t~ret201#1.offset := safe_strncpy_#res#1.base, safe_strncpy_#res#1.offset;havoc safe_strncpy_#t~nondet186#1.base, safe_strncpy_#t~nondet186#1.offset, safe_strncpy_~dst#1.base, safe_strncpy_~dst#1.offset, safe_strncpy_~src#1.base, safe_strncpy_~src#1.offset, safe_strncpy_~size#1, safe_strncpy_~return_value_strncpy$1~0#1.base, safe_strncpy_~return_value_strncpy$1~0#1.offset;havoc safe_strncpy_#in~dst#1.base, safe_strncpy_#in~dst#1.offset, safe_strncpy_#in~src#1.base, safe_strncpy_#in~src#1.offset, safe_strncpy_#in~size#1;assume { :end_inline_safe_strncpy } true;havoc __main_#t~ret201#1.base, __main_#t~ret201#1.offset;havoc __main_~return_value_stat$2~0#1;assume { :begin_inline_stat } true;stat_#in~__file#1.base, stat_#in~__file#1.offset, stat_#in~__buf#1.base, stat_#in~__buf#1.offset := __main_~#name~0#1.base, __main_~#name~0#1.offset, __main_~#st~0#1.base, __main_~#st~0#1.offset;havoc stat_#res#1;havoc stat_#t~nondet189#1, stat_#t~nondet190#1, stat_#t~mem191#1, stat_~__file#1.base, stat_~__file#1.offset, stat_~__buf#1.base, stat_~__buf#1.offset;stat_~__file#1.base, stat_~__file#1.offset := stat_#in~__file#1.base, stat_#in~__file#1.offset;stat_~__buf#1.base, stat_~__buf#1.offset := stat_#in~__buf#1.base, stat_#in~__buf#1.offset;havoc stat_#t~nondet189#1;assume -9223372036854775808 <= stat_#t~nondet189#1 && stat_#t~nondet189#1 <= 9223372036854775807;call write~int(stat_#t~nondet189#1, stat_~__buf#1.base, 72 + stat_~__buf#1.offset, 8);havoc stat_#t~nondet189#1;havoc stat_#t~nondet190#1;assume -128 <= stat_#t~nondet190#1 && stat_#t~nondet190#1 <= 127; [2025-02-08 13:31:04,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088-1: assume { :begin_inline_safe_strncpy } true;safe_strncpy_#in~dst#1.base, safe_strncpy_#in~dst#1.offset, safe_strncpy_#in~src#1.base, safe_strncpy_#in~src#1.offset, safe_strncpy_#in~size#1 := __main_~tmp_if_expr$1~2#1.base, __main_~tmp_if_expr$1~2#1.offset, __main_~ut~0#1.base, 6 + __main_~ut~0#1.offset, 33;havoc safe_strncpy_#res#1.base, safe_strncpy_#res#1.offset;havoc safe_strncpy_#t~nondet186#1.base, safe_strncpy_#t~nondet186#1.offset, safe_strncpy_~dst#1.base, safe_strncpy_~dst#1.offset, safe_strncpy_~src#1.base, safe_strncpy_~src#1.offset, safe_strncpy_~size#1, safe_strncpy_~return_value_strncpy$1~0#1.base, safe_strncpy_~return_value_strncpy$1~0#1.offset;safe_strncpy_~dst#1.base, safe_strncpy_~dst#1.offset := safe_strncpy_#in~dst#1.base, safe_strncpy_#in~dst#1.offset;safe_strncpy_~src#1.base, safe_strncpy_~src#1.offset := safe_strncpy_#in~src#1.base, safe_strncpy_#in~src#1.offset;safe_strncpy_~size#1 := safe_strncpy_#in~size#1; [2025-02-08 13:31:04,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-1: [2025-02-08 13:31:04,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923: getopt32_~flags~0#1 := getopt32_#t~bitwise154#1;havoc getopt32_#t~mem152#1;havoc getopt32_#t~bitwise153#1;havoc getopt32_#t~bitwise154#1;call getopt32_#t~mem155#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:31:04,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise153#1) % 4294967296;getopt32_#t~bitwise154#1 := getopt32_~flags~0#1; [2025-02-08 13:31:04,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise153#1) % 4294967296); [2025-02-08 13:31:04,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-2: havoc getopt32_#t~bitwise154#1;assume getopt32_#t~bitwise154#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise154#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise153#1) % 4294967296; [2025-02-08 13:31:04,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-5: [2025-02-08 13:31:04,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise153#1) % 4294967296;getopt32_#t~bitwise154#1 := 0; [2025-02-08 13:31:04,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise153#1) % 4294967296); [2025-02-08 13:31:04,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-7: assume getopt32_#t~mem152#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise153#1 := 0; [2025-02-08 13:31:04,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-7: assume !(getopt32_#t~mem152#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:31:04,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-6: havoc getopt32_#t~bitwise153#1;assume getopt32_#t~bitwise153#1 % 4294967296 <= getopt32_#t~mem152#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:31:04,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-9: assume 0 == getopt32_#t~mem152#1 % 4294967296;getopt32_#t~bitwise153#1 := getopt32_~trigger~0#1; [2025-02-08 13:31:04,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-9: assume !(0 == getopt32_#t~mem152#1 % 4294967296); [2025-02-08 13:31:04,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise153#1 := getopt32_#t~mem152#1; [2025-02-08 13:31:04,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924: getopt32_~flags~0#1 := getopt32_#t~bitwise157#1;havoc getopt32_#t~mem155#1;havoc getopt32_#t~bitwise156#1;havoc getopt32_#t~bitwise157#1; [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-2: havoc getopt32_#t~bitwise157#1;assume (getopt32_#t~bitwise157#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise157#1 % 4294967296 >= getopt32_#t~bitwise156#1 % 4294967296) && getopt32_#t~bitwise157#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise156#1 % 4294967296; [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-1: [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise156#1 % 4294967296;getopt32_#t~bitwise157#1 := getopt32_#t~bitwise156#1; [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise156#1 % 4294967296); [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-3: assume 0 == getopt32_#t~bitwise156#1 % 4294967296;getopt32_#t~bitwise157#1 := getopt32_~flags~0#1; [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-3: assume !(0 == getopt32_#t~bitwise156#1 % 4294967296); [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-6: havoc getopt32_#t~bitwise156#1;assume getopt32_#t~bitwise156#1 % 4294967296 <= getopt32_#t~mem155#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-5: [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise156#1 := getopt32_#t~mem155#1; [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-7: assume getopt32_#t~mem155#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise156#1 := 0; [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-7: assume !(getopt32_#t~mem155#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-9: assume 0 == getopt32_#t~mem155#1 % 4294967296;getopt32_#t~bitwise156#1 := getopt32_~trigger~0#1; [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-9: assume !(0 == getopt32_#t~mem155#1 % 4294967296); [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3156: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);xstrtou_range_sfx_~tmp_if_expr$3~1#1 := 1; [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3156: assume !!(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);call xstrtou_range_sfx_#t~mem216#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:31:04,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090: __main_#t~ret202#1 := stat_#res#1;havoc stat_#t~nondet189#1, stat_#t~nondet190#1, stat_#t~mem191#1, stat_~__file#1.base, stat_~__file#1.offset, stat_~__buf#1.base, stat_~__buf#1.offset;havoc stat_#in~__file#1.base, stat_#in~__file#1.offset, stat_#in~__buf#1.base, stat_#in~__buf#1.offset;assume { :end_inline_stat } true;assume -2147483648 <= __main_#t~ret202#1 && __main_#t~ret202#1 <= 2147483647;__main_~return_value_stat$2~0#1 := __main_#t~ret202#1;havoc __main_#t~ret202#1; [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2991-1: assume idle_string_~return_value_time$1~0#1 - idle_string_~t#1 >= -9223372036854775808; [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2991-1: assume !(idle_string_~return_value_time$1~0#1 - idle_string_~t#1 >= -9223372036854775808); [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2991: assume idle_string_~return_value_time$1~0#1 - idle_string_~t#1 <= 9223372036854775807;idle_string_~t#1 := idle_string_~return_value_time$1~0#1 - idle_string_~t#1; [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2991: assume !(idle_string_~return_value_time$1~0#1 - idle_string_~t#1 <= 9223372036854775807); [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2925-1: [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2925: getopt32_~flags~0#1 := getopt32_#t~bitwise158#1;havoc getopt32_#t~bitwise158#1;call getopt32_#t~mem159#1.base, getopt32_#t~mem159#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2925-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise158#1 := 0; [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2925-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2925-2: havoc getopt32_#t~bitwise158#1;assume getopt32_#t~bitwise158#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2925-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise158#1 := getopt32_~trigger~0#1; [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2925-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2925-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise158#1 := getopt32_~flags~0#1; [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2925-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:31:04,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091: assume 0 == __main_~return_value_stat$2~0#1;call __main_#t~mem203#1 := read~int(__main_~#st~0#1.base, 72 + __main_~#st~0#1.offset, 8);assume { :begin_inline_idle_string } true;idle_string_#in~str6#1.base, idle_string_#in~str6#1.offset, idle_string_#in~t#1 := __main_~#str6~0#1.base, __main_~#str6~0#1.offset, __main_#t~mem203#1;havoc idle_string_#t~nondet177#1, idle_string_#t~loopctr178#1, idle_string_#t~nondet179#1, idle_string_#t~ret180#1, idle_string_#t~strcpy~res181#1.base, idle_string_#t~strcpy~res181#1.offset, idle_string_~str6#1.base, idle_string_~str6#1.offset, idle_string_~t#1, idle_string_~return_value_time$1~0#1;idle_string_~str6#1.base, idle_string_~str6#1.offset := idle_string_#in~str6#1.base, idle_string_#in~str6#1.offset;idle_string_~t#1 := idle_string_#in~t#1;havoc idle_string_~return_value_time$1~0#1;havoc idle_string_#t~nondet177#1;assume -9223372036854775808 <= idle_string_#t~nondet177#1 && idle_string_#t~nondet177#1 <= 9223372036854775807;idle_string_~return_value_time$1~0#1 := idle_string_#t~nondet177#1;havoc idle_string_#t~nondet177#1; [2025-02-08 13:31:04,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091: assume !(0 == __main_~return_value_stat$2~0#1); [2025-02-08 13:31:04,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2992: assume idle_string_~t#1 >= 0; [2025-02-08 13:31:04,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2992: assume !(idle_string_~t#1 >= 0); [2025-02-08 13:31:04,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926: assume !(getopt32_#t~mem159#1.base == 0 && getopt32_#t~mem159#1.offset == 0);havoc getopt32_#t~mem159#1.base, getopt32_#t~mem159#1.offset;call getopt32_#t~mem160#1.base, getopt32_#t~mem160#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem161#1.base, getopt32_#t~mem161#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem162#1 := read~int(getopt32_#t~mem161#1.base, getopt32_#t~mem161#1.offset, 4); [2025-02-08 13:31:04,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926: assume !!(getopt32_#t~mem159#1.base == 0 && getopt32_#t~mem159#1.offset == 0);havoc getopt32_#t~mem159#1.base, getopt32_#t~mem159#1.offset; [2025-02-08 13:31:04,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3191-1: call xstrtou_range_sfx_#t~mem226#1.base, xstrtou_range_sfx_#t~mem226#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem227#1 := read~int(xstrtou_range_sfx_#t~mem226#1.base, xstrtou_range_sfx_#t~mem226#1.offset, 1); [2025-02-08 13:31:04,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3191: assume 0 == xstrtou_range_sfx_#t~mem227#1;havoc xstrtou_range_sfx_#t~mem226#1.base, xstrtou_range_sfx_#t~mem226#1.offset;havoc xstrtou_range_sfx_#t~mem227#1; [2025-02-08 13:31:04,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3191: assume !(0 == xstrtou_range_sfx_#t~mem227#1);havoc xstrtou_range_sfx_#t~mem226#1.base, xstrtou_range_sfx_#t~mem226#1.offset;havoc xstrtou_range_sfx_#t~mem227#1; [2025-02-08 13:31:04,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927-1: assume 1 + getopt32_#t~mem162#1 >= -2147483648; [2025-02-08 13:31:04,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927-1: assume !(1 + getopt32_#t~mem162#1 >= -2147483648); [2025-02-08 13:31:04,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927: assume 1 + getopt32_#t~mem162#1 <= 2147483647;call write~int(1 + getopt32_#t~mem162#1, getopt32_#t~mem160#1.base, getopt32_#t~mem160#1.offset, 4); [2025-02-08 13:31:04,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927: assume !(1 + getopt32_#t~mem162#1 <= 2147483647); [2025-02-08 13:31:04,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3093: call __main_#t~mem204#1 := read~int(__main_~ut~0#1.base, 338 + __main_~ut~0#1.offset, 4);call write~int(__main_#t~mem204#1, __main_~#seconds~0#1.base, __main_~#seconds~0#1.offset, 8);havoc __main_#t~mem204#1;havoc __main_~return_value_ctime$3~0#1.base, __main_~return_value_ctime$3~0#1.offset;__main_~return_value_ctime$3~0#1.base, __main_~return_value_ctime$3~0#1.offset := __main_#t~nondet205#1.base, __main_#t~nondet205#1.offset;havoc __main_#t~nondet205#1.base, __main_#t~nondet205#1.offset;havoc __main_#t~ret206#1;call ULTIMATE.dealloc(__main_~#str6~0#1.base, __main_~#str6~0#1.offset);havoc __main_~#str6~0#1.base, __main_~#str6~0#1.offset;call ULTIMATE.dealloc(__main_~#name~0#1.base, __main_~#name~0#1.offset);havoc __main_~#name~0#1.base, __main_~#name~0#1.offset;call ULTIMATE.dealloc(__main_~#st~0#1.base, __main_~#st~0#1.offset);havoc __main_~#st~0#1.base, __main_~#st~0#1.offset;call ULTIMATE.dealloc(__main_~#seconds~0#1.base, __main_~#seconds~0#1.offset);havoc __main_~#seconds~0#1.base, __main_~#seconds~0#1.offset;havoc __main_~#str6~0#1.base, __main_~#str6~0#1.offset, __main_~#name~0#1.base, __main_~#name~0#1.offset, __main_~#st~0#1.base, __main_~#st~0#1.offset, __main_~#seconds~0#1.base, __main_~#seconds~0#1.offset, __main_~return_value_stat$2~0#1, __main_~return_value_ctime$3~0#1.base, __main_~return_value_ctime$3~0#1.offset;havoc __main_#t~ret206#1; [2025-02-08 13:31:04,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2994: assume idle_string_~t#1 < 86400; [2025-02-08 13:31:04,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2994: assume !(idle_string_~t#1 < 86400); [2025-02-08 13:31:04,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060-1: assume true; [2025-02-08 13:31:04,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060-1: assume !true; [2025-02-08 13:31:04,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2928: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem163#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:31:04,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2928: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:31:04,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3160: assume xstrtou_range_sfx_#t~mem216#1 - 9 <= 2147483647;xstrtou_range_sfx_~bb__isspace~0#1 := xstrtou_range_sfx_#t~mem216#1 - 9;havoc xstrtou_range_sfx_#t~mem216#1;xstrtou_range_sfx_~tmp_statement_expression$2~0#1 := (if 0 == (if 23 == (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) || (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) <= 4 then 1 else 0) then 0 else 1);xstrtou_range_sfx_~tmp_if_expr$3~1#1 := (if 0 == (if 0 != (if 0 != xstrtou_range_sfx_~tmp_statement_expression$2~0#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1);havoc xstrtou_range_sfx_~bb__isspace~0#1; [2025-02-08 13:31:04,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3160: assume !(xstrtou_range_sfx_#t~mem216#1 - 9 <= 2147483647); [2025-02-08 13:31:04,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3160-1: assume xstrtou_range_sfx_#t~mem216#1 - 9 >= -2147483648; [2025-02-08 13:31:04,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3160-1: assume !(xstrtou_range_sfx_#t~mem216#1 - 9 >= -2147483648); [2025-02-08 13:31:04,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3062: __main_#t~ret196#1.base, __main_#t~ret196#1.offset := getutent_#res#1.base, getutent_#res#1.offset;havoc getutent_#t~nondet236#1, getutent_#t~nondet237#1, getutent_#t~nondet238#1, getutent_#t~nondet239#1, getutent_#t~pre240#1, getutent_~i~1#1, getutent_#t~nondet241#1, getutent_#t~pre242#1, getutent_~i~2#1;assume { :end_inline_getutent } true;__main_~ut~0#1.base, __main_~ut~0#1.offset := __main_#t~ret196#1.base, __main_#t~ret196#1.offset;havoc __main_#t~ret196#1.base, __main_#t~ret196#1.offset; [2025-02-08 13:31:04,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996: assume true;havoc idle_string_#t~nondet179#1;call write~int(idle_string_#t~nondet179#1, idle_string_~str6#1.base, idle_string_~str6#1.offset + idle_string_#t~loopctr178#1, 8);idle_string_#t~loopctr178#1 := 1 + idle_string_#t~loopctr178#1; [2025-02-08 13:31:04,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996: assume true;havoc idle_string_#t~loopctr178#1;havoc idle_string_#t~nondet179#1;havoc idle_string_#t~ret180#1; [2025-02-08 13:31:04,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996-2: assume (if (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) < 0 && 0 != (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) % 60 then 1 + (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) / 60 else (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) / 60) >= -9223372036854775808; [2025-02-08 13:31:04,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996-2: assume !((if (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) < 0 && 0 != (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) % 60 then 1 + (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) / 60 else (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) / 60) >= -9223372036854775808); [2025-02-08 13:31:04,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2930: assume 1 == getopt32_#t~mem163#1;havoc getopt32_#t~mem163#1;call getopt32_#t~mem164#1.base, getopt32_#t~mem164#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);assume { :begin_inline_llist_add_to_end } true;llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset := getopt32_#t~mem164#1.base, getopt32_#t~mem164#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset, llist_add_to_end_#t~mem183#1.base, llist_add_to_end_#t~mem183#1.offset, llist_add_to_end_#t~ret184#1.base, llist_add_to_end_#t~ret184#1.offset, llist_add_to_end_#t~mem185#1.base, llist_add_to_end_#t~mem185#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset;llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset := llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset; [2025-02-08 13:31:04,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2930: assume !(1 == getopt32_#t~mem163#1);havoc getopt32_#t~mem163#1;call getopt32_#t~mem165#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:31:04,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996-1: assume (if (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) < 0 && 0 != (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) % 60 then 1 + (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) / 60 else (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) / 60) <= 9223372036854775807;idle_string_#t~loopctr178#1 := 0; [2025-02-08 13:31:04,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996-1: assume !((if (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) < 0 && 0 != (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) % 60 then 1 + (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) / 60 else (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then idle_string_~t#1 % 3600 - 3600 else idle_string_~t#1 % 3600) / 60) <= 9223372036854775807); [2025-02-08 13:31:04,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996-4: assume (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then 1 + idle_string_~t#1 / 3600 else idle_string_~t#1 / 3600) >= -9223372036854775808; [2025-02-08 13:31:04,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996-4: assume !((if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then 1 + idle_string_~t#1 / 3600 else idle_string_~t#1 / 3600) >= -9223372036854775808); [2025-02-08 13:31:04,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996-3: assume (if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then 1 + idle_string_~t#1 / 3600 else idle_string_~t#1 / 3600) <= 9223372036854775807; [2025-02-08 13:31:04,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996-3: assume !((if idle_string_~t#1 < 0 && 0 != idle_string_~t#1 % 3600 then 1 + idle_string_~t#1 / 3600 else idle_string_~t#1 / 3600) <= 9223372036854775807); [2025-02-08 13:31:04,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:31:04,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume !(xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:31:04,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3063: assume __main_~ut~0#1.base == 0 && __main_~ut~0#1.offset == 0; [2025-02-08 13:31:04,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3063: assume !(__main_~ut~0#1.base == 0 && __main_~ut~0#1.offset == 0);call __main_#t~mem197#1 := read~int(__main_~ut~0#1.base, 42 + __main_~ut~0#1.offset, 1); [2025-02-08 13:31:04,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3164: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 13:31:04,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~0#1;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset; [2025-02-08 13:31:04,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296); [2025-02-08 13:31:04,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3065: assume !(0 == __main_#t~mem197#1);havoc __main_#t~mem197#1; [2025-02-08 13:31:04,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3065: assume !!(0 == __main_#t~mem197#1);havoc __main_#t~mem197#1; [2025-02-08 13:31:04,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933: assume 2 == getopt32_#t~mem165#1;havoc getopt32_#t~mem165#1;havoc getopt32_~return_value_xatoi_positive$13~0#1;assume { :begin_inline_xatoi_positive } true;xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset := ~optarg~0.base, ~optarg~0.offset;havoc xatoi_positive_#res#1;havoc xatoi_positive_#t~ret209#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset := xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;havoc xatoi_positive_~return_value_xatou_range$1~0#1;assume { :begin_inline_xatou_range } true;xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1 := xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, 0, 2147483647;havoc xatou_range_#res#1;havoc xatou_range_#t~ret210#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset := xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset;xatou_range_~lower#1 := xatou_range_#in~lower#1;xatou_range_~upper#1 := xatou_range_#in~upper#1;havoc xatou_range_~return_value_xstrtou_range_sfx$1~0#1;assume { :begin_inline_xstrtou_range_sfx } true;xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset := xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, 10, xatou_range_~lower#1, xatou_range_~upper#1, 0, 0;havoc xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem214#1, xstrtou_range_sfx_#t~mem215#1, xstrtou_range_sfx_#t~mem216#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem217#1, xstrtou_range_sfx_#t~ret218#1, xstrtou_range_sfx_#t~mem219#1.base, xstrtou_range_sfx_#t~mem219#1.offset, xstrtou_range_sfx_#t~mem220#1, xstrtou_range_sfx_#t~mem221#1, xstrtou_range_sfx_#t~mem222#1.base, xstrtou_range_sfx_#t~mem222#1.offset, xstrtou_range_sfx_#t~nondet223#1, xstrtou_range_sfx_#t~mem224#1, xstrtou_range_sfx_#t~mem225#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem226#1.base, xstrtou_range_sfx_#t~mem226#1.offset, xstrtou_range_sfx_#t~mem227#1, xstrtou_range_sfx_#t~varargs228#1.base, xstrtou_range_sfx_#t~varargs228#1.offset, xstrtou_range_sfx_#t~varargs229#1.base, xstrtou_range_sfx_#t~varargs229#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~0#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~3#1, xstrtou_range_sfx_~tmp_if_expr$3~1#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset := xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset;xstrtou_range_sfx_~base#1 := xstrtou_range_sfx_#in~base#1;xstrtou_range_sfx_~lower#1 := xstrtou_range_sfx_#in~lower#1;xstrtou_range_sfx_~upper#1 := xstrtou_range_sfx_#in~upper#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;havoc xstrtou_range_sfx_~r~0#1;havoc xstrtou_range_sfx_~old_errno~0#1;call xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset := #Ultimate.allocOnStack(8);havoc xstrtou_range_sfx_~tmp_if_expr$1~3#1;call xstrtou_range_sfx_#t~mem214#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:31:04,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933: assume !(2 == getopt32_#t~mem165#1);havoc getopt32_#t~mem165#1;call getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3165: assume 0 == xstrtou_range_sfx_~tmp_if_expr$3~1#1 % 256;call xstrtou_range_sfx_#t~mem217#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);xstrtou_range_sfx_~old_errno~0#1 := xstrtou_range_sfx_#t~mem217#1;havoc xstrtou_range_sfx_#t~mem217#1;call write~int(0, ~bb_errno~0.base, ~bb_errno~0.offset, 4);assume { :begin_inline_bb_strtoui } true;bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1 := xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~base#1;havoc bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet38#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset := bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset;bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset := bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset;bb_strtoui_~b#1 := bb_strtoui_#in~b#1;havoc bb_strtoui_~v~0#1;bb_strtoui_~v~0#1 := bb_strtoui_#t~nondet38#1;havoc bb_strtoui_#t~nondet38#1; [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3165: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~1#1 % 256); [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3000: havoc idle_string_#t~strcpy~res181#1.base, idle_string_#t~strcpy~res181#1.offset;havoc idle_string_#t~nondet177#1, idle_string_#t~loopctr178#1, idle_string_#t~nondet179#1, idle_string_#t~ret180#1, idle_string_#t~strcpy~res181#1.base, idle_string_#t~strcpy~res181#1.offset, idle_string_~str6#1.base, idle_string_~str6#1.offset, idle_string_~t#1, idle_string_~return_value_time$1~0#1;havoc idle_string_#in~str6#1.base, idle_string_#in~str6#1.offset, idle_string_#in~t#1;assume { :end_inline_idle_string } true; [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3000-1: SUMMARY for call idle_string_#t~strcpy~res181#1.base, idle_string_#t~strcpy~res181#1.offset := #Ultimate.C_strcpy(idle_string_~str6#1.base, idle_string_~str6#1.offset, 7, 0); srcloc: null [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3067: assume !(0 == __main_~opt~0#1 % 2 % 4294967296);__main_~tmp_if_expr$4~0#1 := 1; [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3067: assume !!(0 == __main_~opt~0#1 % 2 % 4294967296);call __main_#t~mem198#1 := read~int(__main_~ut~0#1.base, __main_~ut~0#1.offset, 2);__main_~tmp_if_expr$4~0#1 := (if 0 == (if 0 != (if 7 == __main_#t~mem198#1 then 1 else 0) then 1 else 0) then 0 else 1);havoc __main_#t~mem198#1; [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2936: getopt32_#t~ret166#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret209#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;havoc xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;assume { :end_inline_xatoi_positive } true;assume -2147483648 <= getopt32_#t~ret166#1 && getopt32_#t~ret166#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret166#1;havoc getopt32_#t~ret166#1;call getopt32_#t~mem167#1.base, getopt32_#t~mem167#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~int(getopt32_~return_value_xatoi_positive$13~0#1, getopt32_#t~mem167#1.base, getopt32_#t~mem167#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem167#1.base, getopt32_#t~mem167#1.offset; [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3202: havoc xstrtou_range_sfx_#t~varargs228#1.base, xstrtou_range_sfx_#t~varargs228#1.offset; [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3202-2: call xstrtou_range_sfx_#t~varargs228#1.base, xstrtou_range_sfx_#t~varargs228#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs228#1.base, xstrtou_range_sfx_#t~varargs228#1.offset, 8);call write~int(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs228#1.base, 8 + xstrtou_range_sfx_#t~varargs228#1.offset, 8);call write~int(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs228#1.base, 16 + xstrtou_range_sfx_#t~varargs228#1.offset, 8); [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3202-1: SUMMARY for call bb_error_msg_and_die(14, 0, xstrtou_range_sfx_#t~varargs228#1.base, xstrtou_range_sfx_#t~varargs228#1.offset); srcloc: null [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169: xstrtou_range_sfx_#t~ret218#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet38#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;havoc bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1;assume { :end_inline_bb_strtoui } true;xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_#t~ret218#1;havoc xstrtou_range_sfx_#t~ret218#1;call xstrtou_range_sfx_#t~mem219#1.base, xstrtou_range_sfx_#t~mem219#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3004: assume true;call llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset := read~$Pointer$(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3004: assume !true; [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3004-2: assume !!(llist_add_to_end_#t~mem182#1.base == 0 && llist_add_to_end_#t~mem182#1.offset == 0);havoc llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset; [2025-02-08 13:31:04,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3004-2: assume !(llist_add_to_end_#t~mem182#1.base == 0 && llist_add_to_end_#t~mem182#1.offset == 0);havoc llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset;call llist_add_to_end_#t~mem183#1.base, llist_add_to_end_#t~mem183#1.offset := read~$Pointer$(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#t~mem183#1.base, llist_add_to_end_#t~mem183#1.offset;havoc llist_add_to_end_#t~mem183#1.base, llist_add_to_end_#t~mem183#1.offset; [2025-02-08 13:31:04,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem219#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem219#1.offset);havoc xstrtou_range_sfx_#t~mem219#1.base, xstrtou_range_sfx_#t~mem219#1.offset;call xstrtou_range_sfx_#t~mem220#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:31:04,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem219#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem219#1.offset);havoc xstrtou_range_sfx_#t~mem219#1.base, xstrtou_range_sfx_#t~mem219#1.offset; [2025-02-08 13:31:04,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2477: assume bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295;call write~int(34, ~bb_errno~0.base, ~bb_errno~0.offset, 4);bb_strtoui_#res#1 := 4294967295; [2025-02-08 13:31:04,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2477: assume !(bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295);bb_strtoui_#res#1 := bb_strtoui_~v~0#1; [2025-02-08 13:31:04,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3006: havoc llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;assume { :begin_inline_xzalloc } true;xzalloc_#in~size#1 := 16;havoc xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret230#1.base, xzalloc_#t~ret230#1.offset, xzalloc_#t~memset~res231#1.base, xzalloc_#t~memset~res231#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;xzalloc_~size#1 := xzalloc_#in~size#1;havoc xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:31:04,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3039: assume 0 != stat_#t~nondet190#1;havoc stat_#t~nondet190#1;stat_#res#1 := -1; [2025-02-08 13:31:04,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3039: assume !(0 != stat_#t~nondet190#1);havoc stat_#t~nondet190#1;call stat_#t~mem191#1 := read~int(stat_~__buf#1.base, 72 + stat_~__buf#1.offset, 8); [2025-02-08 13:31:04,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2940: assume !(getopt32_#t~mem168#1.base == 0 && getopt32_#t~mem168#1.offset == 0);havoc getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset;call getopt32_#t~mem169#1.base, getopt32_#t~mem169#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~$Pointer$(~optarg~0.base, ~optarg~0.offset, getopt32_#t~mem169#1.base, getopt32_#t~mem169#1.offset, 8); [2025-02-08 13:31:04,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2940: assume !!(getopt32_#t~mem168#1.base == 0 && getopt32_#t~mem168#1.offset == 0);havoc getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset; [2025-02-08 13:31:04,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3172: assume 0 == xstrtou_range_sfx_#t~mem220#1;havoc xstrtou_range_sfx_#t~mem220#1;call write~int(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:31:04,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3172: assume !(0 == xstrtou_range_sfx_#t~mem220#1);havoc xstrtou_range_sfx_#t~mem220#1; [2025-02-08 13:31:04,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3073: assume !(0 == __main_~tmp_if_expr$4~0#1 % 256); [2025-02-08 13:31:04,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3073: assume !!(0 == __main_~tmp_if_expr$4~0#1 % 256); [2025-02-08 13:31:04,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3007: llist_add_to_end_#t~ret184#1.base, llist_add_to_end_#t~ret184#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret230#1.base, xzalloc_#t~ret230#1.offset, xzalloc_#t~memset~res231#1.base, xzalloc_#t~memset~res231#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;havoc xzalloc_#in~size#1;assume { :end_inline_xzalloc } true;llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset := llist_add_to_end_#t~ret184#1.base, llist_add_to_end_#t~ret184#1.offset;havoc llist_add_to_end_#t~ret184#1.base, llist_add_to_end_#t~ret184#1.offset;call write~$Pointer$(llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call llist_add_to_end_#t~mem185#1.base, llist_add_to_end_#t~mem185#1.offset := read~$Pointer$(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$(llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_#t~mem185#1.base, 8 + llist_add_to_end_#t~mem185#1.offset, 8);havoc llist_add_to_end_#t~mem185#1.base, llist_add_to_end_#t~mem185#1.offset;havoc llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset, llist_add_to_end_#t~mem183#1.base, llist_add_to_end_#t~mem183#1.offset, llist_add_to_end_#t~ret184#1.base, llist_add_to_end_#t~ret184#1.offset, llist_add_to_end_#t~mem185#1.base, llist_add_to_end_#t~mem185#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;havoc llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset;assume { :end_inline_llist_add_to_end } true; [2025-02-08 13:31:04,619 INFO L? ?]: Removed 376 outVars from TransFormulas that were not future-live. [2025-02-08 13:31:04,619 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:31:04,664 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:31:04,664 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:31:04,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:31:04 BoogieIcfgContainer [2025-02-08 13:31:04,665 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:31:04,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:31:04,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:31:04,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:31:04,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:30:58" (1/3) ... [2025-02-08 13:31:04,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78eb769e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:31:04, skipping insertion in model container [2025-02-08 13:31:04,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:01" (2/3) ... [2025-02-08 13:31:04,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78eb769e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:31:04, skipping insertion in model container [2025-02-08 13:31:04,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:31:04" (3/3) ... [2025-02-08 13:31:04,676 INFO L128 eAbstractionObserver]: Analyzing ICFG who-2.i [2025-02-08 13:31:04,691 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:31:04,694 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG who-2.i that has 6 procedures, 379 locations, 1 initial locations, 33 loop locations, and 70 error locations. [2025-02-08 13:31:04,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:31:04,773 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;@537fbce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:31:04,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-02-08 13:31:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 379 states, 283 states have (on average 1.7243816254416962) internal successors, (488), 362 states have internal predecessors, (488), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:31:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:31:04,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:04,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:31:04,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:04,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash 857920, now seen corresponding path program 1 times [2025-02-08 13:31:04,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:04,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557852278] [2025-02-08 13:31:04,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:04,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:05,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:31:05,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:31:05,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:05,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:05,719 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:05,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557852278] [2025-02-08 13:31:05,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557852278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:05,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:05,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:31:05,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12062006] [2025-02-08 13:31:05,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:05,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:05,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:05,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:05,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:05,751 INFO L87 Difference]: Start difference. First operand has 379 states, 283 states have (on average 1.7243816254416962) internal successors, (488), 362 states have internal predecessors, (488), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:05,865 INFO L93 Difference]: Finished difference Result 586 states and 798 transitions. [2025-02-08 13:31:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:05,867 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:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:05,878 INFO L225 Difference]: With dead ends: 586 [2025-02-08 13:31:05,878 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 13:31:05,883 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:05,888 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 1 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:05,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 502 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 13:31:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-08 13:31:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 181 states have internal predecessors, (227), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2025-02-08 13:31:05,951 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 3 [2025-02-08 13:31:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:05,955 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2025-02-08 13:31:05,955 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:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2025-02-08 13:31:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:31:05,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:05,955 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:31:05,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:31:05,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:05,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:05,957 INFO L85 PathProgramCache]: Analyzing trace with hash -210715523, now seen corresponding path program 1 times [2025-02-08 13:31:05,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:05,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804374380] [2025-02-08 13:31:05,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:05,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:06,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:31:06,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:31:06,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:06,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:06,360 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:06,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:06,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804374380] [2025-02-08 13:31:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804374380] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46529568] [2025-02-08 13:31:06,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:06,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:06,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:06,365 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:06,366 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:06,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:31:06,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:31:06,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:06,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:06,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:06,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:06,921 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:06,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:06,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46529568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:06,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:06,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:31:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754672111] [2025-02-08 13:31:06,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:06,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:31:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:06,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:31:06,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:06,925 INFO L87 Difference]: Start difference. First operand 193 states and 241 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:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:07,709 INFO L93 Difference]: Finished difference Result 193 states and 241 transitions. [2025-02-08 13:31:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:31:07,711 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:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:07,713 INFO L225 Difference]: With dead ends: 193 [2025-02-08 13:31:07,714 INFO L226 Difference]: Without dead ends: 192 [2025-02-08 13:31:07,714 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:07,715 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:07,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 13:31:07,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-08 13:31:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-02-08 13:31:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 148 states have (on average 1.527027027027027) internal successors, (226), 180 states have internal predecessors, (226), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 240 transitions. [2025-02-08 13:31:07,729 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 240 transitions. Word has length 6 [2025-02-08 13:31:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:07,729 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 240 transitions. [2025-02-08 13:31:07,729 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:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 240 transitions. [2025-02-08 13:31:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:31:07,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:07,729 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:31:07,741 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:07,930 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:07,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:07,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:07,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2057754178, now seen corresponding path program 1 times [2025-02-08 13:31:07,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:07,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635455153] [2025-02-08 13:31:07,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:07,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:08,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:31:08,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:31:08,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:08,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:08,263 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:08,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:08,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635455153] [2025-02-08 13:31:08,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635455153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:08,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:08,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770944352] [2025-02-08 13:31:08,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:08,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:08,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:08,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:08,266 INFO L87 Difference]: Start difference. First operand 192 states and 240 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:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:08,325 INFO L93 Difference]: Finished difference Result 192 states and 240 transitions. [2025-02-08 13:31:08,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:08,325 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:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:08,326 INFO L225 Difference]: With dead ends: 192 [2025-02-08 13:31:08,326 INFO L226 Difference]: Without dead ends: 191 [2025-02-08 13:31:08,327 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:08,327 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:08,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 456 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-08 13:31:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2025-02-08 13:31:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 146 states have (on average 1.5273972602739727) internal successors, (223), 177 states have internal predecessors, (223), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 237 transitions. [2025-02-08 13:31:08,345 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 237 transitions. Word has length 7 [2025-02-08 13:31:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:08,346 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 237 transitions. [2025-02-08 13:31:08,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:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 237 transitions. [2025-02-08 13:31:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:31:08,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:08,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:08,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:31:08,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:08,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2114187933, now seen corresponding path program 1 times [2025-02-08 13:31:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:08,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248672135] [2025-02-08 13:31:08,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:08,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:31:08,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:31:08,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:08,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:08,771 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:08,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:08,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248672135] [2025-02-08 13:31:08,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248672135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:08,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017009190] [2025-02-08 13:31:08,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:08,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:08,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:08,774 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:08,776 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:09,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:31:09,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:31:09,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:09,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:09,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:31:09,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:09,297 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:09,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017009190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:31:09,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859287019] [2025-02-08 13:31:09,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:09,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:09,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:09,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:09,299 INFO L87 Difference]: Start difference. First operand 189 states and 237 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:10,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:10,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:10,661 INFO L93 Difference]: Finished difference Result 189 states and 237 transitions. [2025-02-08 13:31:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:10,661 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:10,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:10,662 INFO L225 Difference]: With dead ends: 189 [2025-02-08 13:31:10,662 INFO L226 Difference]: Without dead ends: 187 [2025-02-08 13:31:10,663 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:10,663 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 187 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:10,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 259 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 13:31:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-08 13:31:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-08 13:31:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 146 states have (on average 1.5136986301369864) internal successors, (221), 175 states have internal predecessors, (221), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 235 transitions. [2025-02-08 13:31:10,676 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 235 transitions. Word has length 11 [2025-02-08 13:31:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:10,677 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 235 transitions. [2025-02-08 13:31:10,678 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:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 235 transitions. [2025-02-08 13:31:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:31:10,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:10,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:10,689 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:10,881 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:10,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:10,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:10,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1115315690, now seen corresponding path program 1 times [2025-02-08 13:31:10,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:10,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32774802] [2025-02-08 13:31:10,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:11,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:31:11,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:31:11,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:11,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:11,264 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:11,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:11,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32774802] [2025-02-08 13:31:11,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32774802] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:11,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934809771] [2025-02-08 13:31:11,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:11,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:11,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:11,267 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:11,270 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:11,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:31:11,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:31:11,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:11,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:11,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:11,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:11,767 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:11,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:11,810 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:11,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934809771] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:11,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:11,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:31:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555178] [2025-02-08 13:31:11,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:11,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:31:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:11,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:31:11,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:11,812 INFO L87 Difference]: Start difference. First operand 187 states and 235 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:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:11,885 INFO L93 Difference]: Finished difference Result 378 states and 476 transitions. [2025-02-08 13:31:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:11,886 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:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:11,887 INFO L225 Difference]: With dead ends: 378 [2025-02-08 13:31:11,887 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 13:31:11,888 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:11,888 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 4 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:11,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 902 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 13:31:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-08 13:31:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 155 states have (on average 1.4838709677419355) internal successors, (230), 184 states have internal predecessors, (230), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 244 transitions. [2025-02-08 13:31:11,897 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 244 transitions. Word has length 12 [2025-02-08 13:31:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:11,897 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 244 transitions. [2025-02-08 13:31:11,897 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:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 244 transitions. [2025-02-08 13:31:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:31:11,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:11,898 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:11,909 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:12,102 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:12,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:12,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash -231220135, now seen corresponding path program 2 times [2025-02-08 13:31:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:12,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956369502] [2025-02-08 13:31:12,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:12,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:12,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:31:12,324 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:12,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:31:12,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:12,653 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:12,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:12,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956369502] [2025-02-08 13:31:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956369502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:12,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:12,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:31:12,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326674484] [2025-02-08 13:31:12,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:12,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:31:12,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:12,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:31:12,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:12,656 INFO L87 Difference]: Start difference. First operand 196 states and 244 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:13,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:14,128 INFO L93 Difference]: Finished difference Result 196 states and 244 transitions. [2025-02-08 13:31:14,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:31:14,129 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:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:14,130 INFO L225 Difference]: With dead ends: 196 [2025-02-08 13:31:14,130 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 13:31:14,131 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:14,131 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 186 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:14,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 686 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 13:31:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 13:31:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-08 13:31:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 182 states have internal predecessors, (228), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 242 transitions. [2025-02-08 13:31:14,147 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 242 transitions. Word has length 21 [2025-02-08 13:31:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:14,147 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 242 transitions. [2025-02-08 13:31:14,147 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:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 242 transitions. [2025-02-08 13:31:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:31:14,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:14,148 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:14,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:31:14,148 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:14,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash 120466459, now seen corresponding path program 1 times [2025-02-08 13:31:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:14,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745401997] [2025-02-08 13:31:14,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:14,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:14,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:31:14,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:31:14,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:14,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:14,507 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:14,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:14,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745401997] [2025-02-08 13:31:14,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745401997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:14,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:14,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:14,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752526249] [2025-02-08 13:31:14,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:14,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:14,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:14,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:14,509 INFO L87 Difference]: Start difference. First operand 194 states and 242 transitions. Second operand has 3 states, 2 states have (on average 7.5) 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:15,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:15,854 INFO L93 Difference]: Finished difference Result 372 states and 469 transitions. [2025-02-08 13:31:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:15,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) 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:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:15,856 INFO L225 Difference]: With dead ends: 372 [2025-02-08 13:31:15,859 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 13:31:15,860 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:15,861 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 1 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:15,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 13:31:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 13:31:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-02-08 13:31:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 185 states have internal predecessors, (231), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 245 transitions. [2025-02-08 13:31:15,873 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 245 transitions. Word has length 26 [2025-02-08 13:31:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:15,873 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 245 transitions. [2025-02-08 13:31:15,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) 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:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 245 transitions. [2025-02-08 13:31:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 13:31:15,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:15,875 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:15,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:31:15,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:15,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash -560845901, now seen corresponding path program 1 times [2025-02-08 13:31:15,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:15,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570620213] [2025-02-08 13:31:15,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:15,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:16,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 13:31:16,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 13:31:16,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:16,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:16,212 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:16,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:16,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570620213] [2025-02-08 13:31:16,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570620213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:16,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:16,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:16,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032279392] [2025-02-08 13:31:16,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:16,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:16,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:16,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:16,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:16,217 INFO L87 Difference]: Start difference. First operand 197 states and 245 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:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:16,280 INFO L93 Difference]: Finished difference Result 314 states and 400 transitions. [2025-02-08 13:31:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:16,280 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 27 [2025-02-08 13:31:16,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:16,282 INFO L225 Difference]: With dead ends: 314 [2025-02-08 13:31:16,282 INFO L226 Difference]: Without dead ends: 312 [2025-02-08 13:31:16,282 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:16,283 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 140 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:16,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-08 13:31:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 201. [2025-02-08 13:31:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.4567901234567902) internal successors, (236), 189 states have internal predecessors, (236), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 250 transitions. [2025-02-08 13:31:16,298 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 250 transitions. Word has length 27 [2025-02-08 13:31:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:16,299 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 250 transitions. [2025-02-08 13:31:16,299 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:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2025-02-08 13:31:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:31:16,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:16,300 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:16,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:31:16,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:16,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1775601742, now seen corresponding path program 1 times [2025-02-08 13:31:16,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:16,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894108740] [2025-02-08 13:31:16,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:16,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:16,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:16,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:16,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:16,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:16,690 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:16,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:16,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894108740] [2025-02-08 13:31:16,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894108740] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:16,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024350251] [2025-02-08 13:31:16,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:16,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:16,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:16,693 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:16,696 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:17,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:17,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:17,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:17,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:17,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:31:17,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:17,368 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:17,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:17,569 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:17,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024350251] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:17,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:17,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:31:17,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437080769] [2025-02-08 13:31:17,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:17,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:31:17,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:17,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:31:17,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:31:17,571 INFO L87 Difference]: Start difference. First operand 201 states and 250 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:18,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:19,847 INFO L93 Difference]: Finished difference Result 405 states and 509 transitions. [2025-02-08 13:31:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:31:19,848 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:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:19,849 INFO L225 Difference]: With dead ends: 405 [2025-02-08 13:31:19,849 INFO L226 Difference]: Without dead ends: 218 [2025-02-08 13:31:19,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:31:19,850 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 5 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:19,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1087 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 13:31:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-08 13:31:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-08 13:31:19,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 180 states have (on average 1.4055555555555554) internal successors, (253), 206 states have internal predecessors, (253), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2025-02-08 13:31:19,865 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 29 [2025-02-08 13:31:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:19,866 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2025-02-08 13:31:19,866 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:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2025-02-08 13:31:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:31:19,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:19,868 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] [2025-02-08 13:31:19,880 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:20,068 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,SelfDestructingSolverStorable8 [2025-02-08 13:31:20,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:20,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:20,075 INFO L85 PathProgramCache]: Analyzing trace with hash -749287502, now seen corresponding path program 1 times [2025-02-08 13:31:20,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:20,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51383637] [2025-02-08 13:31:20,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:20,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:20,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:31:20,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:31:20,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:20,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:31:20,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:20,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51383637] [2025-02-08 13:31:20,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51383637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:20,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:20,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:20,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634599424] [2025-02-08 13:31:20,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:20,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:20,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:20,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:20,395 INFO L87 Difference]: Start difference. First operand 218 states and 267 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:21,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:21,662 INFO L93 Difference]: Finished difference Result 230 states and 281 transitions. [2025-02-08 13:31:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:21,663 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 47 [2025-02-08 13:31:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:21,665 INFO L225 Difference]: With dead ends: 230 [2025-02-08 13:31:21,665 INFO L226 Difference]: Without dead ends: 228 [2025-02-08 13:31:21,665 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:21,667 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 2 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:21,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 440 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 13:31:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-08 13:31:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2025-02-08 13:31:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 189 states have (on average 1.402116402116402) internal successors, (265), 215 states have internal predecessors, (265), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 279 transitions. [2025-02-08 13:31:21,679 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 279 transitions. Word has length 47 [2025-02-08 13:31:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:21,679 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 279 transitions. [2025-02-08 13:31:21,679 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:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 279 transitions. [2025-02-08 13:31:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:31:21,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:21,683 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:21,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:31:21,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:21,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1753070339, now seen corresponding path program 1 times [2025-02-08 13:31:21,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:21,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374359918] [2025-02-08 13:31:21,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:21,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:21,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:31:21,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:31:21,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:21,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:21,996 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:21,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:21,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374359918] [2025-02-08 13:31:21,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374359918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:21,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:21,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:21,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673808239] [2025-02-08 13:31:21,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:21,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:21,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:21,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:21,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:21,999 INFO L87 Difference]: Start difference. First operand 227 states and 279 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:23,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:23,011 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2025-02-08 13:31:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:23,011 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:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:23,014 INFO L225 Difference]: With dead ends: 227 [2025-02-08 13:31:23,014 INFO L226 Difference]: Without dead ends: 226 [2025-02-08 13:31:23,014 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:23,015 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:23,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 13:31:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-08 13:31:23,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2025-02-08 13:31:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 185 states have (on average 1.4) internal successors, (259), 210 states have internal predecessors, (259), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2025-02-08 13:31:23,028 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 48 [2025-02-08 13:31:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:23,028 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2025-02-08 13:31:23,028 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:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2025-02-08 13:31:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 13:31:23,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:23,030 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:23,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:31:23,030 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:23,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1378030103, now seen corresponding path program 1 times [2025-02-08 13:31:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:23,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827221620] [2025-02-08 13:31:23,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:23,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:23,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:31:23,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:31:23,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:23,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:23,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827221620] [2025-02-08 13:31:23,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827221620] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188015181] [2025-02-08 13:31:23,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:23,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:23,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:23,412 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:23,416 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:23,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:31:24,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:31:24,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:24,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:24,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:24,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:24,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:24,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188015181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:24,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:24,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:31:24,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83988557] [2025-02-08 13:31:24,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:24,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:31:24,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:24,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:31:24,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:24,318 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:24,394 INFO L93 Difference]: Finished difference Result 333 states and 421 transitions. [2025-02-08 13:31:24,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:31:24,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 49 [2025-02-08 13:31:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:24,398 INFO L225 Difference]: With dead ends: 333 [2025-02-08 13:31:24,398 INFO L226 Difference]: Without dead ends: 332 [2025-02-08 13:31:24,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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:24,399 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 279 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:24,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 585 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:24,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-08 13:31:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 221. [2025-02-08 13:31:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 185 states have (on average 1.3945945945945946) internal successors, (258), 209 states have internal predecessors, (258), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 272 transitions. [2025-02-08 13:31:24,415 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 272 transitions. Word has length 49 [2025-02-08 13:31:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:24,416 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 272 transitions. [2025-02-08 13:31:24,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 272 transitions. [2025-02-08 13:31:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 13:31:24,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:24,419 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:24,433 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:24,619 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,SelfDestructingSolverStorable11 [2025-02-08 13:31:24,620 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:24,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:24,620 INFO L85 PathProgramCache]: Analyzing trace with hash -230738998, now seen corresponding path program 1 times [2025-02-08 13:31:24,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:24,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085629138] [2025-02-08 13:31:24,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:24,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:24,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:31:24,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:31:24,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:24,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085629138] [2025-02-08 13:31:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085629138] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470104937] [2025-02-08 13:31:24,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:24,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:24,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:24,992 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:24,994 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:25,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:31:25,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:31:25,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:25,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:25,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:25,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:25,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:31:25,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470104937] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:25,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:25,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:31:25,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220120363] [2025-02-08 13:31:25,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:25,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:31:25,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:25,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:31:25,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:25,867 INFO L87 Difference]: Start difference. First operand 221 states and 272 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) 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:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:25,999 INFO L93 Difference]: Finished difference Result 678 states and 882 transitions. [2025-02-08 13:31:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) 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 50 [2025-02-08 13:31:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:26,003 INFO L225 Difference]: With dead ends: 678 [2025-02-08 13:31:26,003 INFO L226 Difference]: Without dead ends: 677 [2025-02-08 13:31:26,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 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:26,004 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 699 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:26,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1296 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-02-08 13:31:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 233. [2025-02-08 13:31:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 197 states have (on average 1.385786802030457) internal successors, (273), 221 states have internal predecessors, (273), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 287 transitions. [2025-02-08 13:31:26,019 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 287 transitions. Word has length 50 [2025-02-08 13:31:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:26,020 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 287 transitions. [2025-02-08 13:31:26,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) 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:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 287 transitions. [2025-02-08 13:31:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:31:26,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:26,022 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:26,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 13:31:26,222 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,SelfDestructingSolverStorable12 [2025-02-08 13:31:26,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:26,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1434083059, now seen corresponding path program 1 times [2025-02-08 13:31:26,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:26,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191563998] [2025-02-08 13:31:26,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:26,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:31:26,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:31:26,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:26,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:31:26,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191563998] [2025-02-08 13:31:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191563998] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492952919] [2025-02-08 13:31:26,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:26,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:26,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:26,758 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:26,760 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:27,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:31:27,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:31:27,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:27,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:27,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 1542 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:27,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:31:27,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:31:27,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492952919] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:27,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:27,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:31:27,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788346086] [2025-02-08 13:31:27,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:27,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:31:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:27,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:31:27,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:27,626 INFO L87 Difference]: Start difference. First operand 233 states and 287 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:29,579 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2025-02-08 13:31:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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) Word has length 54 [2025-02-08 13:31:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:29,581 INFO L225 Difference]: With dead ends: 442 [2025-02-08 13:31:29,582 INFO L226 Difference]: Without dead ends: 251 [2025-02-08 13:31:29,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 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:29,583 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 4 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:29,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 660 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 13:31:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-08 13:31:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-02-08 13:31:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 215 states have (on average 1.3534883720930233) internal successors, (291), 239 states have internal predecessors, (291), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 305 transitions. [2025-02-08 13:31:29,593 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 305 transitions. Word has length 54 [2025-02-08 13:31:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:29,594 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 305 transitions. [2025-02-08 13:31:29,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 305 transitions. [2025-02-08 13:31:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 13:31:29,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:29,595 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, 1, 1, 1, 1] [2025-02-08 13:31:29,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 13:31:29,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:29,796 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:29,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1666717260, now seen corresponding path program 1 times [2025-02-08 13:31:29,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:29,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552092982] [2025-02-08 13:31:29,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:29,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:29,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 13:31:29,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 13:31:29,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:29,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:30,146 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:30,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:30,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552092982] [2025-02-08 13:31:30,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552092982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:30,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:30,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:30,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248927716] [2025-02-08 13:31:30,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:30,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:30,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:30,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:30,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:30,149 INFO L87 Difference]: Start difference. First operand 251 states and 305 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:31:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:30,265 INFO L93 Difference]: Finished difference Result 496 states and 630 transitions. [2025-02-08 13:31:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:30,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-02-08 13:31:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:30,269 INFO L225 Difference]: With dead ends: 496 [2025-02-08 13:31:30,270 INFO L226 Difference]: Without dead ends: 344 [2025-02-08 13:31:30,270 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:30,272 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 113 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:30,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 410 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-08 13:31:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 293. [2025-02-08 13:31:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 256 states have (on average 1.3515625) internal successors, (346), 280 states have internal predecessors, (346), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 362 transitions. [2025-02-08 13:31:30,285 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 362 transitions. Word has length 59 [2025-02-08 13:31:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:30,286 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 362 transitions. [2025-02-08 13:31:30,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:31:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 362 transitions. [2025-02-08 13:31:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 13:31:30,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:30,287 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, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:30,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 13:31:30,287 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:30,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:30,287 INFO L85 PathProgramCache]: Analyzing trace with hash -307490710, now seen corresponding path program 1 times [2025-02-08 13:31:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:30,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662124452] [2025-02-08 13:31:30,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:30,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:30,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 13:31:30,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 13:31:30,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:30,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:30,566 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:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:30,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662124452] [2025-02-08 13:31:30,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662124452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:30,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:30,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010946302] [2025-02-08 13:31:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:30,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:30,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:30,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:30,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:30,568 INFO L87 Difference]: Start difference. First operand 293 states and 362 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:30,606 INFO L93 Difference]: Finished difference Result 295 states and 362 transitions. [2025-02-08 13:31:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:30,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2025-02-08 13:31:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:30,608 INFO L225 Difference]: With dead ends: 295 [2025-02-08 13:31:30,609 INFO L226 Difference]: Without dead ends: 293 [2025-02-08 13:31:30,609 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:30,609 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:30,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-08 13:31:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-02-08 13:31:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 256 states have (on average 1.34375) internal successors, (344), 280 states have internal predecessors, (344), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 360 transitions. [2025-02-08 13:31:30,626 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 360 transitions. Word has length 61 [2025-02-08 13:31:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:30,627 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 360 transitions. [2025-02-08 13:31:30,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 360 transitions. [2025-02-08 13:31:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 13:31:30,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:30,628 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:30,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 13:31:30,628 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:30,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:30,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1523785726, now seen corresponding path program 2 times [2025-02-08 13:31:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:30,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168367717] [2025-02-08 13:31:30,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:30,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-08 13:31:30,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 62 statements. [2025-02-08 13:31:30,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:31:30,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:31:31,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:31,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168367717] [2025-02-08 13:31:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168367717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:31,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:31,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:31:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377446918] [2025-02-08 13:31:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:31,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:31:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:31,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:31:31,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:31,123 INFO L87 Difference]: Start difference. First operand 293 states and 360 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:32,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:33,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:33,690 INFO L93 Difference]: Finished difference Result 515 states and 643 transitions. [2025-02-08 13:31:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:33,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 62 [2025-02-08 13:31:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:33,696 INFO L225 Difference]: With dead ends: 515 [2025-02-08 13:31:33,696 INFO L226 Difference]: Without dead ends: 293 [2025-02-08 13:31:33,696 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:33,697 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 187 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:33,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 873 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-08 13:31:33,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-08 13:31:33,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-02-08 13:31:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 256 states have (on average 1.33984375) internal successors, (343), 280 states have internal predecessors, (343), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 359 transitions. [2025-02-08 13:31:33,728 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 359 transitions. Word has length 62 [2025-02-08 13:31:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:33,729 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 359 transitions. [2025-02-08 13:31:33,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 359 transitions. [2025-02-08 13:31:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 13:31:33,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:33,730 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:33,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:31:33,734 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:33,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1010988957, now seen corresponding path program 2 times [2025-02-08 13:31:33,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:33,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70926018] [2025-02-08 13:31:33,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:33,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:33,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-02-08 13:31:34,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 13:31:34,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:31:34,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-08 13:31:34,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:34,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70926018] [2025-02-08 13:31:34,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70926018] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:34,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265717678] [2025-02-08 13:31:34,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:34,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:34,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:34,365 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:34,366 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:34,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-02-08 13:31:38,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 13:31:38,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:31:38,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:38,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1680 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:31:38,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-08 13:31:38,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-08 13:31:38,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265717678] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:38,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:38,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-08 13:31:38,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366389479] [2025-02-08 13:31:38,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:38,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:31:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:38,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:31:38,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:31:38,523 INFO L87 Difference]: Start difference. First operand 293 states and 359 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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:40,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:42,199 INFO L93 Difference]: Finished difference Result 570 states and 712 transitions. [2025-02-08 13:31:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 13:31:42,201 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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 72 [2025-02-08 13:31:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:42,203 INFO L225 Difference]: With dead ends: 570 [2025-02-08 13:31:42,206 INFO L226 Difference]: Without dead ends: 328 [2025-02-08 13:31:42,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 13:31:42,210 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 9 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:42,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 859 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-08 13:31:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-08 13:31:42,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-02-08 13:31:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 292 states have (on average 1.2945205479452055) internal successors, (378), 315 states have internal predecessors, (378), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 394 transitions. [2025-02-08 13:31:42,229 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 394 transitions. Word has length 72 [2025-02-08 13:31:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:42,229 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 394 transitions. [2025-02-08 13:31:42,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 394 transitions. [2025-02-08 13:31:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 13:31:42,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:42,230 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:42,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 13:31:42,431 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,SelfDestructingSolverStorable17 [2025-02-08 13:31:42,436 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:42,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1145173978, now seen corresponding path program 1 times [2025-02-08 13:31:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:42,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941317480] [2025-02-08 13:31:42,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:42,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:42,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 13:31:42,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 13:31:42,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:42,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:31:43,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:43,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941317480] [2025-02-08 13:31:43,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941317480] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:43,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339227976] [2025-02-08 13:31:43,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:43,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:43,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:43,287 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:43,291 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:44,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 13:31:44,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 13:31:44,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:44,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:44,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 1803 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:31:44,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:31:44,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:31:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339227976] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:44,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-08 13:31:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765582567] [2025-02-08 13:31:44,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:44,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:31:44,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:44,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:31:44,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:31:44,428 INFO L87 Difference]: Start difference. First operand 328 states and 394 transitions. Second operand has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:44,854 INFO L93 Difference]: Finished difference Result 1883 states and 2460 transitions. [2025-02-08 13:31:44,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:31:44,855 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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 96 [2025-02-08 13:31:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:44,864 INFO L225 Difference]: With dead ends: 1883 [2025-02-08 13:31:44,864 INFO L226 Difference]: Without dead ends: 1882 [2025-02-08 13:31:44,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 185 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:44,866 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 2816 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2856 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:44,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2856 Valid, 2041 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:31:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2025-02-08 13:31:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 352. [2025-02-08 13:31:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 316 states have (on average 1.2911392405063291) internal successors, (408), 339 states have internal predecessors, (408), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 424 transitions. [2025-02-08 13:31:44,902 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 424 transitions. Word has length 96 [2025-02-08 13:31:44,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:44,903 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 424 transitions. [2025-02-08 13:31:44,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 424 transitions. [2025-02-08 13:31:44,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 13:31:44,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:44,904 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, 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:44,918 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:31:45,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:45,106 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:45,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1048742278, now seen corresponding path program 1 times [2025-02-08 13:31:45,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:45,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035474935] [2025-02-08 13:31:45,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:45,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 13:31:45,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 13:31:45,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:45,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:31:45,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:45,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035474935] [2025-02-08 13:31:45,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035474935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:45,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:45,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:45,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715206938] [2025-02-08 13:31:45,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:45,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:45,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:45,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:45,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:45,597 INFO L87 Difference]: Start difference. First operand 352 states and 424 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:45,669 INFO L93 Difference]: Finished difference Result 352 states and 424 transitions. [2025-02-08 13:31:45,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:45,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-02-08 13:31:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:45,672 INFO L225 Difference]: With dead ends: 352 [2025-02-08 13:31:45,672 INFO L226 Difference]: Without dead ends: 350 [2025-02-08 13:31:45,672 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:45,672 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 3 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:45,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 399 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-08 13:31:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-02-08 13:31:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 316 states have (on average 1.2848101265822784) internal successors, (406), 337 states have internal predecessors, (406), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 422 transitions. [2025-02-08 13:31:45,690 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 422 transitions. Word has length 102 [2025-02-08 13:31:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:45,690 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 422 transitions. [2025-02-08 13:31:45,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 422 transitions. [2025-02-08 13:31:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 13:31:45,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:45,691 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, 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:45,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 13:31:45,692 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:45,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1052956456, now seen corresponding path program 1 times [2025-02-08 13:31:45,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:45,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713786725] [2025-02-08 13:31:45,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:45,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:45,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 13:31:45,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 13:31:45,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:45,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:31:46,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:46,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713786725] [2025-02-08 13:31:46,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713786725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:46,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:46,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:46,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206183932] [2025-02-08 13:31:46,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:46,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:46,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:46,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:46,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:46,070 INFO L87 Difference]: Start difference. First operand 350 states and 422 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:46,157 INFO L93 Difference]: Finished difference Result 397 states and 489 transitions. [2025-02-08 13:31:46,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:46,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-02-08 13:31:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:46,161 INFO L225 Difference]: With dead ends: 397 [2025-02-08 13:31:46,162 INFO L226 Difference]: Without dead ends: 394 [2025-02-08 13:31:46,162 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:46,163 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 141 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:46,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 307 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-08 13:31:46,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 347. [2025-02-08 13:31:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 316 states have (on average 1.2753164556962024) internal successors, (403), 334 states have internal predecessors, (403), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 419 transitions. [2025-02-08 13:31:46,179 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 419 transitions. Word has length 102 [2025-02-08 13:31:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:46,179 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 419 transitions. [2025-02-08 13:31:46,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 419 transitions. [2025-02-08 13:31:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 13:31:46,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:46,182 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, 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:46,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 13:31:46,183 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:46,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:46,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1848727241, now seen corresponding path program 1 times [2025-02-08 13:31:46,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267729535] [2025-02-08 13:31:46,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:46,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 13:31:46,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 13:31:46,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:46,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:31:46,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267729535] [2025-02-08 13:31:46,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267729535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:46,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:46,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:46,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757443420] [2025-02-08 13:31:46,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:46,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:46,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:46,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:46,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:46,503 INFO L87 Difference]: Start difference. First operand 347 states and 419 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:46,572 INFO L93 Difference]: Finished difference Result 394 states and 486 transitions. [2025-02-08 13:31:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:46,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-08 13:31:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:46,575 INFO L225 Difference]: With dead ends: 394 [2025-02-08 13:31:46,575 INFO L226 Difference]: Without dead ends: 390 [2025-02-08 13:31:46,576 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:46,579 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 125 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:46,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 394 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-08 13:31:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 331. [2025-02-08 13:31:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 304 states have (on average 1.256578947368421) internal successors, (382), 318 states have internal predecessors, (382), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 398 transitions. [2025-02-08 13:31:46,596 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 398 transitions. Word has length 103 [2025-02-08 13:31:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:46,597 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 398 transitions. [2025-02-08 13:31:46,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 398 transitions. [2025-02-08 13:31:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 13:31:46,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:46,598 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, 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:46,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 13:31:46,598 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:46,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:46,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1718087685, now seen corresponding path program 1 times [2025-02-08 13:31:46,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782053875] [2025-02-08 13:31:46,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:46,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 13:31:46,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 13:31:46,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:46,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:31:46,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:46,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782053875] [2025-02-08 13:31:46,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782053875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:46,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:46,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:46,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711846540] [2025-02-08 13:31:46,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:46,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:46,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:46,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:46,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:46,954 INFO L87 Difference]: Start difference. First operand 331 states and 398 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:47,023 INFO L93 Difference]: Finished difference Result 378 states and 465 transitions. [2025-02-08 13:31:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:47,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-08 13:31:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:47,027 INFO L225 Difference]: With dead ends: 378 [2025-02-08 13:31:47,027 INFO L226 Difference]: Without dead ends: 377 [2025-02-08 13:31:47,027 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:47,027 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 139 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:47,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 338 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-02-08 13:31:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 330. [2025-02-08 13:31:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 304 states have (on average 1.2532894736842106) internal successors, (381), 317 states have internal predecessors, (381), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 397 transitions. [2025-02-08 13:31:47,045 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 397 transitions. Word has length 103 [2025-02-08 13:31:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:47,046 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 397 transitions. [2025-02-08 13:31:47,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 397 transitions. [2025-02-08 13:31:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 13:31:47,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:47,047 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:47,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 13:31:47,050 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:47,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:47,051 INFO L85 PathProgramCache]: Analyzing trace with hash 838308082, now seen corresponding path program 1 times [2025-02-08 13:31:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:47,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624152202] [2025-02-08 13:31:47,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:47,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:47,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 13:31:47,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 13:31:47,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:47,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:31:47,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:47,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624152202] [2025-02-08 13:31:47,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624152202] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:47,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921862335] [2025-02-08 13:31:47,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:47,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:47,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:47,421 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:31:47,423 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:31:48,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 13:31:48,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 13:31:48,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:48,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:48,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1891 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:31:48,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:31:48,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:48,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921862335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:48,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:48,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 13:31:48,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444936325] [2025-02-08 13:31:48,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:48,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:31:48,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:48,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:31:48,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:48,373 INFO L87 Difference]: Start difference. First operand 330 states and 397 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:31:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:48,495 INFO L93 Difference]: Finished difference Result 580 states and 731 transitions. [2025-02-08 13:31:48,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:31:48,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2025-02-08 13:31:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:48,498 INFO L225 Difference]: With dead ends: 580 [2025-02-08 13:31:48,498 INFO L226 Difference]: Without dead ends: 436 [2025-02-08 13:31:48,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:48,500 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 291 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:48,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 608 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-08 13:31:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 328. [2025-02-08 13:31:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 304 states have (on average 1.2401315789473684) internal successors, (377), 315 states have internal predecessors, (377), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 393 transitions. [2025-02-08 13:31:48,518 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 393 transitions. Word has length 104 [2025-02-08 13:31:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:48,519 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 393 transitions. [2025-02-08 13:31:48,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:31:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 393 transitions. [2025-02-08 13:31:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 13:31:48,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:48,521 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:48,536 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:31:48,721 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,SelfDestructingSolverStorable23 [2025-02-08 13:31:48,722 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:48,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:48,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1198009705, now seen corresponding path program 1 times [2025-02-08 13:31:48,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:48,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799949298] [2025-02-08 13:31:48,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:48,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:48,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 13:31:48,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 13:31:48,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:48,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-02-08 13:31:49,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:49,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799949298] [2025-02-08 13:31:49,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799949298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:49,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:49,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:49,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395870334] [2025-02-08 13:31:49,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:49,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:49,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:49,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:49,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:49,020 INFO L87 Difference]: Start difference. First operand 328 states and 393 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:49,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:49,051 INFO L93 Difference]: Finished difference Result 328 states and 393 transitions. [2025-02-08 13:31:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:49,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-02-08 13:31:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:49,054 INFO L225 Difference]: With dead ends: 328 [2025-02-08 13:31:49,054 INFO L226 Difference]: Without dead ends: 327 [2025-02-08 13:31:49,054 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:49,055 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:49,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-02-08 13:31:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-02-08 13:31:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 304 states have (on average 1.236842105263158) internal successors, (376), 314 states have internal predecessors, (376), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 392 transitions. [2025-02-08 13:31:49,074 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 392 transitions. Word has length 107 [2025-02-08 13:31:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:49,074 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 392 transitions. [2025-02-08 13:31:49,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 392 transitions. [2025-02-08 13:31:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-08 13:31:49,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:49,076 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:49,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 13:31:49,076 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:49,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:49,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1516405550, now seen corresponding path program 1 times [2025-02-08 13:31:49,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:49,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203847077] [2025-02-08 13:31:49,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:49,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:49,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:31:49,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:31:49,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:49,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-08 13:31:50,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203847077] [2025-02-08 13:31:50,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203847077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:50,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:50,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:31:50,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023030723] [2025-02-08 13:31:50,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:50,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:31:50,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:50,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:31:50,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:31:50,112 INFO L87 Difference]: Start difference. First operand 327 states and 392 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:50,163 INFO L93 Difference]: Finished difference Result 504 states and 620 transitions. [2025-02-08 13:31:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:31:50,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-02-08 13:31:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:50,168 INFO L225 Difference]: With dead ends: 504 [2025-02-08 13:31:50,170 INFO L226 Difference]: Without dead ends: 330 [2025-02-08 13:31:50,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:31:50,171 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:50,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 621 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-08 13:31:50,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-02-08 13:31:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 306 states have (on average 1.238562091503268) internal successors, (379), 317 states have internal predecessors, (379), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-08 13:31:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 397 transitions. [2025-02-08 13:31:50,215 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 397 transitions. Word has length 108 [2025-02-08 13:31:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:50,217 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 397 transitions. [2025-02-08 13:31:50,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:31:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 397 transitions. [2025-02-08 13:31:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-08 13:31:50,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:50,222 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:50,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 13:31:50,222 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:50,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:50,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1766451334, now seen corresponding path program 1 times [2025-02-08 13:31:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:50,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69455132] [2025-02-08 13:31:50,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:50,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:50,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 13:31:50,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 13:31:50,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:50,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-08 13:31:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69455132] [2025-02-08 13:31:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69455132] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415425780] [2025-02-08 13:31:51,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:51,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:51,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:51,136 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:31:51,172 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:31:52,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 13:31:52,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 13:31:52,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:52,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:52,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-02-08 13:31:52,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:52,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:52,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:52,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:52,562 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 13:31:52,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-02-08 13:31:52,606 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 13:31:52,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 13:31:52,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:52,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:52,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:52,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:52,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:52,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:52,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:53,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:53,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:53,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:53,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:53,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:53,376 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-08 13:31:53,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-02-08 13:31:53,545 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-02-08 13:31:53,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-02-08 13:31:53,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:53,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 106 [2025-02-08 13:31:53,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:53,676 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-02-08 13:31:53,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 78 [2025-02-08 13:31:53,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 100 [2025-02-08 13:31:53,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:53,706 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-02-08 13:31:53,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 72 [2025-02-08 13:31:53,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-02-08 13:31:53,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:53,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 144 [2025-02-08 13:31:53,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:53,770 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-02-08 13:31:53,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 89 [2025-02-08 13:31:53,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:53,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2025-02-08 13:31:53,821 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-08 13:31:53,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2025-02-08 13:31:53,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-02-08 13:31:53,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:53,863 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-02-08 13:31:53,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 78 [2025-02-08 13:31:53,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 26 [2025-02-08 13:31:53,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 132 [2025-02-08 13:31:53,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:53,962 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:31:53,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:31:53,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:31:54,033 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:31:54,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:31:54,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:31:54,102 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:31:54,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:31:54,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:31:54,162 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:31:54,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:31:54,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:31:54,224 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:31:54,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:31:54,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:31:54,282 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:31:54,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:31:54,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:31:54,377 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:31:54,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:31:54,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:31:54,483 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:31:54,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:31:54,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:31:54,543 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:31:54,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:31:54,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:31:54,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2025-02-08 13:31:54,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:31:54,904 WARN L873 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memset_#ptr.base| Int)) (= (store |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|)) |c_#memory_int|)) is different from true [2025-02-08 13:31:54,927 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-08 13:31:54,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2025-02-08 13:31:55,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 13:31:55,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2025-02-08 13:31:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 241 trivial. 1 not checked. [2025-02-08 13:31:55,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:55,568 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7850 (Array Int Int)) (v_ArrVal_7848 (Array Int Int)) (v_ArrVal_7849 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store |c_#memory_int| .cse0 v_ArrVal_7848) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7849) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_7850))) 11) 0) 33))) is different from false [2025-02-08 13:31:55,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7850 (Array Int Int)) (v_ArrVal_7847 (Array Int Int)) (v_ArrVal_7848 (Array Int Int)) (v_ArrVal_7846 (Array Int Int)) (v_ArrVal_7849 (Array Int Int))) (not (= 33 (select (select (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7846))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_int| .cse0 v_ArrVal_7847) .cse1 v_ArrVal_7848) (select (select (store .cse2 .cse1 v_ArrVal_7849) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_7850))))) 11) 0)))) is different from false [2025-02-08 13:31:55,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7850 (Array Int Int)) (v_ArrVal_7844 (Array Int Int)) (v_ArrVal_7847 (Array Int Int)) (v_ArrVal_7848 (Array Int Int)) (v_ArrVal_7845 (Array Int Int)) (v_ArrVal_7846 (Array Int Int)) (v_ArrVal_7849 (Array Int Int))) (not (= (select (select (let ((.cse4 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7844))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_7846))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_7845) .cse1 v_ArrVal_7847) .cse2 v_ArrVal_7848) (select (select (store .cse3 .cse2 v_ArrVal_7849) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_7850))))))) 11) 0) 33))) is different from false [2025-02-08 13:31:55,650 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7850 (Array Int Int)) (v_ArrVal_7843 (Array Int Int)) (v_ArrVal_7844 (Array Int Int)) (v_ArrVal_7842 (Array Int Int)) (v_ArrVal_7847 (Array Int Int)) (v_ArrVal_7848 (Array Int Int)) (v_ArrVal_7845 (Array Int Int)) (v_ArrVal_7846 (Array Int Int)) (v_ArrVal_7849 (Array Int Int))) (not (= (select (select (let ((.cse5 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7843))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_7844))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_7846))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_7842) .cse1 v_ArrVal_7845) .cse2 v_ArrVal_7847) .cse3 v_ArrVal_7848) (select (select (store .cse4 .cse3 v_ArrVal_7849) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_7850))))))))) 11) 0) 33))) is different from false [2025-02-08 13:31:57,093 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7850 (Array Int Int)) (v_ArrVal_7840 (Array Int Int)) (v_ArrVal_7843 (Array Int Int)) (v_ArrVal_7844 (Array Int Int)) (v_ArrVal_7841 (Array Int Int)) (v_ArrVal_7842 (Array Int Int)) (v_ArrVal_7836 (Array Int Int)) (v_ArrVal_7847 (Array Int Int)) (v_ArrVal_7837 (Array Int Int)) (v_ArrVal_7848 (Array Int Int)) (v_ArrVal_7845 (Array Int Int)) (v_ArrVal_7846 (Array Int Int)) (v_ArrVal_7838 (Array Int Int)) (v_ArrVal_7849 (Array Int Int)) (v_ArrVal_7839 (Array Int Int))) (not (= 33 (select (select (let ((.cse8 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7836))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_7838))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_7840))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_7843))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_7844))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_7846))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_7837) .cse1 v_ArrVal_7839) .cse2 v_ArrVal_7841) .cse3 v_ArrVal_7842) .cse4 v_ArrVal_7845) .cse5 v_ArrVal_7847) .cse6 v_ArrVal_7848) (select (select (store .cse7 .cse6 v_ArrVal_7849) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) v_ArrVal_7850))))))))))))))) 11) 0)))) is different from false [2025-02-08 13:31:57,567 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7850 (Array Int Int)) (v_ArrVal_7840 (Array Int Int)) (v_ArrVal_7843 (Array Int Int)) (v_ArrVal_7844 (Array Int Int)) (v_ArrVal_7841 (Array Int Int)) (v_ArrVal_7842 (Array Int Int)) (v_ArrVal_7836 (Array Int Int)) (v_ArrVal_7847 (Array Int Int)) (v_ArrVal_7837 (Array Int Int)) (v_ArrVal_7848 (Array Int Int)) (v_ArrVal_7834 (Array Int Int)) (v_ArrVal_7845 (Array Int Int)) (v_ArrVal_7835 (Array Int Int)) (v_ArrVal_7846 (Array Int Int)) (v_ArrVal_7838 (Array Int Int)) (v_ArrVal_7849 (Array Int Int)) (v_ArrVal_7839 (Array Int Int))) (not (= 33 (select (select (let ((.cse9 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7834))) (let ((.cse1 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse14 (store .cse15 .cse1 v_ArrVal_7836))) (let ((.cse2 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_7838))) (let ((.cse3 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_7840))) (let ((.cse4 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_7843))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_7844))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse8 (store .cse10 .cse6 v_ArrVal_7846))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_7835) .cse1 v_ArrVal_7837) .cse2 v_ArrVal_7839) .cse3 v_ArrVal_7841) .cse4 v_ArrVal_7842) .cse5 v_ArrVal_7845) .cse6 v_ArrVal_7847) .cse7 v_ArrVal_7848) (select (select (store .cse8 .cse7 v_ArrVal_7849) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_7850))))))))))))))))) 11) 0)))) is different from false [2025-02-08 13:32:00,718 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7850 (Array Int Int)) (v_ArrVal_7840 (Array Int Int)) (v_ArrVal_7832 (Array Int Int)) (v_ArrVal_7843 (Array Int Int)) (v_ArrVal_7833 (Array Int Int)) (v_ArrVal_7844 (Array Int Int)) (v_ArrVal_7841 (Array Int Int)) (v_ArrVal_7842 (Array Int Int)) (v_ArrVal_7836 (Array Int Int)) (v_ArrVal_7847 (Array Int Int)) (v_ArrVal_7837 (Array Int Int)) (v_ArrVal_7848 (Array Int Int)) (v_ArrVal_7834 (Array Int Int)) (v_ArrVal_7845 (Array Int Int)) (v_ArrVal_7835 (Array Int Int)) (v_ArrVal_7846 (Array Int Int)) (v_ArrVal_7838 (Array Int Int)) (v_ArrVal_7849 (Array Int Int)) (v_ArrVal_7839 (Array Int Int))) (not (= (select (select (let ((.cse10 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7833))) (let ((.cse1 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse16 (store .cse17 .cse1 v_ArrVal_7834))) (let ((.cse2 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse15 (store .cse16 .cse2 v_ArrVal_7836))) (let ((.cse3 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse14 (store .cse15 .cse3 v_ArrVal_7838))) (let ((.cse4 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse13 (store .cse14 .cse4 v_ArrVal_7840))) (let ((.cse5 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse12 (store .cse13 .cse5 v_ArrVal_7843))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_7844))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse9 (store .cse11 .cse7 v_ArrVal_7846))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (store (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_7832) .cse1 v_ArrVal_7835) .cse2 v_ArrVal_7837) .cse3 v_ArrVal_7839) .cse4 v_ArrVal_7841) .cse5 v_ArrVal_7842) .cse6 v_ArrVal_7845) .cse7 v_ArrVal_7847) .cse8 v_ArrVal_7848) (select (select (store .cse9 .cse8 v_ArrVal_7849) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_7850))))))))))))))))))) 11) 0) 33))) is different from false [2025-02-08 13:32:00,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 13:32:00,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53236 treesize of output 28685