./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/busybox-1.22.0/wc-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b8000edc920fe8a32bdc36b56c8860a94e8d6d6bafdb81a520b0f73a8e153aaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:44:50,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:44:50,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 04:44:50,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:44:50,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:44:50,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:44:50,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:44:50,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:44:50,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:44:50,583 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:44:50,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:44:50,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:44:50,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:44:50,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:44:50,583 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:44:50,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:44:50,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:44:50,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:44:50,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:44:50,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:44:50,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:44:50,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:44:50,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:44:50,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:44:50,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:44:50,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:44:50,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:44:50,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:44:50,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:44:50,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:44:50,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:44:50,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:44:50,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:44:50,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:44:50,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:44:50,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:44:50,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:44:50,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:44:50,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:44:50,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:44:50,586 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 ! call(reach_error())) ) 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 -> b8000edc920fe8a32bdc36b56c8860a94e8d6d6bafdb81a520b0f73a8e153aaa [2025-02-08 04:44:50,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:44:50,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:44:50,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:44:50,830 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:44:50,831 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:44:50,831 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-2.i [2025-02-08 04:44:51,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30a4b3957/1780c0caf543479a90fa59cb5d94eb38/FLAGeb8f6bdd8 [2025-02-08 04:44:52,388 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:44:52,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i [2025-02-08 04:44:52,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30a4b3957/1780c0caf543479a90fa59cb5d94eb38/FLAGeb8f6bdd8 [2025-02-08 04:44:52,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30a4b3957/1780c0caf543479a90fa59cb5d94eb38 [2025-02-08 04:44:52,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:44:52,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:44:52,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:44:52,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:44:52,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:44:52,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:44:52" (1/1) ... [2025-02-08 04:44:52,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b23cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:52, skipping insertion in model container [2025-02-08 04:44:52,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:44:52" (1/1) ... [2025-02-08 04:44:52,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:44:53,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i[112480,112493] [2025-02-08 04:44:53,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:44:53,384 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:44:53,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i[112480,112493] [2025-02-08 04:44:53,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:44:53,625 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 04:44:53,632 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:44:53,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53 WrapperNode [2025-02-08 04:44:53,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:44:53,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:44:53,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:44:53,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:44:53,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,740 INFO L138 Inliner]: procedures = 577, calls = 806, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 2104 [2025-02-08 04:44:53,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:44:53,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:44:53,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:44:53,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:44:53,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,777 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 04:44:53,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:44:53,876 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:44:53,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:44:53,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:44:53,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (1/1) ... [2025-02-08 04:44:53,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:44:53,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:44:53,929 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 04:44:53,931 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 04:44:53,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:44:53,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 04:44:53,948 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 04:44:53,948 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 04:44:53,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 04:44:53,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 04:44:53,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:44:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:44:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 04:44:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:44:53,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:44:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 04:44:53,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 04:44:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 04:44:53,949 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 04:44:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 04:44:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 04:44:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-08 04:44:53,950 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-08 04:44:53,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-08 04:44:53,950 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-08 04:44:53,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 04:44:53,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 04:44:53,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:44:53,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 04:44:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 04:44:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 04:44:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 04:44:53,951 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 04:44:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 04:44:54,316 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:44:54,317 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:44:54,580 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 04:44:54,580 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 04:44:54,580 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 04:44:54,580 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 04:44:54,580 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 04:44:54,580 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 04:44:54,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2428: assume full_write_~cc~0#1 < 0; [2025-02-08 04:44:54,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2428: assume !(full_write_~cc~0#1 < 0);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 04:44:54,581 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 04:44:54,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3229: write_#res#1 := write_~ret~1#1; [2025-02-08 04:44:54,581 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 04:44:54,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891-1: assume 0 != safe_write_~tmp_if_expr$1~2#1 % 256; [2025-02-08 04:44:54,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891-1: assume !(0 != safe_write_~tmp_if_expr$1~2#1 % 256); [2025-02-08 04:44:54,581 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 04:44:54,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891: assume !true; [2025-02-08 04:44:54,581 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 04:44:54,582 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 04:44:54,582 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 04:44:54,582 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2900-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 04:45:00,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3041: havoc __main_#t~ret237#1;havoc __main_#t~ret237#1; [2025-02-08 04:45:00,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-1: [2025-02-08 04:45:00,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975: assume 128 != __main_#t~bitwise220#1;havoc __main_#t~bitwise220#1; [2025-02-08 04:45:00,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975: assume !(128 != __main_#t~bitwise220#1);havoc __main_#t~bitwise220#1; [2025-02-08 04:45:00,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-3: assume 192 == __main_~c~1#1;__main_#t~bitwise220#1 := 192; [2025-02-08 04:45:00,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-3: assume !(192 == __main_~c~1#1); [2025-02-08 04:45:00,651 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 04:45:00,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-4: assume 0 == __main_~c~1#1;__main_#t~bitwise220#1 := 0; [2025-02-08 04:45:00,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-4: assume !(0 == __main_~c~1#1); [2025-02-08 04:45:00,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-1: [2025-02-08 04:45:00,651 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 04:45:00,651 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 04:45:00,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-3: assume !(0 == getopt32_#t~bitwise171#1 % 4294967296); [2025-02-08 04:45:00,651 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 04:45:00,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-5: [2025-02-08 04:45:00,651 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 04:45:00,651 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 04:45:00,651 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 04:45:00,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-7: assume !(getopt32_#t~mem170#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 04:45:00,652 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 04:45:00,652 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 04:45:00,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-9: assume !(0 == getopt32_#t~mem170#1 % 4294967296); [2025-02-08 04:45:00,652 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 04:45:00,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 04:45:00,652 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 04:45:00,652 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 04:45:00,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-1: [2025-02-08 04:45:00,652 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 04:45:00,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 04:45:00,652 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 04:45:00,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 04:45:00,652 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 04:45:00,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 04:45:00,652 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 04:45:00,652 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 04:45:00,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3109: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 04:45:00,652 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 04:45:00,652 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);call write~int(1 + getopt32_#t~mem177#1, getopt32_#t~mem175#1.base, getopt32_#t~mem175#1.offset, 4); [2025-02-08 04:45:00,652 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 04:45:00,653 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 04:45:00,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3110: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256); [2025-02-08 04:45:00,653 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 04:45:00,653 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 04:45:00,653 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 04:45:00,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 04:45:00,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3014: assume -1 == __main_~c~1#1; [2025-02-08 04:45:00,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3014: assume !(-1 == __main_~c~1#1);havoc __main_~c~1#1; [2025-02-08 04:45:00,654 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 04:45:00,654 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 04:45:00,654 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 04:45:00,654 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 04:45:00,654 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 04:45:00,654 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 04:45:00,654 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 04:45:00,654 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 04:45:00,655 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 04:45:00,655 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 04:45:00,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2950: assume !(__main_~fp~2#1.base == 0 && __main_~fp~2#1.offset == 0); [2025-02-08 04:45:00,655 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 04:45:00,655 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 04:45:00,655 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 04:45:00,655 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 04:45:00,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume !((4294967264 + __main_~c~1#1) % 4294967296 <= 94); [2025-02-08 04:45:00,655 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 04:45:00,655 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 04:45:00,655 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 04:45:00,656 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 04:45:00,656 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 04:45:00,656 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 04:45:00,656 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 04:45:00,656 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 04:45:00,656 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 04:45:00,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume !(32 == __main_~c~1#1);__main_~in_word~0#1 := 1; [2025-02-08 04:45:00,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume !!(32 == __main_~c~1#1); [2025-02-08 04:45:00,656 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 04:45:00,656 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 04:45:00,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2855: assume !true; [2025-02-08 04:45:00,656 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 04:45:00,656 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 04:45:00,656 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 04:45:00,656 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 04:45:00,656 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 04:45:00,656 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 04:45:00,656 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 04:45:00,657 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 04:45:00,657 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 04:45:00,657 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 04:45:00,657 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 04:45:00,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: assume !true; [2025-02-08 04:45:00,657 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 04:45:00,657 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 04:45:00,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957: assume !true; [2025-02-08 04:45:00,657 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 04:45:00,657 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 04:45:00,658 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 04:45:00,658 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 04:45:00,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025: assume true; [2025-02-08 04:45:00,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025: assume !true; [2025-02-08 04:45:00,658 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 04:45:00,658 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 04:45:00,658 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 04:45:00,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-1: [2025-02-08 04:45:00,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2994: assume (4294967287 + __main_~c~1#1) % 4294967296 <= 4; [2025-02-08 04:45:00,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2994: assume !((4294967287 + __main_~c~1#1) % 4294967296 <= 4); [2025-02-08 04:45:00,658 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 04:45:00,658 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 04:45:00,658 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 04:45:00,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-3: assume !(__main_~print_type~0#1 % 4294967296 == __main_#t~bitwise231#1 % 4294967296); [2025-02-08 04:45:00,658 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 04:45:00,658 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 04:45:00,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume !(-1 == __main_~c~1#1); [2025-02-08 04:45:00,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-5: [2025-02-08 04:45:00,658 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 04:45:00,658 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 04:45:00,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-7: assume 0 == __main_~u~0#1 % 4294967296;__main_#t~bitwise231#1 := 1; [2025-02-08 04:45:00,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-7: assume !(0 == __main_~u~0#1 % 4294967296); [2025-02-08 04:45:00,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3027-6: havoc __main_#t~bitwise231#1;assume __main_#t~bitwise231#1 > 1; [2025-02-08 04:45:00,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2763-1: assume true; [2025-02-08 04:45:00,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2763-1: assume !true; [2025-02-08 04:45:00,659 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 04:45:00,659 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 04:45:00,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: havoc __main_~return_value_ferror$2~0#1; [2025-02-08 04:45:00,659 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 04:45:00,659 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 04:45:00,659 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 04:45:00,659 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 04:45:00,659 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 04:45:00,659 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 04:45:00,659 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 04:45:00,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2369: assume !!(0 == fclose_if_not_stdin_~r~0#1); [2025-02-08 04:45:00,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766: assume -1 == getopt32_~c~0#1; [2025-02-08 04:45:00,659 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 04:45:00,660 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 04:45:00,660 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 04:45:00,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2965: assume !(0 == __main_~return_value_ferror$2~0#1); [2025-02-08 04:45:00,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2965: assume !!(0 == __main_~return_value_ferror$2~0#1); [2025-02-08 04:45:00,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: havoc fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 04:45:00,660 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 04:45:00,660 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 04:45:00,660 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 04:45:00,660 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 04:45:00,660 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 04:45:00,660 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 04:45:00,661 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 04:45:00,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: __main_~status~0#1 := 1; [2025-02-08 04:45:00,661 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 04:45:00,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2770: assume !true; [2025-02-08 04:45:00,661 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 04:45:00,661 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 04:45:00,662 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 04:45:00,662 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);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 04:45:00,663 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 04:45:00,663 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 04:45:00,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3035: assume false; [2025-02-08 04:45:00,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3035: assume !false; [2025-02-08 04:45:00,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2936-1: assume true; [2025-02-08 04:45:00,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2936-1: assume !true; [2025-02-08 04:45:00,663 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 04:45:00,663 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 04:45:00,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc fclose_if_not_stdin_#t~bitwise74#1; [2025-02-08 04:45:00,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375-3: [2025-02-08 04:45:00,663 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 04:45:00,663 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 04:45:00,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375-5: assume !(0 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 04:45:00,663 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 04:45:00,663 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 04:45:00,663 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 04:45:00,663 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 04:45:00,663 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 04:45:00,663 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 04:45:00,663 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 04:45:00,663 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 04:45:00,663 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 04:45:00,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3004: assume !(10 == __main_~c~1#1); [2025-02-08 04:45:00,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-1: [2025-02-08 04:45:00,663 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 04:45:00,663 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 04:45:00,663 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 04:45:00,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-3: assume !(getopt32_#t~mem162#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 04:45:00,664 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 04:45:00,665 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 04:45:00,665 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 04:45:00,665 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 04:45:00,665 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 04:45:00,665 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3038: assume !(__main_~u~0#1 % 4294967296 < 5); [2025-02-08 04:45:00,665 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3038: assume !!(__main_~u~0#1 % 4294967296 < 5); [2025-02-08 04:45:00,665 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 04:45:00,665 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 04:45:00,665 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3006: assume !(11 == __main_~c~1#1);__main_~linepos~0#1 := 0; [2025-02-08 04:45:00,665 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3006: assume !!(11 == __main_~c~1#1); [2025-02-08 04:45:00,665 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 04:45:00,665 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 04:45:00,665 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2775-1: [2025-02-08 04:45:00,665 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 04:45:00,665 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 04:45:00,665 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2775-3: assume !(getopt32_#t~mem164#1 % 4294967296 == getopt32_#t~mem165#1 % 4294967296); [2025-02-08 04:45:00,665 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 04:45:00,665 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 04:45:00,666 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 04:45:00,666 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 04:45:00,666 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 04:45:00,666 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 04:45:00,666 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 04:45:00,666 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-1: [2025-02-08 04:45:00,666 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 04:45:00,666 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 04:45:00,666 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 04:45:00,666 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise168#1) % 4294967296); [2025-02-08 04:45:00,666 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 04:45:00,666 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-5: [2025-02-08 04:45:00,666 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 04:45:00,666 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 04:45:00,666 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 04:45:00,666 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-7: assume !(getopt32_#t~mem167#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 04:45:00,666 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 04:45:00,666 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-9: assume !(0 == getopt32_#t~mem167#1 % 4294967296); [2025-02-08 04:45:00,666 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 04:45:00,666 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 04:45:00,750 INFO L? ?]: Removed 385 outVars from TransFormulas that were not future-live. [2025-02-08 04:45:00,750 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:45:00,772 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:45:00,772 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 04:45:00,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:45:00 BoogieIcfgContainer [2025-02-08 04:45:00,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:45:00,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:45:00,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:45:00,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:45:00,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:44:52" (1/3) ... [2025-02-08 04:45:00,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f3678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:45:00, skipping insertion in model container [2025-02-08 04:45:00,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:44:53" (2/3) ... [2025-02-08 04:45:00,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f3678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:45:00, skipping insertion in model container [2025-02-08 04:45:00,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:45:00" (3/3) ... [2025-02-08 04:45:00,785 INFO L128 eAbstractionObserver]: Analyzing ICFG wc-2.i [2025-02-08 04:45:00,796 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:45:00,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG wc-2.i that has 8 procedures, 314 locations, 1 initial locations, 33 loop locations, and 4 error locations. [2025-02-08 04:45:00,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:45:00,857 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;@10d28af1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:45:00,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 04:45:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 314 states, 267 states have (on average 1.6292134831460674) internal successors, (435), 293 states have internal predecessors, (435), 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 04:45:00,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 04:45:00,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:00,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:00,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:00,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1030385376, now seen corresponding path program 1 times [2025-02-08 04:45:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:00,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198901906] [2025-02-08 04:45:00,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:01,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 04:45:01,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 04:45:01,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:01,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:01,936 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 04:45:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198901906] [2025-02-08 04:45:01,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198901906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:01,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:01,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:45:01,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202476595] [2025-02-08 04:45:01,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:01,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:45:01,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:01,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:45:01,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:01,961 INFO L87 Difference]: Start difference. First operand has 314 states, 267 states have (on average 1.6292134831460674) internal successors, (435), 293 states have internal predecessors, (435), 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, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:02,112 INFO L93 Difference]: Finished difference Result 485 states and 727 transitions. [2025-02-08 04:45:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:45:02,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-02-08 04:45:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:02,124 INFO L225 Difference]: With dead ends: 485 [2025-02-08 04:45:02,124 INFO L226 Difference]: Without dead ends: 137 [2025-02-08 04:45:02,128 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 04:45:02,135 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:02,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 456 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-08 04:45:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-08 04:45:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 124 states have (on average 1.3951612903225807) internal successors, (173), 125 states have internal predecessors, (173), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 186 transitions. [2025-02-08 04:45:02,186 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 186 transitions. Word has length 45 [2025-02-08 04:45:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:02,188 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 186 transitions. [2025-02-08 04:45:02,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2025-02-08 04:45:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 04:45:02,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:02,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:02,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:45:02,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1131969969, now seen corresponding path program 1 times [2025-02-08 04:45:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:02,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473520697] [2025-02-08 04:45:02,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:02,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:02,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 04:45:02,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 04:45:02,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:02,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:03,069 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 04:45:03,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473520697] [2025-02-08 04:45:03,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473520697] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238608806] [2025-02-08 04:45:03,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:03,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:03,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:03,073 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 04:45:03,074 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 04:45:03,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 04:45:04,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 04:45:04,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:04,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:04,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 1914 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 04:45:04,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:04,371 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 04:45:04,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:45:04,428 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 04:45:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238608806] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:45:04,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:45:04,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 04:45:04,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774320225] [2025-02-08 04:45:04,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:45:04,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:45:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:04,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:45:04,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:04,431 INFO L87 Difference]: Start difference. First operand 137 states and 186 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:45:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:04,490 INFO L93 Difference]: Finished difference Result 274 states and 374 transitions. [2025-02-08 04:45:04,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:45:04,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2025-02-08 04:45:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:04,492 INFO L225 Difference]: With dead ends: 274 [2025-02-08 04:45:04,492 INFO L226 Difference]: Without dead ends: 140 [2025-02-08 04:45:04,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 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 04:45:04,494 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:04,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 714 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 04:45:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-08 04:45:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-08 04:45:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 128 states have internal predecessors, (176), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2025-02-08 04:45:04,503 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 49 [2025-02-08 04:45:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:04,503 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2025-02-08 04:45:04,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:45:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2025-02-08 04:45:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 04:45:04,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:04,505 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:04,515 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 04:45:04,707 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 04:45:04,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:04,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1781272988, now seen corresponding path program 2 times [2025-02-08 04:45:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:04,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302932946] [2025-02-08 04:45:04,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:45:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:05,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-08 04:45:05,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 52 statements. [2025-02-08 04:45:05,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:45:05,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 04:45:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302932946] [2025-02-08 04:45:05,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302932946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:05,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:05,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:45:05,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301601709] [2025-02-08 04:45:05,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:05,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:45:05,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:05,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:45:05,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:45:05,920 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:06,051 INFO L93 Difference]: Finished difference Result 229 states and 309 transitions. [2025-02-08 04:45:06,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:45:06,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2025-02-08 04:45:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:06,053 INFO L225 Difference]: With dead ends: 229 [2025-02-08 04:45:06,053 INFO L226 Difference]: Without dead ends: 174 [2025-02-08 04:45:06,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:45:06,054 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 245 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:06,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 327 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-08 04:45:06,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 142. [2025-02-08 04:45:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 129 states have (on average 1.37984496124031) internal successors, (178), 130 states have internal predecessors, (178), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 191 transitions. [2025-02-08 04:45:06,070 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 191 transitions. Word has length 52 [2025-02-08 04:45:06,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:06,071 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 191 transitions. [2025-02-08 04:45:06,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:06,071 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 191 transitions. [2025-02-08 04:45:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 04:45:06,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:06,072 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:06,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:45:06,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:06,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash 784200635, now seen corresponding path program 1 times [2025-02-08 04:45:06,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:06,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651350480] [2025-02-08 04:45:06,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:06,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:06,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 04:45:06,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 04:45:06,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:06,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 04:45:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:07,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651350480] [2025-02-08 04:45:07,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651350480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:07,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:07,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:45:07,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255904281] [2025-02-08 04:45:07,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:07,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:45:07,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:07,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:45:07,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:07,111 INFO L87 Difference]: Start difference. First operand 142 states and 191 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:07,227 INFO L93 Difference]: Finished difference Result 155 states and 203 transitions. [2025-02-08 04:45:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:45:07,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2025-02-08 04:45:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:07,228 INFO L225 Difference]: With dead ends: 155 [2025-02-08 04:45:07,228 INFO L226 Difference]: Without dead ends: 151 [2025-02-08 04:45:07,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:45:07,230 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 11 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:07,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 883 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-08 04:45:07,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2025-02-08 04:45:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 133 states have (on average 1.368421052631579) internal successors, (182), 133 states have internal predecessors, (182), 9 states have call successors, (9), 8 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 196 transitions. [2025-02-08 04:45:07,242 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 196 transitions. Word has length 52 [2025-02-08 04:45:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:07,243 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 196 transitions. [2025-02-08 04:45:07,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 196 transitions. [2025-02-08 04:45:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 04:45:07,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:07,245 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:07,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:45:07,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:07,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:07,246 INFO L85 PathProgramCache]: Analyzing trace with hash 784230426, now seen corresponding path program 1 times [2025-02-08 04:45:07,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:07,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910262738] [2025-02-08 04:45:07,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:07,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:07,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 04:45:07,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 04:45:07,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:07,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:45:08,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:08,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910262738] [2025-02-08 04:45:08,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910262738] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:08,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26105370] [2025-02-08 04:45:08,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:08,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:08,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:08,114 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 04:45:08,115 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 04:45:08,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 04:45:08,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 04:45:08,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:08,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:08,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 1959 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 04:45:08,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:45:08,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:45:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:45:09,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26105370] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:45:09,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:45:09,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2025-02-08 04:45:09,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324050089] [2025-02-08 04:45:09,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:45:09,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 04:45:09,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:09,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 04:45:09,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:45:09,121 INFO L87 Difference]: Start difference. First operand 147 states and 196 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:45:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:09,199 INFO L93 Difference]: Finished difference Result 294 states and 397 transitions. [2025-02-08 04:45:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 04:45:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2025-02-08 04:45:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:09,201 INFO L225 Difference]: With dead ends: 294 [2025-02-08 04:45:09,201 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 04:45:09,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:45:09,201 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:09,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 714 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 04:45:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-08 04:45:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 139 states have (on average 1.3525179856115108) internal successors, (188), 139 states have internal predecessors, (188), 9 states have call successors, (9), 8 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 202 transitions. [2025-02-08 04:45:09,212 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 202 transitions. Word has length 52 [2025-02-08 04:45:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:09,213 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 202 transitions. [2025-02-08 04:45:09,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:45:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 202 transitions. [2025-02-08 04:45:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 04:45:09,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:09,215 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:09,226 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 04:45:09,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:09,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:09,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:09,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1766089926, now seen corresponding path program 2 times [2025-02-08 04:45:09,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:09,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869732509] [2025-02-08 04:45:09,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:45:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:09,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-02-08 04:45:09,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 58 statements. [2025-02-08 04:45:09,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:45:09,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:09,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:09,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869732509] [2025-02-08 04:45:09,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869732509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:09,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:09,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:45:09,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817940509] [2025-02-08 04:45:09,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:09,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:45:09,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:09,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:45:09,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:09,985 INFO L87 Difference]: Start difference. First operand 153 states and 202 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:10,016 INFO L93 Difference]: Finished difference Result 268 states and 353 transitions. [2025-02-08 04:45:10,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:45:10,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2025-02-08 04:45:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:10,020 INFO L225 Difference]: With dead ends: 268 [2025-02-08 04:45:10,020 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 04:45:10,021 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 04:45:10,021 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 330 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 04:45:10,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 330 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 04:45:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 04:45:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-08 04:45:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 139 states have (on average 1.3453237410071943) internal successors, (187), 139 states have internal predecessors, (187), 9 states have call successors, (9), 8 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 201 transitions. [2025-02-08 04:45:10,036 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 201 transitions. Word has length 58 [2025-02-08 04:45:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:10,036 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 201 transitions. [2025-02-08 04:45:10,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 201 transitions. [2025-02-08 04:45:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-08 04:45:10,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:10,037 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:10,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:45:10,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:10,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2130850848, now seen corresponding path program 1 times [2025-02-08 04:45:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:10,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232038659] [2025-02-08 04:45:10,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:10,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 04:45:10,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 04:45:10,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:10,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:10,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:10,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232038659] [2025-02-08 04:45:10,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232038659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:10,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:10,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:45:10,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471237539] [2025-02-08 04:45:10,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:10,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:45:10,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:10,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:45:10,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:45:10,631 INFO L87 Difference]: Start difference. First operand 153 states and 201 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:10,698 INFO L93 Difference]: Finished difference Result 282 states and 373 transitions. [2025-02-08 04:45:10,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:45:10,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2025-02-08 04:45:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:10,699 INFO L225 Difference]: With dead ends: 282 [2025-02-08 04:45:10,699 INFO L226 Difference]: Without dead ends: 155 [2025-02-08 04:45:10,700 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 04:45:10,700 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:10,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-08 04:45:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-02-08 04:45:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 141 states have internal predecessors, (189), 9 states have call successors, (9), 8 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2025-02-08 04:45:10,706 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 65 [2025-02-08 04:45:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:10,706 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2025-02-08 04:45:10,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2025-02-08 04:45:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-08 04:45:10,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:10,707 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:10,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 04:45:10,707 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:10,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash 463375969, now seen corresponding path program 1 times [2025-02-08 04:45:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345680750] [2025-02-08 04:45:10,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:11,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 04:45:11,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 04:45:11,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:11,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:11,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:11,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345680750] [2025-02-08 04:45:11,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345680750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:11,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:11,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 04:45:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927642089] [2025-02-08 04:45:11,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:11,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 04:45:11,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:11,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 04:45:11,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:45:11,284 INFO L87 Difference]: Start difference. First operand 155 states and 203 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:11,379 INFO L93 Difference]: Finished difference Result 287 states and 380 transitions. [2025-02-08 04:45:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:45:11,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2025-02-08 04:45:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:11,381 INFO L225 Difference]: With dead ends: 287 [2025-02-08 04:45:11,381 INFO L226 Difference]: Without dead ends: 158 [2025-02-08 04:45:11,381 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 04:45:11,382 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 688 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 04:45:11,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 688 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-08 04:45:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-08 04:45:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 144 states have internal predecessors, (191), 9 states have call successors, (9), 8 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 205 transitions. [2025-02-08 04:45:11,388 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 205 transitions. Word has length 65 [2025-02-08 04:45:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:11,388 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 205 transitions. [2025-02-08 04:45:11,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2025-02-08 04:45:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 04:45:11,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:11,390 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:11,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 04:45:11,390 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:11,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash 774003838, now seen corresponding path program 1 times [2025-02-08 04:45:11,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:11,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567025126] [2025-02-08 04:45:11,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:11,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:11,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 04:45:11,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 04:45:11,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:11,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:11,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:11,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567025126] [2025-02-08 04:45:11,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567025126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:11,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:11,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:45:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164891132] [2025-02-08 04:45:11,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:11,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:45:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:11,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:45:11,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:45:11,961 INFO L87 Difference]: Start difference. First operand 158 states and 205 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:12,027 INFO L93 Difference]: Finished difference Result 284 states and 372 transitions. [2025-02-08 04:45:12,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:45:12,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2025-02-08 04:45:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:12,028 INFO L225 Difference]: With dead ends: 284 [2025-02-08 04:45:12,028 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 04:45:12,029 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 04:45:12,030 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:12,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 04:45:12,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-08 04:45:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 146 states have (on average 1.321917808219178) internal successors, (193), 146 states have internal predecessors, (193), 9 states have call successors, (9), 8 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2025-02-08 04:45:12,038 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 67 [2025-02-08 04:45:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:12,039 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2025-02-08 04:45:12,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2025-02-08 04:45:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 04:45:12,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:12,040 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:12,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 04:45:12,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:12,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:12,040 INFO L85 PathProgramCache]: Analyzing trace with hash -250690083, now seen corresponding path program 1 times [2025-02-08 04:45:12,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:12,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500246021] [2025-02-08 04:45:12,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:12,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 04:45:12,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 04:45:12,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:12,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:12,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:12,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500246021] [2025-02-08 04:45:12,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500246021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:12,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:12,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:45:12,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607671133] [2025-02-08 04:45:12,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:12,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:45:12,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:12,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:45:12,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:12,741 INFO L87 Difference]: Start difference. First operand 160 states and 207 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:12,839 INFO L93 Difference]: Finished difference Result 278 states and 362 transitions. [2025-02-08 04:45:12,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:45:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2025-02-08 04:45:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:12,841 INFO L225 Difference]: With dead ends: 278 [2025-02-08 04:45:12,841 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 04:45:12,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:12,842 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:12,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 862 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 04:45:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2025-02-08 04:45:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 146 states have (on average 1.321917808219178) internal successors, (193), 146 states have internal predecessors, (193), 9 states have call successors, (9), 8 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2025-02-08 04:45:12,851 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 67 [2025-02-08 04:45:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:12,851 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2025-02-08 04:45:12,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2025-02-08 04:45:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 04:45:12,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:12,852 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:12,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 04:45:12,852 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:12,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1012517760, now seen corresponding path program 1 times [2025-02-08 04:45:12,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:12,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879196239] [2025-02-08 04:45:12,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:12,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:13,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 04:45:13,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 04:45:13,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:13,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:13,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879196239] [2025-02-08 04:45:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879196239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:13,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:13,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:45:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763235450] [2025-02-08 04:45:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:13,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:45:13,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:13,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:45:13,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:13,483 INFO L87 Difference]: Start difference. First operand 160 states and 207 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:13,508 INFO L93 Difference]: Finished difference Result 276 states and 359 transitions. [2025-02-08 04:45:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:45:13,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2025-02-08 04:45:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:13,509 INFO L225 Difference]: With dead ends: 276 [2025-02-08 04:45:13,509 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 04:45:13,509 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 04:45:13,510 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 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 04:45:13,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 04:45:13,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 04:45:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2025-02-08 04:45:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.3194444444444444) internal successors, (190), 144 states have internal predecessors, (190), 9 states have call successors, (9), 8 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 204 transitions. [2025-02-08 04:45:13,516 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 204 transitions. Word has length 69 [2025-02-08 04:45:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:13,516 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 204 transitions. [2025-02-08 04:45:13,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 204 transitions. [2025-02-08 04:45:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 04:45:13,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:13,517 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:13,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 04:45:13,517 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:13,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:13,518 INFO L85 PathProgramCache]: Analyzing trace with hash 496203289, now seen corresponding path program 1 times [2025-02-08 04:45:13,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:13,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140071511] [2025-02-08 04:45:13,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:13,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:13,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 04:45:13,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 04:45:13,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:13,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:14,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:14,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140071511] [2025-02-08 04:45:14,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140071511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:14,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:14,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:45:14,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932936199] [2025-02-08 04:45:14,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:14,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:45:14,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:14,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:45:14,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:45:14,107 INFO L87 Difference]: Start difference. First operand 158 states and 204 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:14,155 INFO L93 Difference]: Finished difference Result 277 states and 360 transitions. [2025-02-08 04:45:14,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:45:14,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2025-02-08 04:45:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:14,157 INFO L225 Difference]: With dead ends: 277 [2025-02-08 04:45:14,157 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 04:45:14,158 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 04:45:14,158 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:14,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 524 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 04:45:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 04:45:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-08 04:45:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 146 states have internal predecessors, (192), 9 states have call successors, (9), 8 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 206 transitions. [2025-02-08 04:45:14,164 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 206 transitions. Word has length 69 [2025-02-08 04:45:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:14,164 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 206 transitions. [2025-02-08 04:45:14,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:14,164 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 206 transitions. [2025-02-08 04:45:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 04:45:14,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:14,164 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:14,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 04:45:14,165 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:14,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash 47506650, now seen corresponding path program 1 times [2025-02-08 04:45:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:14,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454095294] [2025-02-08 04:45:14,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:14,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 04:45:14,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 04:45:14,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:14,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454095294] [2025-02-08 04:45:14,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454095294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:14,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:14,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:45:14,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001614918] [2025-02-08 04:45:14,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:14,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:45:14,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:14,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:45:14,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:14,729 INFO L87 Difference]: Start difference. First operand 160 states and 206 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:14,754 INFO L93 Difference]: Finished difference Result 199 states and 255 transitions. [2025-02-08 04:45:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:45:14,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2025-02-08 04:45:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:14,756 INFO L225 Difference]: With dead ends: 199 [2025-02-08 04:45:14,756 INFO L226 Difference]: Without dead ends: 139 [2025-02-08 04:45:14,756 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 04:45:14,756 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:14,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 04:45:14,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-08 04:45:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-08 04:45:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 127 states have internal predecessors, (166), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 178 transitions. [2025-02-08 04:45:14,761 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 178 transitions. Word has length 69 [2025-02-08 04:45:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:14,761 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 178 transitions. [2025-02-08 04:45:14,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 178 transitions. [2025-02-08 04:45:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 04:45:14,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:14,762 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:14,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 04:45:14,763 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:14,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash -626469128, now seen corresponding path program 1 times [2025-02-08 04:45:14,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:14,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576080045] [2025-02-08 04:45:14,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:15,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 04:45:15,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 04:45:15,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:15,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:15,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:15,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576080045] [2025-02-08 04:45:15,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576080045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:15,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:15,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:45:15,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831749162] [2025-02-08 04:45:15,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:15,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:45:15,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:15,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:45:15,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:15,195 INFO L87 Difference]: Start difference. First operand 139 states and 178 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:15,218 INFO L93 Difference]: Finished difference Result 173 states and 219 transitions. [2025-02-08 04:45:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:45:15,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2025-02-08 04:45:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:15,219 INFO L225 Difference]: With dead ends: 173 [2025-02-08 04:45:15,219 INFO L226 Difference]: Without dead ends: 139 [2025-02-08 04:45:15,220 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 04:45:15,220 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 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 04:45:15,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 04:45:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-08 04:45:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-08 04:45:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 127 states have internal predecessors, (165), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:45:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 177 transitions. [2025-02-08 04:45:15,225 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 177 transitions. Word has length 73 [2025-02-08 04:45:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:15,225 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 177 transitions. [2025-02-08 04:45:15,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2025-02-08 04:45:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 04:45:15,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:15,226 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:15,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 04:45:15,226 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-02-08 04:45:15,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1081687580, now seen corresponding path program 1 times [2025-02-08 04:45:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103646913] [2025-02-08 04:45:15,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:15,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 04:45:15,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 04:45:15,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:15,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 04:45:15,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:15,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103646913] [2025-02-08 04:45:15,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103646913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:15,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:15,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:45:15,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529134054] [2025-02-08 04:45:15,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:15,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:45:15,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:15,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:45:15,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:15,742 INFO L87 Difference]: Start difference. First operand 139 states and 177 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:15,749 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2025-02-08 04:45:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:45:15,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2025-02-08 04:45:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:15,751 INFO L225 Difference]: With dead ends: 139 [2025-02-08 04:45:15,751 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 04:45:15,752 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 04:45:15,752 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 51 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:15,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 159 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 04:45:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 04:45:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 04:45:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:45:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 04:45:15,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2025-02-08 04:45:15,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:15,753 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 04:45:15,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 04:45:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 04:45:15,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 04:45:15,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (3 of 4 remaining) [2025-02-08 04:45:15,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (2 of 4 remaining) [2025-02-08 04:45:15,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (1 of 4 remaining) [2025-02-08 04:45:15,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-08 04:45:15,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 04:45:15,759 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:15,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 04:45:16,058 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 04:45:16,069 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset [2025-02-08 04:45:16,070 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base [2025-02-08 04:45:16,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset [2025-02-08 04:45:16,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base [2025-02-08 04:45:16,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset [2025-02-08 04:45:16,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base [2025-02-08 04:45:16,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-02-08 04:45:16,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-02-08 04:45:16,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset [2025-02-08 04:45:16,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base [2025-02-08 04:45:16,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base [2025-02-08 04:45:16,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset [2025-02-08 04:45:16,073 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base [2025-02-08 04:45:16,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 04:45:16 BoogieIcfgContainer [2025-02-08 04:45:16,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 04:45:16,073 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 04:45:16,073 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 04:45:16,073 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 04:45:16,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:45:00" (3/4) ... [2025-02-08 04:45:16,079 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 04:45:16,083 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure bb_error_msg_and_die [2025-02-08 04:45:16,084 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2025-02-08 04:45:16,084 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure xmalloc [2025-02-08 04:45:16,084 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure bb_simple_perror_msg [2025-02-08 04:45:16,084 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure bb_verror_msg [2025-02-08 04:45:16,084 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 04:45:16,084 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_strcpy [2025-02-08 04:45:16,104 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2025-02-08 04:45:16,105 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-02-08 04:45:16,107 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-08 04:45:16,108 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 04:45:16,109 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 04:45:16,111 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 04:45:16,112 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 04:45:16,260 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 04:45:16,261 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 04:45:16,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 04:45:16,261 INFO L158 Benchmark]: Toolchain (without parser) took 23692.25ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 106.4MB in the beginning and 856.5MB in the end (delta: -750.1MB). Peak memory consumption was 293.7MB. Max. memory is 16.1GB. [2025-02-08 04:45:16,261 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 04:45:16,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1063.05ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 66.3MB in the end (delta: 40.1MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2025-02-08 04:45:16,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.19ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 52.3MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 04:45:16,262 INFO L158 Benchmark]: Boogie Preprocessor took 133.94ms. Allocated memory is still 142.6MB. Free memory was 52.3MB in the beginning and 40.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 04:45:16,262 INFO L158 Benchmark]: IcfgBuilder took 6896.88ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 40.5MB in the beginning and 144.5MB in the end (delta: -104.0MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. [2025-02-08 04:45:16,262 INFO L158 Benchmark]: TraceAbstraction took 15294.87ms. Allocated memory was 352.3MB in the beginning and 1.2GB in the end (delta: 830.5MB). Free memory was 144.5MB in the beginning and 877.4MB in the end (delta: -733.0MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. [2025-02-08 04:45:16,262 INFO L158 Benchmark]: Witness Printer took 187.38ms. Allocated memory is still 1.2GB. Free memory was 877.4MB in the beginning and 856.5MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 04:45:16,264 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1063.05ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 66.3MB in the end (delta: 40.1MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.19ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 52.3MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.94ms. Allocated memory is still 142.6MB. Free memory was 52.3MB in the beginning and 40.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 6896.88ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 40.5MB in the beginning and 144.5MB in the end (delta: -104.0MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15294.87ms. Allocated memory was 352.3MB in the beginning and 1.2GB in the end (delta: 830.5MB). Free memory was 144.5MB in the beginning and 877.4MB in the end (delta: -733.0MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. * Witness Printer took 187.38ms. Allocated memory is still 1.2GB. Free memory was 877.4MB in the beginning and 856.5MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~opt_complementary~0!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2382]: there are no unsupported features in the program For all program executions holds that there are no unsupported features in the program at this location - PositiveResult [Line: 854]: there are no unsupported features in the program For all program executions holds that there are no unsupported features in the program at this location - PositiveResult [Line: 3053]: there are no unsupported features in the program For all program executions holds that there are no unsupported features in the program at this location - PositiveResult [Line: 3035]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 314 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 330 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 329 mSDsluCounter, 7676 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5068 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 402 IncrementalHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 2608 mSDtfsCounter, 402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1027 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1109 ConstructedInterpolants, 0 QuantifiedInterpolants, 1454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3873 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 570/603 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 2475]: Location Invariant Derived location invariant: (spec_flgs == 0) - InvariantResult [Line: 3251]: Location Invariant Derived location invariant: (0 == unicode_status) - InvariantResult [Line: 2692]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 3246]: Location Invariant Derived location invariant: (0 == unicode_status) - InvariantResult [Line: 2561]: Location Invariant Derived location invariant: (spec_flgs == 0) - InvariantResult [Line: 2516]: Location Invariant Derived location invariant: (spec_flgs == 0) - InvariantResult [Line: 2503]: Location Invariant Derived location invariant: (spec_flgs == 0) - InvariantResult [Line: 3255]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 2540]: Location Invariant Derived location invariant: (spec_flgs == 0) - InvariantResult [Line: 2713]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 2625]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 2799]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 2382]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 2535]: Location Invariant Derived location invariant: (spec_flgs == 0) - InvariantResult [Line: 2936]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 3236]: Location Invariant Derived location invariant: (0 == unicode_status) - InvariantResult [Line: 2458]: Location Invariant Derived location invariant: (spec_flgs == 0) - InvariantResult [Line: 3053]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 2741]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 2485]: Location Invariant Derived location invariant: (spec_flgs == 0) RESULT: Ultimate proved your program to be correct! [2025-02-08 04:45:16,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE