./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/wc-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/wc-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0965f22672c6a292fec01d227f055efac5960ba3033d74ae9dd8eaa6c3af30ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:30:40,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:30:41,116 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:41,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:30:41,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:30:41,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:30:41,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:30:41,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:30:41,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:30:41,149 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:30:41,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:30:41,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:30:41,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:30:41,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:30:41,151 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:30:41,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:30:41,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:30:41,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:30:41,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:30:41,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:30:41,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:30:41,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:30:41,152 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:30:41,152 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:30:41,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:30:41,152 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:30:41,152 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:30:41,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:30:41,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:30:41,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:30:41,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:30:41,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:30:41,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:30:41,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:30:41,153 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:30:41,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:30:41,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:30:41,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:30:41,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:30:41,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:30:41,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:30:41,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:30:41,154 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 -> 0965f22672c6a292fec01d227f055efac5960ba3033d74ae9dd8eaa6c3af30ea [2025-02-08 13:30:41,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:30:41,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:30:41,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:30:41,390 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:30:41,390 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:30:41,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/wc-1.i [2025-02-08 13:30:42,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5c36294d/7b6bd4dcaf2549e9a3601d7652be2766/FLAG32a210879 [2025-02-08 13:30:42,962 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:30:42,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-1.i [2025-02-08 13:30:42,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5c36294d/7b6bd4dcaf2549e9a3601d7652be2766/FLAG32a210879 [2025-02-08 13:30:43,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5c36294d/7b6bd4dcaf2549e9a3601d7652be2766 [2025-02-08 13:30:43,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:30:43,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:30:43,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:30:43,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:30:43,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:30:43,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:30:43" (1/1) ... [2025-02-08 13:30:43,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11460e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:43, skipping insertion in model container [2025-02-08 13:30:43,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:30:43" (1/1) ... [2025-02-08 13:30:43,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:30:43,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:30:43,913 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:30:44,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:30:44,190 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:30:44,197 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:30:44,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44 WrapperNode [2025-02-08 13:30:44,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:30:44,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:30:44,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:30:44,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:30:44,210 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:30:44" (1/1) ... [2025-02-08 13:30:44,256 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:30:44" (1/1) ... [2025-02-08 13:30:44,334 INFO L138 Inliner]: procedures = 577, calls = 807, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 2177 [2025-02-08 13:30:44,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:30:44,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:30:44,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:30:44,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:30:44,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44" (1/1) ... [2025-02-08 13:30:44,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44" (1/1) ... [2025-02-08 13:30:44,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44" (1/1) ... [2025-02-08 13:30:44,368 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:30:44,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44" (1/1) ... [2025-02-08 13:30:44,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44" (1/1) ... [2025-02-08 13:30:44,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44" (1/1) ... [2025-02-08 13:30:44,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44" (1/1) ... [2025-02-08 13:30:44,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44" (1/1) ... [2025-02-08 13:30:44,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44" (1/1) ... [2025-02-08 13:30:44,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:30:44,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:30:44,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:30:44,455 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:30:44,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44" (1/1) ... [2025-02-08 13:30:44,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:30:44,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:44,484 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:30:44,494 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:30:44,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:30:44,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:30:44,509 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:30:44,509 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:30:44,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:30:44,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:30:44,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:30:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:30:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:30:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:30:44,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:30:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:30:44,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:30:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:30:44,510 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:30:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:30:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:30:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-08 13:30:44,510 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-08 13:30:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-08 13:30:44,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-08 13:30:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:30:44,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:30:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:30:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:30:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:30:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:30:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:30:44,511 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:30:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:30:44,857 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:30:44,858 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:30:45,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2430: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:30:45,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2430: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:30:45,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2893: safe_write_#t~ret206#1 := write_#res#1;havoc write_#t~nondet295#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~ret206#1 && safe_write_#t~ret206#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret206#1;havoc safe_write_#t~ret206#1; [2025-02-08 13:30:45,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2894: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem207#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~2#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem207#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:30:45,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2894: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~2#1 := 0; [2025-02-08 13:30:45,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358: #t~ret66#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet75#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret66#1 && #t~ret66#1 <= 2147483647;havoc #t~ret66#1;call #t~mem67#1.base, #t~mem67#1.offset := read~$Pointer$(~#msg~0#1.base, ~#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, #t~mem67#1.base, #t~mem67#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret82#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:30:45,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2425: 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~ret206#1, safe_write_#t~mem207#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~2#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~2#1; [2025-02-08 13:30:45,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2425: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:30:45,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2359: #t~ret68#1 := full_write_#res#1;havoc full_write_#t~ret82#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 <= #t~ret68#1 && #t~ret68#1 <= 9223372036854775807;havoc #t~mem67#1.base, #t~mem67#1.offset;havoc #t~ret68#1; [2025-02-08 13:30:45,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2434: 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:30:45,188 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2434: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:30:45,188 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2434-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:30:45,188 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2434-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:30:45,188 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2427: full_write_#t~ret82#1 := safe_write_#res#1;havoc safe_write_#t~ret206#1, safe_write_#t~mem207#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~2#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~ret82#1 && full_write_#t~ret82#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret82#1;havoc full_write_#t~ret82#1; [2025-02-08 13:30:45,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2428: assume full_write_~cc~0#1 < 0; [2025-02-08 13:30:45,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2428: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:30:45,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3229-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:30:45,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3229: write_#res#1 := write_~ret~1#1; [2025-02-08 13:30:45,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891-1: assume 0 != safe_write_~tmp_if_expr$1~2#1 % 256; [2025-02-08 13:30:45,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891-1: assume !(0 != safe_write_~tmp_if_expr$1~2#1 % 256); [2025-02-08 13:30:45,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891: 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~nondet295#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~nondet295#1;assume -9223372036854775808 <= write_#t~nondet295#1 && write_#t~nondet295#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet295#1;havoc write_#t~nondet295#1; [2025-02-08 13:30:45,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891: assume !true; [2025-02-08 13:30:45,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2900-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3041: havoc __main_#t~ret237#1;havoc __main_#t~ret237#1; [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-1: [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975: assume 128 != __main_#t~bitwise220#1;havoc __main_#t~bitwise220#1; [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975: assume !(128 != __main_#t~bitwise220#1);havoc __main_#t~bitwise220#1; [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-3: assume 192 == __main_~c~1#1;__main_#t~bitwise220#1 := 192; [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-3: assume !(192 == __main_~c~1#1); [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-2: havoc __main_#t~bitwise220#1;assume (((__main_#t~bitwise220#1 <= 192 && (__main_~c~1#1 < 0 || __main_#t~bitwise220#1 <= __main_~c~1#1)) && __main_#t~bitwise220#1 >= 0) && (__main_~c~1#1 >= 0 || __main_#t~bitwise220#1 > 192 + __main_~c~1#1)) && __main_#t~bitwise220#1 >= -2147483648; [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-4: assume 0 == __main_~c~1#1;__main_#t~bitwise220#1 := 0; [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-4: assume !(0 == __main_~c~1#1); [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-1: [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777: getopt32_~flags~0#1 := getopt32_#t~bitwise172#1;havoc getopt32_#t~mem170#1;havoc getopt32_#t~bitwise171#1;havoc getopt32_#t~bitwise172#1; [2025-02-08 13:30:51,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-3: assume 0 == getopt32_#t~bitwise171#1 % 4294967296;getopt32_#t~bitwise172#1 := getopt32_~flags~0#1; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-3: assume !(0 == getopt32_#t~bitwise171#1 % 4294967296); [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-2: havoc getopt32_#t~bitwise172#1;assume (getopt32_#t~bitwise172#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise172#1 % 4294967296 >= getopt32_#t~bitwise171#1 % 4294967296) && getopt32_#t~bitwise172#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise171#1 % 4294967296; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-5: [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise171#1 % 4294967296;getopt32_#t~bitwise172#1 := getopt32_#t~bitwise171#1; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise171#1 % 4294967296); [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-7: assume getopt32_#t~mem170#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise171#1 := 0; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-7: assume !(getopt32_#t~mem170#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-6: havoc getopt32_#t~bitwise171#1;assume getopt32_#t~bitwise171#1 % 4294967296 <= getopt32_#t~mem170#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-9: assume 0 == getopt32_#t~mem170#1 % 4294967296;getopt32_#t~bitwise171#1 := getopt32_~trigger~0#1; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-9: assume !(0 == getopt32_#t~mem170#1 % 4294967296); [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise171#1 := getopt32_#t~mem170#1; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778: getopt32_~flags~0#1 := getopt32_#t~bitwise173#1;havoc getopt32_#t~bitwise173#1;call getopt32_#t~mem174#1.base, getopt32_#t~mem174#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-2: havoc getopt32_#t~bitwise173#1;assume getopt32_#t~bitwise173#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-1: [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise173#1 := getopt32_~flags~0#1; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise173#1 := 0; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise173#1 := getopt32_~trigger~0#1; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3142: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~1#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:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3142: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296); [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3109: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 13:30:51,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2911: call ULTIMATE.dealloc(__main_~#counts~0#1.base, __main_~#counts~0#1.offset);havoc __main_~#counts~0#1.base, __main_~#counts~0#1.offset;call ULTIMATE.dealloc(__main_~#totals~0#1.base, __main_~#totals~0#1.offset);havoc __main_~#totals~0#1.base, __main_~#totals~0#1.offset; [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779: assume !(getopt32_#t~mem174#1.base == 0 && getopt32_#t~mem174#1.offset == 0);havoc getopt32_#t~mem174#1.base, getopt32_#t~mem174#1.offset;call getopt32_#t~mem175#1.base, getopt32_#t~mem175#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem177#1 := read~int(getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset, 4); [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779: assume !!(getopt32_#t~mem174#1.base == 0 && getopt32_#t~mem174#1.offset == 0);havoc getopt32_#t~mem174#1.base, getopt32_#t~mem174#1.offset; [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3110: assume 0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256;call xstrtou_range_sfx_#t~mem247#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);xstrtou_range_sfx_~old_errno~0#1 := xstrtou_range_sfx_#t~mem247#1;havoc xstrtou_range_sfx_#t~mem247#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~nondet44#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~nondet44#1;havoc bb_strtoui_#t~nondet44#1; [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3110: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256); [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: assume 1 + getopt32_#t~mem177#1 <= 2147483647;call write~int(1 + getopt32_#t~mem177#1, getopt32_#t~mem175#1.base, getopt32_#t~mem175#1.offset, 4); [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: assume !(1 + getopt32_#t~mem177#1 <= 2147483647); [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780-1: assume 1 + getopt32_#t~mem177#1 >= -2147483648; [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780-1: assume !(1 + getopt32_#t~mem177#1 >= -2147483648); [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2417: fopen_or_warn_stdin_#t~ret81#1.base, fopen_or_warn_stdin_#t~ret81#1.offset := fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset;havoc fopen_or_warn_#t~nondet78#1.base, fopen_or_warn_#t~nondet78#1.offset, fopen_or_warn_~path#1.base, fopen_or_warn_~path#1.offset, fopen_or_warn_~mode#1.base, fopen_or_warn_~mode#1.offset, fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset;havoc fopen_or_warn_#in~path#1.base, fopen_or_warn_#in~path#1.offset, fopen_or_warn_#in~mode#1.base, fopen_or_warn_#in~mode#1.offset;assume { :end_inline_fopen_or_warn } true;fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset := fopen_or_warn_stdin_#t~ret81#1.base, fopen_or_warn_stdin_#t~ret81#1.offset; [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3012: call __main_#t~mem224#1 := read~int(__main_~#counts~0#1.base, 4 + __main_~#counts~0#1.offset, 4);call write~int(__main_#t~mem224#1 + __main_~in_word~0#1, __main_~#counts~0#1.base, 4 + __main_~#counts~0#1.offset, 4);havoc __main_#t~mem224#1;__main_~in_word~0#1 := 0; [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem178#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3014: assume -1 == __main_~c~1#1; [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3014: assume !(-1 == __main_~c~1#1);havoc __main_~c~1#1; [2025-02-08 13:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2783: assume 1 == getopt32_#t~mem178#1;havoc getopt32_#t~mem178#1;call getopt32_#t~mem179#1.base, getopt32_#t~mem179#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~mem179#1.base, getopt32_#t~mem179#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset, llist_add_to_end_#t~mem199#1.base, llist_add_to_end_#t~mem199#1.offset, llist_add_to_end_#t~ret200#1.base, llist_add_to_end_#t~ret200#1.offset, llist_add_to_end_#t~mem201#1.base, llist_add_to_end_#t~mem201#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:30:51,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2783: assume !(1 == getopt32_#t~mem178#1);havoc getopt32_#t~mem178#1;call getopt32_#t~mem180#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:30:51,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3147-1: SUMMARY for call bb_error_msg_and_die(16, 0, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset); srcloc: null [2025-02-08 13:30:51,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3114: xstrtou_range_sfx_#t~ret248#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet44#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~1#1 := xstrtou_range_sfx_#t~ret248#1;havoc xstrtou_range_sfx_#t~ret248#1;call xstrtou_range_sfx_#t~mem249#1.base, xstrtou_range_sfx_#t~mem249#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:30:51,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3147: havoc xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset; [2025-02-08 13:30:51,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3147-2: call xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset, 8);call write~int(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs258#1.base, 8 + xstrtou_range_sfx_#t~varargs258#1.offset, 8);call write~int(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs258#1.base, 16 + xstrtou_range_sfx_#t~varargs258#1.offset, 8); [2025-02-08 13:30:51,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2949: __main_#t~ret215#1.base, __main_#t~ret215#1.offset := fopen_or_warn_stdin_#res#1.base, fopen_or_warn_stdin_#res#1.offset;havoc fopen_or_warn_stdin_#t~mem79#1, fopen_or_warn_stdin_#t~mem80#1, fopen_or_warn_stdin_#t~ret81#1.base, fopen_or_warn_stdin_#t~ret81#1.offset, fopen_or_warn_stdin_~filename#1.base, fopen_or_warn_stdin_~filename#1.offset, fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset, fopen_or_warn_stdin_~tmp_if_expr$1~0#1;havoc fopen_or_warn_stdin_#in~filename#1.base, fopen_or_warn_stdin_#in~filename#1.offset;assume { :end_inline_fopen_or_warn_stdin } true;__main_~fp~2#1.base, __main_~fp~2#1.offset := __main_#t~ret215#1.base, __main_#t~ret215#1.offset;havoc __main_#t~ret215#1.base, __main_#t~ret215#1.offset; [2025-02-08 13:30:51,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3115: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem249#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem249#1.offset);havoc xstrtou_range_sfx_#t~mem249#1.base, xstrtou_range_sfx_#t~mem249#1.offset;call xstrtou_range_sfx_#t~mem250#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:30:51,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3115: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem249#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem249#1.offset);havoc xstrtou_range_sfx_#t~mem249#1.base, xstrtou_range_sfx_#t~mem249#1.offset; [2025-02-08 13:30:51,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2950: assume __main_~fp~2#1.base == 0 && __main_~fp~2#1.offset == 0;__main_~status~0#1 := 1; [2025-02-08 13:30:51,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2950: assume !(__main_~fp~2#1.base == 0 && __main_~fp~2#1.offset == 0); [2025-02-08 13:30:51,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: havoc getopt_long_#t~ret291#1;getopt32_#t~ret159#1 := getopt_long_#res#1;havoc getopt_long_#t~mem287#1.base, getopt_long_#t~mem287#1.offset, getopt_long_#t~mem288#1, getopt_long_#t~mem289#1.base, getopt_long_#t~mem289#1.offset, getopt_long_#t~mem290#1, getopt_long_#t~ret291#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~ret159#1 && getopt32_#t~ret159#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret159#1;havoc getopt32_#t~ret159#1; [2025-02-08 13:30:51,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215-2: getopt_long_#t~ret291#1 := getopt_#res#1;havoc getopt_#t~mem271#1.base, getopt_#t~mem271#1.offset, getopt_#t~mem272#1, getopt_#t~short273#1, getopt_#t~nondet274#1, getopt_#t~nondet275#1, getopt_#t~mem276#1, getopt_#t~short277#1, getopt_#t~nondet278#1, getopt_#t~mem279#1, getopt_#t~nondet280#1, getopt_#t~pre281#1, getopt_#t~mem282#1, getopt_#t~short283#1, getopt_#t~nondet284#1, getopt_#t~mem285#1.base, getopt_#t~mem285#1.offset, getopt_#t~pre286#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~ret291#1 && getopt_long_#t~ret291#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret291#1;havoc getopt_long_#t~ret291#1; [2025-02-08 13:30:51,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3017-1: assume { :begin_inline_fclose_if_not_stdin } true;fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset := __main_~fp~2#1.base, __main_~fp~2#1.offset;havoc fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet72#1, fclose_if_not_stdin_#t~nondet73#1, fclose_if_not_stdin_#t~bitwise74#1, fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset, fclose_if_not_stdin_~r~0#1, fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset := fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset;havoc fclose_if_not_stdin_~r~0#1;assume -2147483648 <= fclose_if_not_stdin_#t~nondet72#1 && fclose_if_not_stdin_#t~nondet72#1 <= 2147483647;fclose_if_not_stdin_~r~0#1 := fclose_if_not_stdin_#t~nondet72#1;havoc fclose_if_not_stdin_#t~nondet72#1; [2025-02-08 13:30:51,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume (4294967264 + __main_~c~1#1) % 4294967296 <= 94;__main_~linepos~0#1 := 1 + __main_~linepos~0#1; [2025-02-08 13:30:51,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume !((4294967264 + __main_~c~1#1) % 4294967296 <= 94); [2025-02-08 13:30:51,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3017: __main_#t~ret225#1 := fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet72#1, fclose_if_not_stdin_#t~nondet73#1, fclose_if_not_stdin_#t~bitwise74#1, fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset, fclose_if_not_stdin_~r~0#1, fclose_if_not_stdin_~return_value_fclose$1~0#1;havoc fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset;assume { :end_inline_fclose_if_not_stdin } true;assume -2147483648 <= __main_#t~ret225#1 && __main_#t~ret225#1 <= 2147483647;havoc __main_#t~ret225#1;call __main_#t~mem226#1 := read~int(__main_~#totals~0#1.base, 16 + __main_~#totals~0#1.offset, 4);call __main_#t~mem227#1 := read~int(__main_~#counts~0#1.base, 16 + __main_~#counts~0#1.offset, 4); [2025-02-08 13:30:51,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2786: assume 2 == getopt32_#t~mem180#1;havoc getopt32_#t~mem180#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~ret239#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~ret240#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~mem244#1, xstrtou_range_sfx_#t~mem245#1, xstrtou_range_sfx_#t~mem246#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem247#1, xstrtou_range_sfx_#t~ret248#1, xstrtou_range_sfx_#t~mem249#1.base, xstrtou_range_sfx_#t~mem249#1.offset, xstrtou_range_sfx_#t~mem250#1, xstrtou_range_sfx_#t~mem251#1, xstrtou_range_sfx_#t~mem252#1.base, xstrtou_range_sfx_#t~mem252#1.offset, xstrtou_range_sfx_#t~nondet253#1, xstrtou_range_sfx_#t~mem254#1, xstrtou_range_sfx_#t~mem255#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~mem256#1.base, xstrtou_range_sfx_#t~mem256#1.offset, xstrtou_range_sfx_#t~mem257#1, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset, xstrtou_range_sfx_#t~varargs259#1.base, xstrtou_range_sfx_#t~varargs259#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~1#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~2#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~1#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~mem244#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:30:51,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2786: assume !(2 == getopt32_#t~mem180#1);havoc getopt32_#t~mem180#1;call getopt32_#t~mem183#1.base, getopt32_#t~mem183#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:30:51,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3117: assume 0 == xstrtou_range_sfx_#t~mem250#1;havoc xstrtou_range_sfx_#t~mem250#1;call write~int(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:30:51,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3117: assume !(0 == xstrtou_range_sfx_#t~mem250#1);havoc xstrtou_range_sfx_#t~mem250#1; [2025-02-08 13:30:51,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3018: assume !(__main_#t~mem226#1 % 4294967296 >= __main_#t~mem227#1 % 4294967296);havoc __main_#t~mem226#1;havoc __main_#t~mem227#1;call __main_#t~mem228#1 := read~int(__main_~#counts~0#1.base, 16 + __main_~#counts~0#1.offset, 4);call write~int(__main_#t~mem228#1, __main_~#totals~0#1.base, 16 + __main_~#totals~0#1.offset, 4); [2025-02-08 13:30:51,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3018: assume !!(__main_#t~mem226#1 % 4294967296 >= __main_#t~mem227#1 % 4294967296);havoc __main_#t~mem226#1;havoc __main_#t~mem227#1; [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3020: call __main_#t~mem229#1 := read~int(__main_~#totals~0#1.base, 16 + __main_~#totals~0#1.offset, 4);call __main_#t~mem230#1 := read~int(__main_~#counts~0#1.base, 16 + __main_~#counts~0#1.offset, 4);call write~int(__main_#t~mem229#1 - __main_#t~mem230#1, __main_~#totals~0#1.base, 16 + __main_~#totals~0#1.offset, 4);havoc __main_#t~mem229#1;havoc __main_#t~mem230#1;__main_~s~2#1.base, __main_~s~2#1.offset := __main_~start_fmt~0#1.base, __main_~start_fmt~0#1.offset;__main_~u~0#1 := 0; [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954: havoc __main_#t~memset~res216#1.base, __main_#t~memset~res216#1.offset;__main_~linepos~0#1 := 0;__main_~in_word~0#1 := 0; [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume !(32 == __main_~c~1#1);__main_~in_word~0#1 := 1; [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume !!(32 == __main_~c~1#1); [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-1: SUMMARY for call __main_#t~memset~res216#1.base, __main_#t~memset~res216#1.offset := #Ultimate.C_memset(__main_~#counts~0#1.base, __main_~#counts~0#1.offset, 0, 20); srcloc: null [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2855: assume true;call llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#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:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2855: assume !true; [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2855-2: assume !!(llist_add_to_end_#t~mem198#1.base == 0 && llist_add_to_end_#t~mem198#1.offset == 0);havoc llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset; [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2855-2: assume !(llist_add_to_end_#t~mem198#1.base == 0 && llist_add_to_end_#t~mem198#1.offset == 0);havoc llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset;call llist_add_to_end_#t~mem199#1.base, llist_add_to_end_#t~mem199#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~mem199#1.base, llist_add_to_end_#t~mem199#1.offset;havoc llist_add_to_end_#t~mem199#1.base, llist_add_to_end_#t~mem199#1.offset; [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2789: getopt32_#t~ret181#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret239#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~ret181#1 && getopt32_#t~ret181#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret181#1;havoc getopt32_#t~ret181#1;call getopt32_#t~mem182#1.base, getopt32_#t~mem182#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~mem182#1.base, getopt32_#t~mem182#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem182#1.base, getopt32_#t~mem182#1.offset; [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3120: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3120: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3154: havoc xstrtou_range_sfx_#t~varargs259#1.base, xstrtou_range_sfx_#t~varargs259#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~ret240#1 := xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem244#1, xstrtou_range_sfx_#t~mem245#1, xstrtou_range_sfx_#t~mem246#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem247#1, xstrtou_range_sfx_#t~ret248#1, xstrtou_range_sfx_#t~mem249#1.base, xstrtou_range_sfx_#t~mem249#1.offset, xstrtou_range_sfx_#t~mem250#1, xstrtou_range_sfx_#t~mem251#1, xstrtou_range_sfx_#t~mem252#1.base, xstrtou_range_sfx_#t~mem252#1.offset, xstrtou_range_sfx_#t~nondet253#1, xstrtou_range_sfx_#t~mem254#1, xstrtou_range_sfx_#t~mem255#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~mem256#1.base, xstrtou_range_sfx_#t~mem256#1.offset, xstrtou_range_sfx_#t~mem257#1, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset, xstrtou_range_sfx_#t~varargs259#1.base, xstrtou_range_sfx_#t~varargs259#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~1#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~2#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~ret240#1;havoc xatou_range_#t~ret240#1;xatou_range_#res#1 := xatou_range_~return_value_xstrtou_range_sfx$1~0#1; [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3154-2: call xstrtou_range_sfx_#t~varargs259#1.base, xstrtou_range_sfx_#t~varargs259#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs259#1.base, xstrtou_range_sfx_#t~varargs259#1.offset, 8); [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121-1: assume !(0 == xstrtou_range_sfx_#t~mem251#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem251#1; [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121-1: assume !!(0 == xstrtou_range_sfx_#t~mem251#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem251#1; [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3154-1: SUMMARY for call bb_error_msg_and_die(17, 0, xstrtou_range_sfx_#t~varargs259#1.base, xstrtou_range_sfx_#t~varargs259#1.offset); srcloc: null [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: assume true;call xstrtou_range_sfx_#t~mem251#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:30:51,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: assume !true; [2025-02-08 13:30:51,133 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2857: 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~ret260#1.base, xzalloc_#t~ret260#1.offset, xzalloc_#t~memset~res261#1.base, xzalloc_#t~memset~res261#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:30:51,134 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957: assume true;havoc __main_~c~1#1;assume { :begin_inline__IO_getc } true;_IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset := __main_~fp~2#1.base, __main_~fp~2#1.offset;havoc _IO_getc_#res#1;havoc _IO_getc_#t~nondet262#1, _IO_getc_~stream#1.base, _IO_getc_~stream#1.offset;_IO_getc_~stream#1.base, _IO_getc_~stream#1.offset := _IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset;assume -2147483648 <= _IO_getc_#t~nondet262#1 && _IO_getc_#t~nondet262#1 <= 2147483647;_IO_getc_#res#1 := _IO_getc_#t~nondet262#1;havoc _IO_getc_#t~nondet262#1; [2025-02-08 13:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957: assume !true; [2025-02-08 13:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858: llist_add_to_end_#t~ret200#1.base, llist_add_to_end_#t~ret200#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret260#1.base, xzalloc_#t~ret260#1.offset, xzalloc_#t~memset~res261#1.base, xzalloc_#t~memset~res261#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~ret200#1.base, llist_add_to_end_#t~ret200#1.offset;havoc llist_add_to_end_#t~ret200#1.base, llist_add_to_end_#t~ret200#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~mem201#1.base, llist_add_to_end_#t~mem201#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~mem201#1.base, 8 + llist_add_to_end_#t~mem201#1.offset, 8);havoc llist_add_to_end_#t~mem201#1.base, llist_add_to_end_#t~mem201#1.offset;havoc llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset, llist_add_to_end_#t~mem199#1.base, llist_add_to_end_#t~mem199#1.offset, llist_add_to_end_#t~ret200#1.base, llist_add_to_end_#t~ret200#1.offset, llist_add_to_end_#t~mem201#1.base, llist_add_to_end_#t~mem201#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:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3123: 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~mem252#1.base, xstrtou_range_sfx_#t~mem252#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~nondet253#1;havoc xstrtou_range_sfx_#t~mem252#1.base, xstrtou_range_sfx_#t~mem252#1.offset;havoc xstrtou_range_sfx_#t~nondet253#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2793: assume !(getopt32_#t~mem183#1.base == 0 && getopt32_#t~mem183#1.offset == 0);havoc getopt32_#t~mem183#1.base, getopt32_#t~mem183#1.offset;call getopt32_#t~mem184#1.base, getopt32_#t~mem184#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~mem184#1.base, getopt32_#t~mem184#1.offset, 8); [2025-02-08 13:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2793: assume !!(getopt32_#t~mem183#1.base == 0 && getopt32_#t~mem183#1.offset == 0);havoc getopt32_#t~mem183#1.base, getopt32_#t~mem183#1.offset; [2025-02-08 13:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025: assume true; [2025-02-08 13:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025: assume !true; [2025-02-08 13:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3059: xatoi_positive_#t~ret239#1 := xatou_range_#res#1;havoc xatou_range_#t~ret240#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~ret239#1;havoc xatoi_positive_#t~ret239#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:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3159-1: SUMMARY for call xzalloc_#t~ret260#1.base, xzalloc_#t~ret260#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3159: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret260#1.base, xzalloc_#t~ret260#1.offset;havoc xzalloc_#t~ret260#1.base, xzalloc_#t~ret260#1.offset; [2025-02-08 13:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-1: [2025-02-08 13:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2994: assume (4294967287 + __main_~c~1#1) % 4294967296 <= 4; [2025-02-08 13:30:51,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2994: assume !((4294967287 + __main_~c~1#1) % 4294967296 <= 4); [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027: assume !(0 == __main_#t~bitwise232#1 % 4294967296);havoc __main_#t~bitwise231#1;havoc __main_#t~bitwise232#1;havoc __main_#t~ret233#1;call __main_#t~mem234#1 := read~int(__main_~pcounts~0#1.base, __main_~pcounts~0#1.offset + 4 * (if __main_~u~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~u~0#1 % 4294967296 % 18446744073709551616 else __main_~u~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 4);havoc __main_#t~ret233#1;havoc __main_#t~mem234#1;__main_~s~2#1.base, __main_~s~2#1.offset := 14, 0; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027: assume !!(0 == __main_#t~bitwise232#1 % 4294967296);havoc __main_#t~bitwise231#1;havoc __main_#t~bitwise232#1; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-3: assume __main_~print_type~0#1 % 4294967296 == __main_#t~bitwise231#1 % 4294967296;__main_#t~bitwise232#1 := __main_~print_type~0#1; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-3: assume !(__main_~print_type~0#1 % 4294967296 == __main_#t~bitwise231#1 % 4294967296); [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-2: havoc __main_#t~bitwise232#1;assume __main_#t~bitwise232#1 % 4294967296 <= __main_~print_type~0#1 % 4294967296 && __main_#t~bitwise232#1 % 4294967296 <= __main_#t~bitwise231#1 % 4294967296; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume -1 == __main_~c~1#1;havoc __main_~return_value_ferror$2~0#1;assume -2147483648 <= __main_#t~nondet218#1 && __main_#t~nondet218#1 <= 2147483647;__main_~return_value_ferror$2~0#1 := __main_#t~nondet218#1;havoc __main_#t~nondet218#1; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume !(-1 == __main_~c~1#1); [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-5: assume __main_#t~bitwise231#1 <= 2147483647; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-5: assume !(__main_#t~bitwise231#1 <= 2147483647); [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-4: assume 0 == __main_~print_type~0#1 % 4294967296 || 0 == __main_#t~bitwise231#1 % 4294967296;__main_#t~bitwise232#1 := 0; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-4: assume !(0 == __main_~print_type~0#1 % 4294967296 || 0 == __main_#t~bitwise231#1 % 4294967296); [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-7: [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-6: assume __main_#t~bitwise231#1 >= -2147483648; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-6: assume !(__main_#t~bitwise231#1 >= -2147483648); [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-9: assume 0 == __main_~u~0#1 % 4294967296;__main_#t~bitwise231#1 := 1; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-9: assume !(0 == __main_~u~0#1 % 4294967296); [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2763-1: assume true; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2763-1: assume !true; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-8: havoc __main_#t~bitwise231#1;assume __main_#t~bitwise231#1 > 1; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-10: assume 0 <= __main_~u~0#1 % 4294967296 && __main_~u~0#1 % 4294967296 < 32; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-10: assume !(0 <= __main_~u~0#1 % 4294967296 && __main_~u~0#1 % 4294967296 < 32); [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3160: havoc xzalloc_#t~memset~res261#1.base, xzalloc_#t~memset~res261#1.offset;xzalloc_#res#1.base, xzalloc_#res#1.offset := xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: assume false; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: assume !false;assume false; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3160-1: SUMMARY for call xzalloc_#t~memset~res261#1.base, xzalloc_#t~memset~res261#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:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: havoc __main_~return_value_ferror$2~0#1; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3128: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem254#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3128: 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:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3095: assume 45 == xstrtou_range_sfx_#t~mem244#1;havoc xstrtou_range_sfx_#t~mem244#1;xstrtou_range_sfx_~tmp_if_expr$1~3#1 := 1; [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3095: assume !(45 == xstrtou_range_sfx_#t~mem244#1);havoc xstrtou_range_sfx_#t~mem244#1;call xstrtou_range_sfx_#t~mem245#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~mem245#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:30:51,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996: assume 9 == __main_~c~1#1;__main_~linepos~0#1 := 1 + (7 + __main_~linepos~0#1 - __main_~linepos~0#1 % 8); [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996: assume !(9 == __main_~c~1#1);call __main_#t~mem222#1 := read~int(__main_~#counts~0#1.base, 16 + __main_~#counts~0#1.offset, 4); [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2369: assume !(0 == fclose_if_not_stdin_~r~0#1);call write~int(5, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2369: assume !!(0 == fclose_if_not_stdin_~r~0#1); [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766: assume -1 == getopt32_~c~0#1; [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766: 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:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3130: assume !(4294967295 / (xstrtou_range_sfx_#t~mem254#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem254#1; [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3130: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem254#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem254#1;call xstrtou_range_sfx_#t~mem255#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~1#1 := xstrtou_range_sfx_~r~1#1 * xstrtou_range_sfx_#t~mem255#1;havoc xstrtou_range_sfx_#t~mem255#1; [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2965: assume !(0 == __main_~return_value_ferror$2~0#1); [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2965: assume !!(0 == __main_~return_value_ferror$2~0#1); [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: havoc fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3164: havoc _IO_getc_#t~nondet262#1;__main_#t~ret217#1 := _IO_getc_#res#1;havoc _IO_getc_#t~nondet262#1, _IO_getc_~stream#1.base, _IO_getc_~stream#1.offset;havoc _IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset;assume { :end_inline__IO_getc } true;assume -2147483648 <= __main_#t~ret217#1 && __main_#t~ret217#1 <= 2147483647;__main_~c~1#1 := __main_#t~ret217#1;havoc __main_#t~ret217#1; [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3032: assume (if __main_~u~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~u~0#1 % 4294967296 % 18446744073709551616 else __main_~u~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) < 5; [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3032: assume !((if __main_~u~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~u~0#1 % 4294967296 % 18446744073709551616 else __main_~u~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) < 5);assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2372: assume !(fclose_if_not_stdin_~f#1.base == ~stdin~0.base && fclose_if_not_stdin_~f#1.offset == ~stdin~0.offset);assume -2147483648 <= fclose_if_not_stdin_#t~nondet73#1 && fclose_if_not_stdin_#t~nondet73#1 <= 2147483647;fclose_if_not_stdin_~return_value_fclose$1~0#1 := fclose_if_not_stdin_#t~nondet73#1;havoc fclose_if_not_stdin_#t~nondet73#1; [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2372: assume !!(fclose_if_not_stdin_~f#1.base == ~stdin~0.base && fclose_if_not_stdin_~f#1.offset == ~stdin~0.offset); [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3099: havoc xstrtou_range_sfx_~tmp_if_expr$3~2#1;havoc xstrtou_range_sfx_~tmp_statement_expression$2~0#1; [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-1: SUMMARY for call bb_simple_perror_msg(__main_~arg~0#1.base, __main_~arg~0#1.offset); srcloc: null [2025-02-08 13:30:51,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: __main_~status~0#1 := 1; [2025-02-08 13:30:51,139 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2770: assume true;call getopt32_#t~mem160#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:30:51,139 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2770: assume !true; [2025-02-08 13:30:51,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2770-2: assume !!((if getopt32_#t~mem160#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem160#1 % 256 % 4294967296 else getopt32_#t~mem160#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem160#1; [2025-02-08 13:30:51,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2770-2: assume !((if getopt32_#t~mem160#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem160#1 % 256 % 4294967296 else getopt32_#t~mem160#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem160#1;call getopt32_#t~mem161#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:30:51,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3101: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);xstrtou_range_sfx_~tmp_if_expr$3~2#1 := 1; [2025-02-08 13:30:51,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3101: assume !!(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);call xstrtou_range_sfx_#t~mem246#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:30:51,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3002: assume !(__main_#t~mem222#1 % 4294967296 >= __main_~linepos~0#1 % 4294967296);havoc __main_#t~mem222#1;call write~int(__main_~linepos~0#1, __main_~#counts~0#1.base, 16 + __main_~#counts~0#1.offset, 4); [2025-02-08 13:30:51,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3002: assume !!(__main_#t~mem222#1 % 4294967296 >= __main_~linepos~0#1 % 4294967296);havoc __main_#t~mem222#1; [2025-02-08 13:30:51,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3035: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 13:30:51,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2936-1: assume true; [2025-02-08 13:30:51,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2936-1: assume !true; [2025-02-08 13:30:51,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2771: assume 0 == (if getopt32_#t~mem161#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem161#1 % 256 % 4294967296 else getopt32_#t~mem161#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem161#1; [2025-02-08 13:30:51,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2771: assume !(0 == (if getopt32_#t~mem161#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem161#1 % 256 % 4294967296 else getopt32_#t~mem161#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem161#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:30:51,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc fclose_if_not_stdin_#t~bitwise74#1; [2025-02-08 13:30:51,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375-3: [2025-02-08 13:30:51,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375-2: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_#t~bitwise74#1;havoc fclose_if_not_stdin_#t~bitwise74#1; [2025-02-08 13:30:51,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375-5: assume 0 == fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_#t~bitwise74#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:30:51,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375-5: assume !(0 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 13:30:51,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375-4: havoc fclose_if_not_stdin_#t~bitwise74#1;assume (((((fclose_if_not_stdin_~r~0#1 < 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 >= 0) || fclose_if_not_stdin_#t~bitwise74#1 >= fclose_if_not_stdin_~return_value_fclose$1~0#1) && ((fclose_if_not_stdin_~r~0#1 >= 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 < 0) || fclose_if_not_stdin_#t~bitwise74#1 >= fclose_if_not_stdin_~r~0#1)) && ((fclose_if_not_stdin_~r~0#1 < 0 || fclose_if_not_stdin_~return_value_fclose$1~0#1 < 0) || fclose_if_not_stdin_#t~bitwise74#1 <= fclose_if_not_stdin_~r~0#1 + fclose_if_not_stdin_~return_value_fclose$1~0#1)) && ((fclose_if_not_stdin_~r~0#1 >= 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 >= 0) || fclose_if_not_stdin_#t~bitwise74#1 < 0)) && fclose_if_not_stdin_#t~bitwise74#1 <= 2147483647; [2025-02-08 13:30:51,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375-6: assume 0 == fclose_if_not_stdin_~r~0#1 || fclose_if_not_stdin_~r~0#1 == fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_#t~bitwise74#1 := fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:30:51,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375-6: assume !(0 == fclose_if_not_stdin_~r~0#1 || fclose_if_not_stdin_~r~0#1 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 13:30:51,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036: call __main_#t~mem235#1 := read~int(__main_~#totals~0#1.base, __main_~#totals~0#1.offset + 4 * (if __main_~u~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~u~0#1 % 4294967296 % 18446744073709551616 else __main_~u~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 4);call __main_#t~mem236#1 := read~int(__main_~pcounts~0#1.base, __main_~pcounts~0#1.offset + 4 * (if __main_~u~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~u~0#1 % 4294967296 % 18446744073709551616 else __main_~u~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 4);call write~int(__main_#t~mem235#1 + __main_#t~mem236#1, __main_~#totals~0#1.base, __main_~#totals~0#1.offset + 4 * (if __main_~u~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~u~0#1 % 4294967296 % 18446744073709551616 else __main_~u~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 4);havoc __main_#t~mem235#1;havoc __main_#t~mem236#1;__main_~u~0#1 := 1 + __main_~u~0#1; [2025-02-08 13:30:51,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937: havoc __main_~fp~2#1.base, __main_~fp~2#1.offset, __main_~s~2#1.base, __main_~s~2#1.offset, __main_~u~0#1, __main_~linepos~0#1, __main_~in_word~0#1; [2025-02-08 13:30:51,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3136: assume 0 == xstrtou_range_sfx_#t~mem257#1;havoc xstrtou_range_sfx_#t~mem256#1.base, xstrtou_range_sfx_#t~mem256#1.offset;havoc xstrtou_range_sfx_#t~mem257#1; [2025-02-08 13:30:51,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3136: assume !(0 == xstrtou_range_sfx_#t~mem257#1);havoc xstrtou_range_sfx_#t~mem256#1.base, xstrtou_range_sfx_#t~mem256#1.offset;havoc xstrtou_range_sfx_#t~mem257#1; [2025-02-08 13:30:51,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3136-1: call xstrtou_range_sfx_#t~mem256#1.base, xstrtou_range_sfx_#t~mem256#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem257#1 := read~int(xstrtou_range_sfx_#t~mem256#1.base, xstrtou_range_sfx_#t~mem256#1.offset, 1); [2025-02-08 13:30:51,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3004: assume 10 == __main_~c~1#1;call __main_#t~mem223#1 := read~int(__main_~#counts~0#1.base, __main_~#counts~0#1.offset, 4);call write~int(1 + __main_#t~mem223#1, __main_~#counts~0#1.base, __main_~#counts~0#1.offset, 4); [2025-02-08 13:30:51,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3004: assume !(10 == __main_~c~1#1); [2025-02-08 13:30:51,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-1: [2025-02-08 13:30:51,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: assume 0 != getopt32_#t~bitwise163#1 % 4294967296;havoc getopt32_#t~mem162#1;havoc getopt32_#t~bitwise163#1; [2025-02-08 13:30:51,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: assume !(0 != getopt32_#t~bitwise163#1 % 4294967296);havoc getopt32_#t~mem162#1;havoc getopt32_#t~bitwise163#1;call getopt32_#t~mem164#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem165#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:30:51,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-3: assume getopt32_#t~mem162#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise163#1 := getopt32_#t~mem162#1; [2025-02-08 13:30:51,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-3: assume !(getopt32_#t~mem162#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:30:51,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-2: havoc getopt32_#t~bitwise163#1;assume getopt32_#t~bitwise163#1 % 4294967296 <= getopt32_#t~mem162#1 % 4294967296 && getopt32_#t~bitwise163#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:30:51,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-5: call getopt32_#t~mem162#1 := read~int(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:30:51,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-4: assume 0 == getopt32_#t~mem162#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise163#1 := 0; [2025-02-08 13:30:51,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-4: assume !(0 == getopt32_#t~mem162#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:30:51,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2377-1: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:30:51,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3038: assume !(__main_~u~0#1 % 4294967296 < 5); [2025-02-08 13:30:51,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3038: assume !!(__main_~u~0#1 % 4294967296 < 5); [2025-02-08 13:30:51,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: call __main_#t~mem219#1 := read~int(__main_~#counts~0#1.base, 12 + __main_~#counts~0#1.offset, 4);call write~int(1 + __main_#t~mem219#1, __main_~#counts~0#1.base, 12 + __main_~#counts~0#1.offset, 4);havoc __main_#t~mem219#1; [2025-02-08 13:30:51,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: 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:30:51,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3105-1: assume xstrtou_range_sfx_#t~mem246#1 - 9 >= -2147483648; [2025-02-08 13:30:51,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3105-1: assume !(xstrtou_range_sfx_#t~mem246#1 - 9 >= -2147483648); [2025-02-08 13:30:51,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3105: assume xstrtou_range_sfx_#t~mem246#1 - 9 <= 2147483647;xstrtou_range_sfx_~bb__isspace~0#1 := xstrtou_range_sfx_#t~mem246#1 - 9;havoc xstrtou_range_sfx_#t~mem246#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~2#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:30:51,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3105: assume !(xstrtou_range_sfx_#t~mem246#1 - 9 <= 2147483647); [2025-02-08 13:30:51,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3006: assume !(11 == __main_~c~1#1);__main_~linepos~0#1 := 0; [2025-02-08 13:30:51,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3006: assume !!(11 == __main_~c~1#1); [2025-02-08 13:30:51,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2973: assume 2 == (if ~unicode_status~0 % 256 % 4294967296 <= 2147483647 then ~unicode_status~0 % 256 % 4294967296 else ~unicode_status~0 % 256 % 4294967296 - 4294967296); [2025-02-08 13:30:51,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2973: assume !(2 == (if ~unicode_status~0 % 256 % 4294967296 <= 2147483647 then ~unicode_status~0 % 256 % 4294967296 else ~unicode_status~0 % 256 % 4294967296 - 4294967296));call __main_#t~mem221#1 := read~int(__main_~#counts~0#1.base, 8 + __main_~#counts~0#1.offset, 4);call write~int(1 + __main_#t~mem221#1, __main_~#counts~0#1.base, 8 + __main_~#counts~0#1.offset, 4);havoc __main_#t~mem221#1; [2025-02-08 13:30:51,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2775-1: [2025-02-08 13:30:51,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2775: getopt32_~trigger~0#1 := getopt32_#t~bitwise166#1;havoc getopt32_#t~mem164#1;havoc getopt32_#t~mem165#1;havoc getopt32_#t~bitwise166#1;call getopt32_#t~mem167#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:30:51,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2775-3: assume getopt32_#t~mem164#1 % 4294967296 == getopt32_#t~mem165#1 % 4294967296;getopt32_#t~bitwise166#1 := getopt32_#t~mem164#1; [2025-02-08 13:30:51,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2775-3: assume !(getopt32_#t~mem164#1 % 4294967296 == getopt32_#t~mem165#1 % 4294967296); [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2775-2: havoc getopt32_#t~bitwise166#1;assume getopt32_#t~bitwise166#1 % 4294967296 <= getopt32_#t~mem164#1 % 4294967296 && getopt32_#t~bitwise166#1 % 4294967296 <= getopt32_#t~mem165#1 % 4294967296; [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2775-4: assume 0 == getopt32_#t~mem164#1 % 4294967296 || 0 == getopt32_#t~mem165#1 % 4294967296;getopt32_#t~bitwise166#1 := 0; [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2775-4: assume !(0 == getopt32_#t~mem164#1 % 4294967296 || 0 == getopt32_#t~mem165#1 % 4294967296); [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2280: 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:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2280: assume !(bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295);bb_strtoui_#res#1 := bb_strtoui_~v~0#1; [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776: getopt32_~flags~0#1 := getopt32_#t~bitwise169#1;havoc getopt32_#t~mem167#1;havoc getopt32_#t~bitwise168#1;havoc getopt32_#t~bitwise169#1;call getopt32_#t~mem170#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-2: havoc getopt32_#t~bitwise169#1;assume getopt32_#t~bitwise169#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise169#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise168#1) % 4294967296; [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-1: [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise168#1) % 4294967296;getopt32_#t~bitwise169#1 := 0; [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise168#1) % 4294967296); [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise168#1) % 4294967296;getopt32_#t~bitwise169#1 := getopt32_~flags~0#1; [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise168#1) % 4294967296); [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-6: havoc getopt32_#t~bitwise168#1;assume getopt32_#t~bitwise168#1 % 4294967296 <= getopt32_#t~mem167#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-5: [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise168#1 := getopt32_#t~mem167#1; [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-7: assume getopt32_#t~mem167#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise168#1 := 0; [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-7: assume !(getopt32_#t~mem167#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-9: assume 0 == getopt32_#t~mem167#1 % 4294967296;getopt32_#t~bitwise168#1 := getopt32_~trigger~0#1; [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-9: assume !(0 == getopt32_#t~mem167#1 % 4294967296); [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3140: assume xstrtou_range_sfx_~r~1#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:30:51,149 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3140: assume !(xstrtou_range_sfx_~r~1#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:30:51,256 INFO L? ?]: Removed 467 outVars from TransFormulas that were not future-live. [2025-02-08 13:30:51,257 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:30:51,283 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:30:51,283 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:30:51,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:30:51 BoogieIcfgContainer [2025-02-08 13:30:51,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:30:51,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:30:51,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:30:51,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:30:51,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:30:43" (1/3) ... [2025-02-08 13:30:51,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6498a1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:30:51, skipping insertion in model container [2025-02-08 13:30:51,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:44" (2/3) ... [2025-02-08 13:30:51,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6498a1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:30:51, skipping insertion in model container [2025-02-08 13:30:51,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:30:51" (3/3) ... [2025-02-08 13:30:51,291 INFO L128 eAbstractionObserver]: Analyzing ICFG wc-1.i [2025-02-08 13:30:51,301 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:30:51,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG wc-1.i that has 8 procedures, 434 locations, 1 initial locations, 33 loop locations, and 74 error locations. [2025-02-08 13:30:51,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:30:51,366 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;@24f848fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:30:51,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-02-08 13:30:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 434 states, 325 states have (on average 1.7076923076923076) internal successors, (555), 413 states have internal predecessors, (555), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 13:30:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:30:51,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:51,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:30:51,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:30:51,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash 974101, now seen corresponding path program 1 times [2025-02-08 13:30:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:51,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211330709] [2025-02-08 13:30:51,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:51,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:51,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:30:52,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:30:52,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:52,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:52,347 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:30:52,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:52,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211330709] [2025-02-08 13:30:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211330709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:52,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:52,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:30:52,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380514127] [2025-02-08 13:30:52,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:52,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:52,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:52,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:52,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:52,365 INFO L87 Difference]: Start difference. First operand has 434 states, 325 states have (on average 1.7076923076923076) internal successors, (555), 413 states have internal predecessors, (555), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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:30:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:52,467 INFO L93 Difference]: Finished difference Result 665 states and 907 transitions. [2025-02-08 13:30:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:52,469 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:30:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:52,476 INFO L225 Difference]: With dead ends: 665 [2025-02-08 13:30:52,477 INFO L226 Difference]: Without dead ends: 214 [2025-02-08 13:30:52,480 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:30:52,484 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 570 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:30:52,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 570 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-08 13:30:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-02-08 13:30:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 168 states have (on average 1.5297619047619047) internal successors, (257), 201 states have internal predecessors, (257), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 272 transitions. [2025-02-08 13:30:52,532 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 272 transitions. Word has length 3 [2025-02-08 13:30:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:52,533 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 272 transitions. [2025-02-08 13:30:52,533 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:30:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 272 transitions. [2025-02-08 13:30:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:30:52,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:52,533 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:30:52,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:30:52,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:30:52,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1044418467, now seen corresponding path program 1 times [2025-02-08 13:30:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:52,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500297154] [2025-02-08 13:30:52,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:53,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:30:53,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:30:53,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:53,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:53,330 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:30:53,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500297154] [2025-02-08 13:30:53,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500297154] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320599499] [2025-02-08 13:30:53,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:53,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:53,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:53,337 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:30:53,338 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:30:53,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:30:54,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:30:54,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:54,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:54,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 1534 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:54,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:54,081 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:30:54,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:54,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320599499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:54,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:54,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:30:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370819277] [2025-02-08 13:30:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:54,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:30:54,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:54,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:30:54,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:54,084 INFO L87 Difference]: Start difference. First operand 214 states and 272 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:30:58,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:58,194 INFO L93 Difference]: Finished difference Result 214 states and 272 transitions. [2025-02-08 13:30:58,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:30:58,195 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:30:58,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:58,196 INFO L225 Difference]: With dead ends: 214 [2025-02-08 13:30:58,196 INFO L226 Difference]: Without dead ends: 213 [2025-02-08 13:30:58,196 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:30:58,197 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:58,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 775 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-08 13:30:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-02-08 13:30:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 168 states have (on average 1.5238095238095237) internal successors, (256), 200 states have internal predecessors, (256), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 271 transitions. [2025-02-08 13:30:58,204 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 271 transitions. Word has length 6 [2025-02-08 13:30:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:58,205 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 271 transitions. [2025-02-08 13:30:58,205 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:30:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 271 transitions. [2025-02-08 13:30:58,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:30:58,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:58,205 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:30:58,219 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:30:58,406 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:30:58,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:30:58,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:58,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1982766807, now seen corresponding path program 1 times [2025-02-08 13:30:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:58,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47391036] [2025-02-08 13:30:58,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:58,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:58,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:30:58,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:30:58,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:58,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:58,961 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:30:58,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:58,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47391036] [2025-02-08 13:30:58,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47391036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:58,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:58,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266713187] [2025-02-08 13:30:58,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:58,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:58,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:58,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:58,963 INFO L87 Difference]: Start difference. First operand 213 states and 271 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:30:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:59,025 INFO L93 Difference]: Finished difference Result 213 states and 271 transitions. [2025-02-08 13:30:59,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:59,025 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:30:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:59,026 INFO L225 Difference]: With dead ends: 213 [2025-02-08 13:30:59,026 INFO L226 Difference]: Without dead ends: 212 [2025-02-08 13:30:59,026 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:30:59,027 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 518 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:59,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 518 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-08 13:30:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2025-02-08 13:30:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 166 states have (on average 1.5240963855421688) internal successors, (253), 197 states have internal predecessors, (253), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 268 transitions. [2025-02-08 13:30:59,035 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 268 transitions. Word has length 7 [2025-02-08 13:30:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:59,035 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 268 transitions. [2025-02-08 13:30:59,035 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:30:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 268 transitions. [2025-02-08 13:30:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:30:59,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:59,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:59,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:30:59,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:30:59,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1783226444, now seen corresponding path program 1 times [2025-02-08 13:30:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242176493] [2025-02-08 13:30:59,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:59,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:59,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:59,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:59,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:59,599 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:30:59,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:59,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242176493] [2025-02-08 13:30:59,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242176493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:59,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166576079] [2025-02-08 13:30:59,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:59,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:59,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:59,604 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:30:59,605 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:00,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:31:00,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:31:00,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:00,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:00,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:31:00,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:00,558 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:00,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166576079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:00,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:00,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:31:00,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212005430] [2025-02-08 13:31:00,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:00,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:00,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:00,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:00,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:00,559 INFO L87 Difference]: Start difference. First operand 210 states and 268 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:04,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:04,690 INFO L93 Difference]: Finished difference Result 210 states and 268 transitions. [2025-02-08 13:31:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:04,691 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:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:04,692 INFO L225 Difference]: With dead ends: 210 [2025-02-08 13:31:04,692 INFO L226 Difference]: Without dead ends: 208 [2025-02-08 13:31:04,692 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:04,693 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 216 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:04,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 292 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:31:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-08 13:31:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-02-08 13:31:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 166 states have (on average 1.5120481927710843) internal successors, (251), 195 states have internal predecessors, (251), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. [2025-02-08 13:31:04,700 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 266 transitions. Word has length 11 [2025-02-08 13:31:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:04,701 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 266 transitions. [2025-02-08 13:31:04,701 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:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 266 transitions. [2025-02-08 13:31:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:31:04,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:04,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:04,711 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:04,902 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:04,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:31:04,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:04,903 INFO L85 PathProgramCache]: Analyzing trace with hash -554554174, now seen corresponding path program 1 times [2025-02-08 13:31:04,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:04,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387559206] [2025-02-08 13:31:04,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:04,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:05,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:31:05,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:31:05,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:05,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:05,362 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:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:05,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387559206] [2025-02-08 13:31:05,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387559206] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:05,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895511160] [2025-02-08 13:31:05,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:05,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:05,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:05,365 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:05,366 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:05,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:31:06,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:31:06,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:06,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:06,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:06,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:06,060 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:06,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:06,095 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:06,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895511160] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:06,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:06,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:31:06,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427326276] [2025-02-08 13:31:06,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:06,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:31:06,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:06,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:31:06,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:06,096 INFO L87 Difference]: Start difference. First operand 208 states and 266 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:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:06,139 INFO L93 Difference]: Finished difference Result 420 states and 538 transitions. [2025-02-08 13:31:06,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:06,139 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:06,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:06,140 INFO L225 Difference]: With dead ends: 420 [2025-02-08 13:31:06,140 INFO L226 Difference]: Without dead ends: 217 [2025-02-08 13:31:06,141 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:06,141 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:06,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 514 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-08 13:31:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-02-08 13:31:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 204 states have internal predecessors, (260), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 275 transitions. [2025-02-08 13:31:06,148 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 275 transitions. Word has length 12 [2025-02-08 13:31:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:06,148 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 275 transitions. [2025-02-08 13:31:06,148 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:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 275 transitions. [2025-02-08 13:31:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:31:06,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:06,149 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:06,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:31:06,353 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:06,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:31:06,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash -891148934, now seen corresponding path program 2 times [2025-02-08 13:31:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:06,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290017466] [2025-02-08 13:31:06,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:06,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:06,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:31:06,661 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:06,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:31:06,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:06,967 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:06,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:06,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290017466] [2025-02-08 13:31:06,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290017466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:06,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:06,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:31:06,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120468578] [2025-02-08 13:31:06,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:06,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:31:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:06,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:31:06,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:06,968 INFO L87 Difference]: Start difference. First operand 217 states and 275 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:10,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:11,130 INFO L93 Difference]: Finished difference Result 217 states and 275 transitions. [2025-02-08 13:31:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:31:11,131 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:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:11,132 INFO L225 Difference]: With dead ends: 217 [2025-02-08 13:31:11,132 INFO L226 Difference]: Without dead ends: 215 [2025-02-08 13:31:11,132 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:11,132 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 215 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:11,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 781 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:31:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-08 13:31:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-02-08 13:31:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 175 states have (on average 1.4742857142857142) internal successors, (258), 202 states have internal predecessors, (258), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 273 transitions. [2025-02-08 13:31:11,140 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 273 transitions. Word has length 21 [2025-02-08 13:31:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:11,140 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 273 transitions. [2025-02-08 13:31:11,140 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:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 273 transitions. [2025-02-08 13:31:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:31:11,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:11,140 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:11,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:31:11,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:31:11,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash -645848529, now seen corresponding path program 1 times [2025-02-08 13:31:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:11,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935507844] [2025-02-08 13:31:11,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:11,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:31:11,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:31:11,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:11,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:11,636 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:11,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:11,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935507844] [2025-02-08 13:31:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935507844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:31:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766880900] [2025-02-08 13:31:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:11,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:11,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:11,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:11,638 INFO L87 Difference]: Start difference. First operand 215 states and 273 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:15,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:15,738 INFO L93 Difference]: Finished difference Result 414 states and 531 transitions. [2025-02-08 13:31:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:15,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:31:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:15,740 INFO L225 Difference]: With dead ends: 414 [2025-02-08 13:31:15,741 INFO L226 Difference]: Without dead ends: 218 [2025-02-08 13:31:15,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:15,742 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 2 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:15,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 507 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:31:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-08 13:31:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-08 13:31:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 178 states have (on average 1.4662921348314606) internal successors, (261), 205 states have internal predecessors, (261), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 276 transitions. [2025-02-08 13:31:15,750 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 276 transitions. Word has length 26 [2025-02-08 13:31:15,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:15,750 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 276 transitions. [2025-02-08 13:31:15,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:15,751 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 276 transitions. [2025-02-08 13:31:15,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:31:15,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:15,751 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:15,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:31:15,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:31:15,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash 985618867, now seen corresponding path program 1 times [2025-02-08 13:31:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:15,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54063805] [2025-02-08 13:31:15,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:16,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:16,200 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,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:16,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:31:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:16,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54063805] [2025-02-08 13:31:16,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54063805] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:16,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761586121] [2025-02-08 13:31:16,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:16,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:16,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:16,456 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,458 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,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:17,403 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,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:17,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:17,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1719 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:31:17,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 13:31:17,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761586121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:17,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:17,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:31:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828838723] [2025-02-08 13:31:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:17,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:17,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:17,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:17,447 INFO L87 Difference]: Start difference. First operand 218 states and 276 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,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:21,577 INFO L93 Difference]: Finished difference Result 218 states and 276 transitions. [2025-02-08 13:31:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:21,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 13:31:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:21,578 INFO L225 Difference]: With dead ends: 218 [2025-02-08 13:31:21,580 INFO L226 Difference]: Without dead ends: 217 [2025-02-08 13:31:21,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:21,581 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 3 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:21,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 497 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:31:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-08 13:31:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-02-08 13:31:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 178 states have (on average 1.4606741573033708) internal successors, (260), 204 states have internal predecessors, (260), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 275 transitions. [2025-02-08 13:31:21,588 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 275 transitions. Word has length 29 [2025-02-08 13:31:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:21,588 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 275 transitions. [2025-02-08 13:31:21,588 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,588 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 275 transitions. [2025-02-08 13:31:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:31:21,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:21,589 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:21,604 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:21,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 13:31:21,797 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:31:21,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash 985619027, now seen corresponding path program 1 times [2025-02-08 13:31:21,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:21,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231263819] [2025-02-08 13:31:21,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:22,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:22,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:22,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:22,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:22,396 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:22,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:22,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231263819] [2025-02-08 13:31:22,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231263819] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:22,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991509609] [2025-02-08 13:31:22,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:22,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:22,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:22,398 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:22,408 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,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:23,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:23,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:23,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:23,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 1737 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:31:23,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:23,516 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:23,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:23,718 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:23,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991509609] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:23,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:23,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:31:23,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62882888] [2025-02-08 13:31:23,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:23,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:31:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:23,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:31:23,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:31:23,722 INFO L87 Difference]: Start difference. First operand 217 states and 275 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:27,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:31,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:32,137 INFO L93 Difference]: Finished difference Result 437 states and 559 transitions. [2025-02-08 13:31:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:31:32,138 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:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:32,139 INFO L225 Difference]: With dead ends: 437 [2025-02-08 13:31:32,139 INFO L226 Difference]: Without dead ends: 234 [2025-02-08 13:31:32,139 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:32,140 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 5 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:32,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1484 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-02-08 13:31:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-08 13:31:32,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-02-08 13:31:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 196 states have (on average 1.413265306122449) internal successors, (277), 221 states have internal predecessors, (277), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 292 transitions. [2025-02-08 13:31:32,145 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 292 transitions. Word has length 29 [2025-02-08 13:31:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:32,146 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 292 transitions. [2025-02-08 13:31:32,146 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:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2025-02-08 13:31:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:31:32,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:32,147 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:32,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 13:31:32,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:32,351 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:31:32,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash -590129421, now seen corresponding path program 1 times [2025-02-08 13:31:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:32,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903952681] [2025-02-08 13:31:32,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:32,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:32,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:31:32,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:31:32,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:32,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:32,773 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:32,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:32,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903952681] [2025-02-08 13:31:32,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903952681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:32,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:32,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867268022] [2025-02-08 13:31:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:32,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:32,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:32,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:32,775 INFO L87 Difference]: Start difference. First operand 234 states and 292 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:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:32,815 INFO L93 Difference]: Finished difference Result 351 states and 447 transitions. [2025-02-08 13:31:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:32,815 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:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:32,817 INFO L225 Difference]: With dead ends: 351 [2025-02-08 13:31:32,817 INFO L226 Difference]: Without dead ends: 349 [2025-02-08 13:31:32,817 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:32,818 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 140 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 503 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:32,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 503 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:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-08 13:31:32,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 238. [2025-02-08 13:31:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 200 states have (on average 1.41) internal successors, (282), 225 states have internal predecessors, (282), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 297 transitions. [2025-02-08 13:31:32,824 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 297 transitions. Word has length 47 [2025-02-08 13:31:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:32,824 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 297 transitions. [2025-02-08 13:31:32,824 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:32,824 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 297 transitions. [2025-02-08 13:31:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:31:32,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:32,825 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:32,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:31:32,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:31:32,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:32,826 INFO L85 PathProgramCache]: Analyzing trace with hash 412512044, now seen corresponding path program 1 times [2025-02-08 13:31:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:32,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258901548] [2025-02-08 13:31:32,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:32,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:33,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:31:33,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:31:33,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:33,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:33,332 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:33,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:33,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258901548] [2025-02-08 13:31:33,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258901548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:33,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:33,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:33,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386380376] [2025-02-08 13:31:33,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:33,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:33,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:33,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:33,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:33,333 INFO L87 Difference]: Start difference. First operand 238 states and 297 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:37,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:37,465 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2025-02-08 13:31:37,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:37,465 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:37,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:37,467 INFO L225 Difference]: With dead ends: 249 [2025-02-08 13:31:37,467 INFO L226 Difference]: Without dead ends: 248 [2025-02-08 13:31:37,467 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:37,467 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:37,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 501 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:31:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-08 13:31:37,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2025-02-08 13:31:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 209 states have (on average 1.4066985645933014) internal successors, (294), 234 states have internal predecessors, (294), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2025-02-08 13:31:37,477 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 48 [2025-02-08 13:31:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:37,477 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2025-02-08 13:31:37,477 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:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2025-02-08 13:31:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:31:37,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:37,479 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:37,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:31:37,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:31:37,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash 412517009, now seen corresponding path program 1 times [2025-02-08 13:31:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566433474] [2025-02-08 13:31:37,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:37,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:31:37,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:31:37,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:37,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:37,911 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:37,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:37,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566433474] [2025-02-08 13:31:37,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566433474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:37,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:37,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:37,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163587000] [2025-02-08 13:31:37,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:37,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:37,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:37,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:37,914 INFO L87 Difference]: Start difference. First operand 247 states and 309 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:41,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:42,020 INFO L93 Difference]: Finished difference Result 247 states and 309 transitions. [2025-02-08 13:31:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:42,021 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:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:42,022 INFO L225 Difference]: With dead ends: 247 [2025-02-08 13:31:42,022 INFO L226 Difference]: Without dead ends: 246 [2025-02-08 13:31:42,022 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:42,023 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:42,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 503 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:31:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-08 13:31:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2025-02-08 13:31:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 205 states have (on average 1.4048780487804877) internal successors, (288), 229 states have internal predecessors, (288), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 303 transitions. [2025-02-08 13:31:42,041 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 303 transitions. Word has length 48 [2025-02-08 13:31:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:42,042 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 303 transitions. [2025-02-08 13:31:42,042 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:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 303 transitions. [2025-02-08 13:31:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 13:31:42,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:42,042 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, 1, 1] [2025-02-08 13:31:42,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:31:42,042 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:31:42,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash 103377335, now seen corresponding path program 1 times [2025-02-08 13:31:42,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:42,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275379625] [2025-02-08 13:31:42,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:42,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:42,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 13:31:42,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 13:31:42,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:42,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:43,000 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:43,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:43,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275379625] [2025-02-08 13:31:43,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275379625] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:43,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074419569] [2025-02-08 13:31:43,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:43,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:43,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:43,015 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:43,016 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:43,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 13:31:44,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 13:31:44,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:44,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:44,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 1882 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:44,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:44,250 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:44,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:44,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074419569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:44,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:44,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:31:44,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304111811] [2025-02-08 13:31:44,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:44,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:31:44,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:44,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:31:44,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:44,253 INFO L87 Difference]: Start difference. First operand 242 states and 303 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:44,324 INFO L93 Difference]: Finished difference Result 353 states and 451 transitions. [2025-02-08 13:31:44,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:31:44,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 51 [2025-02-08 13:31:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:44,325 INFO L225 Difference]: With dead ends: 353 [2025-02-08 13:31:44,325 INFO L226 Difference]: Without dead ends: 352 [2025-02-08 13:31:44,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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:44,327 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 279 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:44,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 759 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-08 13:31:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 241. [2025-02-08 13:31:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 205 states have (on average 1.4) internal successors, (287), 228 states have internal predecessors, (287), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 302 transitions. [2025-02-08 13:31:44,338 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 302 transitions. Word has length 51 [2025-02-08 13:31:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:44,338 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 302 transitions. [2025-02-08 13:31:44,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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,338 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 302 transitions. [2025-02-08 13:31:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 13:31:44,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:44,338 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, 1, 1] [2025-02-08 13:31:44,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:31:44,539 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:44,539 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:31:44,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1090269058, now seen corresponding path program 1 times [2025-02-08 13:31:44,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:44,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124195532] [2025-02-08 13:31:44,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:44,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:44,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 13:31:44,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 13:31:44,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:44,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:45,074 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:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124195532] [2025-02-08 13:31:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124195532] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971062962] [2025-02-08 13:31:45,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:45,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:45,078 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:45,081 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:45,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 13:31:45,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 13:31:45,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:45,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:45,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 1883 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:45,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:45,984 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:45,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:46,058 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:46,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971062962] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:46,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:46,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:31:46,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300186934] [2025-02-08 13:31:46,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:46,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:31:46,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:46,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:31:46,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:46,059 INFO L87 Difference]: Start difference. First operand 241 states and 302 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:46,320 INFO L93 Difference]: Finished difference Result 698 states and 912 transitions. [2025-02-08 13:31:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:46,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-02-08 13:31:46,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:46,324 INFO L225 Difference]: With dead ends: 698 [2025-02-08 13:31:46,324 INFO L226 Difference]: Without dead ends: 697 [2025-02-08 13:31:46,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 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:46,325 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 937 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:46,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 1152 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:31:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-02-08 13:31:46,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 253. [2025-02-08 13:31:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 217 states have (on average 1.391705069124424) internal successors, (302), 240 states have internal predecessors, (302), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 317 transitions. [2025-02-08 13:31:46,339 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 317 transitions. Word has length 52 [2025-02-08 13:31:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:46,340 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 317 transitions. [2025-02-08 13:31:46,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 317 transitions. [2025-02-08 13:31:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:31:46,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:46,340 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:46,351 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:46,545 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:46,545 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:31:46,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:46,545 INFO L85 PathProgramCache]: Analyzing trace with hash -341549320, now seen corresponding path program 1 times [2025-02-08 13:31:46,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:46,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769251985] [2025-02-08 13:31:46,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:46,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:31:46,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:31:46,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:46,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:31:47,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769251985] [2025-02-08 13:31:47,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769251985] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075832806] [2025-02-08 13:31:47,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:47,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:47,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:47,011 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:47,012 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:47,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:31:47,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:31:47,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:47,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:47,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:47,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:31:47,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:31:48,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075832806] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:48,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:48,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:31:48,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326586764] [2025-02-08 13:31:48,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:48,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:31:48,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:48,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:31:48,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:48,009 INFO L87 Difference]: Start difference. First operand 253 states and 317 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:52,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:56,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:32:00,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:32:04,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:32:08,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:32:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:32:08,255 INFO L93 Difference]: Finished difference Result 482 states and 612 transitions. [2025-02-08 13:32:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:32:08,255 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 55 [2025-02-08 13:32:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:32:08,257 INFO L225 Difference]: With dead ends: 482 [2025-02-08 13:32:08,257 INFO L226 Difference]: Without dead ends: 271 [2025-02-08 13:32:08,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:32:08,259 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 4 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:32:08,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 501 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-02-08 13:32:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-08 13:32:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-02-08 13:32:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 235 states have (on average 1.3617021276595744) internal successors, (320), 258 states have internal predecessors, (320), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:32:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 335 transitions. [2025-02-08 13:32:08,266 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 335 transitions. Word has length 55 [2025-02-08 13:32:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:32:08,267 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 335 transitions. [2025-02-08 13:32:08,267 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:32:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 335 transitions. [2025-02-08 13:32:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 13:32:08,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:32:08,267 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:32:08,279 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:32:08,471 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,SelfDestructingSolverStorable14 [2025-02-08 13:32:08,471 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:32:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:32:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash -674275434, now seen corresponding path program 1 times [2025-02-08 13:32:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:32:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230774494] [2025-02-08 13:32:08,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:32:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:32:08,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 13:32:08,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 13:32:08,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:32:08,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:32:08,903 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:32:08,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:32:08,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230774494] [2025-02-08 13:32:08,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230774494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:32:08,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:32:08,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:32:08,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407141427] [2025-02-08 13:32:08,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:32:08,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:32:08,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:32:08,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:32:08,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:32:08,904 INFO L87 Difference]: Start difference. First operand 271 states and 335 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:32:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:32:09,018 INFO L93 Difference]: Finished difference Result 518 states and 662 transitions. [2025-02-08 13:32:09,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:32:09,018 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), 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 61 [2025-02-08 13:32:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:32:09,020 INFO L225 Difference]: With dead ends: 518 [2025-02-08 13:32:09,020 INFO L226 Difference]: Without dead ends: 364 [2025-02-08 13:32:09,020 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:32:09,021 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 113 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 470 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:32:09,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 470 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:32:09,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-08 13:32:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 313. [2025-02-08 13:32:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 276 states have (on average 1.358695652173913) internal successors, (375), 299 states have internal predecessors, (375), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:32:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 392 transitions. [2025-02-08 13:32:09,029 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 392 transitions. Word has length 61 [2025-02-08 13:32:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:32:09,029 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 392 transitions. [2025-02-08 13:32:09,029 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), 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:32:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 392 transitions. [2025-02-08 13:32:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 13:32:09,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:32:09,029 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, 1, 1] [2025-02-08 13:32:09,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 13:32:09,030 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:32:09,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:32:09,030 INFO L85 PathProgramCache]: Analyzing trace with hash 561396148, now seen corresponding path program 1 times [2025-02-08 13:32:09,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:32:09,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841295967] [2025-02-08 13:32:09,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:32:09,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:32:09,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 13:32:09,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 13:32:09,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:32:09,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:32:09,413 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:32:09,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:32:09,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841295967] [2025-02-08 13:32:09,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841295967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:32:09,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:32:09,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:32:09,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108409772] [2025-02-08 13:32:09,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:32:09,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:32:09,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:32:09,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:32:09,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:32:09,414 INFO L87 Difference]: Start difference. First operand 313 states and 392 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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:32:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:32:09,448 INFO L93 Difference]: Finished difference Result 315 states and 392 transitions. [2025-02-08 13:32:09,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:32:09,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 63 [2025-02-08 13:32:09,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:32:09,450 INFO L225 Difference]: With dead ends: 315 [2025-02-08 13:32:09,450 INFO L226 Difference]: Without dead ends: 313 [2025-02-08 13:32:09,451 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:32:09,451 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 1 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 502 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:32:09,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 502 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:32:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-08 13:32:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-02-08 13:32:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 276 states have (on average 1.3514492753623188) internal successors, (373), 299 states have internal predecessors, (373), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:32:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 390 transitions. [2025-02-08 13:32:09,460 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 390 transitions. Word has length 63 [2025-02-08 13:32:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:32:09,461 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 390 transitions. [2025-02-08 13:32:09,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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:32:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 390 transitions. [2025-02-08 13:32:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 13:32:09,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:32:09,461 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, 1, 1] [2025-02-08 13:32:09,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:32:09,461 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:32:09,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:32:09,462 INFO L85 PathProgramCache]: Analyzing trace with hash -484627022, now seen corresponding path program 2 times [2025-02-08 13:32:09,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:32:09,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614242709] [2025-02-08 13:32:09,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:32:09,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:32:09,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-02-08 13:32:09,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 64 statements. [2025-02-08 13:32:09,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:32:09,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:32:09,922 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:32:09,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:32:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614242709] [2025-02-08 13:32:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614242709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:32:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:32:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:32:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842056327] [2025-02-08 13:32:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:32:09,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:32:09,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:32:09,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:32:09,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:32:09,923 INFO L87 Difference]: Start difference. First operand 313 states and 390 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:32:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:32:09,957 INFO L93 Difference]: Finished difference Result 542 states and 679 transitions. [2025-02-08 13:32:09,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:32:09,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 64 [2025-02-08 13:32:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:32:09,959 INFO L225 Difference]: With dead ends: 542 [2025-02-08 13:32:09,959 INFO L226 Difference]: Without dead ends: 317 [2025-02-08 13:32:09,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:32:09,959 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 26 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:32:09,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 471 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:32:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-08 13:32:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2025-02-08 13:32:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 279 states have (on average 1.3440860215053763) internal successors, (375), 302 states have internal predecessors, (375), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:32:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 392 transitions. [2025-02-08 13:32:09,972 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 392 transitions. Word has length 64 [2025-02-08 13:32:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:32:09,972 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 392 transitions. [2025-02-08 13:32:09,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:32:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 392 transitions. [2025-02-08 13:32:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 13:32:09,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:32:09,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:32:09,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 13:32:09,973 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:32:09,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:32:09,975 INFO L85 PathProgramCache]: Analyzing trace with hash 334283020, now seen corresponding path program 1 times [2025-02-08 13:32:09,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:32:09,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039959698] [2025-02-08 13:32:09,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:32:09,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:32:10,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 13:32:10,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 13:32:10,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:32:10,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:32:10,530 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:32:10,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:32:10,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039959698] [2025-02-08 13:32:10,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039959698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:32:10,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:32:10,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:32:10,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796729976] [2025-02-08 13:32:10,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:32:10,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:32:10,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:32:10,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:32:10,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:32:10,531 INFO L87 Difference]: Start difference. First operand 317 states and 392 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:32:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:32:10,589 INFO L93 Difference]: Finished difference Result 556 states and 699 transitions. [2025-02-08 13:32:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:32:10,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 71 [2025-02-08 13:32:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:32:10,591 INFO L225 Difference]: With dead ends: 556 [2025-02-08 13:32:10,591 INFO L226 Difference]: Without dead ends: 319 [2025-02-08 13:32:10,592 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:32:10,592 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 742 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:32:10,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 742 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:32:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-08 13:32:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-02-08 13:32:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 304 states have internal predecessors, (377), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:32:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 394 transitions. [2025-02-08 13:32:10,604 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 394 transitions. Word has length 71 [2025-02-08 13:32:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:32:10,604 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 394 transitions. [2025-02-08 13:32:10,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:32:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 394 transitions. [2025-02-08 13:32:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 13:32:10,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:32:10,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:32:10,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 13:32:10,605 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:32:10,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:32:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash 79546475, now seen corresponding path program 1 times [2025-02-08 13:32:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:32:10,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416768416] [2025-02-08 13:32:10,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:32:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:32:10,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 13:32:10,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 13:32:10,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:32:10,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:32:11,037 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:32:11,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:32:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416768416] [2025-02-08 13:32:11,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416768416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:32:11,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:32:11,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:32:11,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534583861] [2025-02-08 13:32:11,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:32:11,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:32:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:32:11,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:32:11,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:32:11,038 INFO L87 Difference]: Start difference. First operand 319 states and 394 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:32:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:32:11,106 INFO L93 Difference]: Finished difference Result 561 states and 706 transitions. [2025-02-08 13:32:11,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:32:11,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 71 [2025-02-08 13:32:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:32:11,107 INFO L225 Difference]: With dead ends: 561 [2025-02-08 13:32:11,107 INFO L226 Difference]: Without dead ends: 322 [2025-02-08 13:32:11,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:32:11,108 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 0 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:32:11,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 984 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:32:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-02-08 13:32:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2025-02-08 13:32:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 284 states have (on average 1.3345070422535212) internal successors, (379), 307 states have internal predecessors, (379), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:32:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 396 transitions. [2025-02-08 13:32:11,116 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 396 transitions. Word has length 71 [2025-02-08 13:32:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:32:11,116 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 396 transitions. [2025-02-08 13:32:11,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:32:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 396 transitions. [2025-02-08 13:32:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 13:32:11,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:32:11,117 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:32:11,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 13:32:11,117 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-08 13:32:11,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:32:11,117 INFO L85 PathProgramCache]: Analyzing trace with hash -861828888, now seen corresponding path program 2 times [2025-02-08 13:32:11,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:32:11,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017426122] [2025-02-08 13:32:11,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:32:11,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:32:11,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:32:11,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:32:11,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:32:11,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:32:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:32:11,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:32:11,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017426122] [2025-02-08 13:32:11,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017426122] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:32:11,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865139379] [2025-02-08 13:32:11,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:32:11,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:32:11,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:32:11,541 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:32:11,546 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:32:12,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:32:12,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:32:12,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:32:12,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:32:12,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 1621 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:32:12,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:32:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:32:12,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:32:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:32:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865139379] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:32:12,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:32:12,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 13:32:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982254362] [2025-02-08 13:32:12,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:32:12,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:32:12,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:32:12,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:32:12,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:32:12,712 INFO L87 Difference]: Start difference. First operand 322 states and 396 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:32:16,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:32:20,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []