./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/fold-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/fold-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5e803a3547be3620dc8dbbd84c6dab2896bff52984e7e41a97c3a64196bed15a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:26:11,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:26:11,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:26:11,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:26:11,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:26:11,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:26:11,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:26:11,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:26:11,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:26:11,919 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:26:11,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:26:11,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:26:11,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:26:11,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:26:11,921 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:26:11,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:26:11,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:26:11,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:26:11,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:26:11,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:26:11,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:26:11,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:26:11,922 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:26:11,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:26:11,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:26:11,923 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:26:11,923 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:26:11,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:26:11,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:26:11,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:26:11,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:26:11,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:26:11,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:26:11,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:26:11,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:26:11,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:26:11,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:26:11,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:26:11,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:26:11,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:26:11,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:26:11,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:26:11,924 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5e803a3547be3620dc8dbbd84c6dab2896bff52984e7e41a97c3a64196bed15a [2025-02-08 13:26:12,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:26:12,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:26:12,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:26:12,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:26:12,208 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:26:12,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/fold-1.i [2025-02-08 13:26:13,556 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a35547758/a593faf1a5544e93b928ab3d6d0203e5/FLAGfb508c60c [2025-02-08 13:26:14,060 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:26:14,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/fold-1.i [2025-02-08 13:26:14,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a35547758/a593faf1a5544e93b928ab3d6d0203e5/FLAGfb508c60c [2025-02-08 13:26:14,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a35547758/a593faf1a5544e93b928ab3d6d0203e5 [2025-02-08 13:26:14,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:26:14,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:26:14,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:26:14,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:26:14,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:26:14,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f45945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:14, skipping insertion in model container [2025-02-08 13:26:14,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:26:14" (1/1) ... [2025-02-08 13:26:14,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:26:15,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:26:15,197 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:26:15,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:26:15,530 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:26:15,536 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:26:15,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15 WrapperNode [2025-02-08 13:26:15,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:26:15,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:26:15,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:26:15,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:26:15,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:15,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:15,669 INFO L138 Inliner]: procedures = 581, calls = 798, calls flagged for inlining = 28, calls inlined = 26, statements flattened = 2129 [2025-02-08 13:26:15,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:26:15,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:26:15,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:26:15,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:26:15,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:15,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:15,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:15,828 INFO L175 MemorySlicer]: Split 645 memory accesses to 23 slices as follows [2, 3, 34, 1, 22, 2, 1, 2, 10, 3, 3, 17, 7, 17, 355, 6, 65, 44, 4, 25, 3, 3, 16]. 55 percent of accesses are in the largest equivalence class. The 389 initializations are split as follows [2, 3, 5, 0, 0, 2, 0, 0, 1, 0, 0, 0, 0, 4, 355, 0, 8, 0, 0, 9, 0, 0, 0]. The 116 writes are split as follows [0, 0, 0, 1, 5, 0, 1, 1, 5, 0, 0, 17, 7, 4, 0, 4, 39, 12, 1, 15, 3, 0, 1]. [2025-02-08 13:26:15,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:15,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:15,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:15,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:15,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:15,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:16,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:26:16,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:26:16,022 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:26:16,022 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:26:16,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (1/1) ... [2025-02-08 13:26:16,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:26:16,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:16,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:26:16,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:26:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-02-08 13:26:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-02-08 13:26:16,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#21 [2025-02-08 13:26:16,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#22 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-02-08 13:26:16,078 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-02-08 13:26:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-02-08 13:26:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-02-08 13:26:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-02-08 13:26:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-02-08 13:26:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-02-08 13:26:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-02-08 13:26:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-02-08 13:26:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#21 [2025-02-08 13:26:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#22 [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-02-08 13:26:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure adjust_column [2025-02-08 13:26:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure adjust_column [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-08 13:26:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#22 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:26:16,080 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 13:26:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 13:26:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 13:26:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 13:26:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 13:26:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 13:26:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 13:26:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 13:26:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 13:26:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-08 13:26:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-08 13:26:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-08 13:26:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-08 13:26:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:26:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:26:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:26:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 13:26:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 13:26:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 13:26:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 13:26:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 13:26:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 13:26:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 13:26:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 13:26:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 13:26:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 13:26:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 13:26:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 13:26:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 13:26:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 13:26:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 13:26:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 13:26:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-08 13:26:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-08 13:26:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-08 13:26:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-08 13:26:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:26:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:26:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:26:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:26:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:26:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 13:26:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 13:26:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:26:16,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:26:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:26:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:26:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:26:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#21 [2025-02-08 13:26:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#22 [2025-02-08 13:26:16,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:26:16,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:26:16,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:26:16,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:26:16,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:26:16,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:26:16,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:26:16,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#21 [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#22 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure write2stdout [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure write2stdout [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:26:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-08 13:26:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#22 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-08 13:26:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-08 13:26:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-08 13:26:16,099 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-02-08 13:26:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#22 [2025-02-08 13:26:16,099 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:26:16,099 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:26:16,099 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:26:16,099 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#22 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:26:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 13:26:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 13:26:16,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#0 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#1 [2025-02-08 13:26:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#2 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#3 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#4 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#5 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#6 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#7 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#8 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#9 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#10 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#11 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#12 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#13 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#14 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#15 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#16 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#17 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#18 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#19 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#20 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#21 [2025-02-08 13:26:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#22 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#0 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#1 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#2 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#3 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#4 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#5 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#6 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#7 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#8 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#9 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#10 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#11 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#12 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#13 [2025-02-08 13:26:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#14 [2025-02-08 13:26:16,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#15 [2025-02-08 13:26:16,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#16 [2025-02-08 13:26:16,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#17 [2025-02-08 13:26:16,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#18 [2025-02-08 13:26:16,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#19 [2025-02-08 13:26:16,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#20 [2025-02-08 13:26:16,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#21 [2025-02-08 13:26:16,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#22 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure xatou_range [2025-02-08 13:26:16,109 INFO L138 BoogieDeclarations]: Found implementation of procedure xatou_range [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:26:16,109 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:26:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-08 13:26:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-08 13:26:16,789 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:26:16,793 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:26:18,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2608: full_write_#t~ret111#1 := safe_write_#res#1;havoc safe_write_#t~ret235#1, safe_write_#t~mem236#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~ret111#1 && full_write_#t~ret111#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret111#1;havoc full_write_#t~ret111#1; [2025-02-08 13:26:18,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3075: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem236#1 := read~int#8(~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~mem236#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:26:18,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3075: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~2#1 := 0; [2025-02-08 13:26:18,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2394: #t~ret67#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet76#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret67#1 && #t~ret67#1 <= 2147483647;havoc #t~ret67#1;call #t~mem68#1.base, #t~mem68#1.offset := read~$Pointer$#22(~#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~mem68#1.base, #t~mem68#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret111#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 13:26:18,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3282: write_#res#1 := write_~ret~1#1; [2025-02-08 13:26:18,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2609: assume full_write_~cc~0#1 < 0; [2025-02-08 13:26:18,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2609: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:26:18,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3282-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:26:18,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3072: 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~nondet299#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~nondet299#1;assume -9223372036854775808 <= write_#t~nondet299#1 && write_#t~nondet299#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet299#1;havoc write_#t~nondet299#1; [2025-02-08 13:26:18,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3072: assume !true; [2025-02-08 13:26:18,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3072-1: assume 0 != safe_write_~tmp_if_expr$1~2#1 % 256; [2025-02-08 13:26:18,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3072-1: assume !(0 != safe_write_~tmp_if_expr$1~2#1 % 256); [2025-02-08 13:26:18,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2395: #t~ret69#1 := full_write_#res#1;havoc full_write_#t~ret111#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~ret69#1 && #t~ret69#1 <= 9223372036854775807;havoc #t~mem68#1.base, #t~mem68#1.offset;havoc #t~ret69#1; [2025-02-08 13:26:18,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: 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~ret235#1, safe_write_#t~mem236#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~2#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~2#1; [2025-02-08 13:26:18,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:26:18,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:26:18,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:26:18,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:26:18,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:26:18,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:26:18,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2611: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:26:18,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2611: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:26:18,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3074: safe_write_#t~ret235#1 := write_#res#1;havoc write_#t~nondet299#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~ret235#1 && safe_write_#t~ret235#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret235#1;havoc safe_write_#t~ret235#1; [2025-02-08 13:26:18,246 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3200: havoc xstrtou_range_sfx_#t~varargs262#1.base, xstrtou_range_sfx_#t~varargs262#1.offset; [2025-02-08 13:26:18,246 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3200-2: call xstrtou_range_sfx_#t~varargs262#1.base, xstrtou_range_sfx_#t~varargs262#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$#12(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs262#1.base, xstrtou_range_sfx_#t~varargs262#1.offset, 8);call write~int#12(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs262#1.base, 8 + xstrtou_range_sfx_#t~varargs262#1.offset, 8);call write~int#12(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs262#1.base, 16 + xstrtou_range_sfx_#t~varargs262#1.offset, 8); [2025-02-08 13:26:18,246 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3200-1: SUMMARY for call bb_error_msg_and_die(13, 0, xstrtou_range_sfx_#t~varargs262#1.base, xstrtou_range_sfx_#t~varargs262#1.offset); srcloc: null [2025-02-08 13:26:18,246 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3167: xstrtou_range_sfx_#t~ret252#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet45#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~2#1 := xstrtou_range_sfx_#t~ret252#1;havoc xstrtou_range_sfx_#t~ret252#1;call xstrtou_range_sfx_#t~mem253#1.base, xstrtou_range_sfx_#t~mem253#1.offset := read~$Pointer$#21(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:26:18,246 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3176: 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~mem256#1.base, xstrtou_range_sfx_#t~mem256#1.offset := read~$Pointer$#21(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~nondet257#1;havoc xstrtou_range_sfx_#t~mem256#1.base, xstrtou_range_sfx_#t~mem256#1.offset;havoc xstrtou_range_sfx_#t~nondet257#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174: assume true;call xstrtou_range_sfx_#t~mem255#1 := read~int#10(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174: assume !true; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174-1: assume !(0 == xstrtou_range_sfx_#t~mem255#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem255#1; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174-1: assume !!(0 == xstrtou_range_sfx_#t~mem255#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem255#1; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume 0 == xstrtou_range_sfx_#t~mem254#1;havoc xstrtou_range_sfx_#t~mem254#1;call write~int#8(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume !(0 == xstrtou_range_sfx_#t~mem254#1);havoc xstrtou_range_sfx_#t~mem254#1; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3168: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem253#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem253#1.offset);havoc xstrtou_range_sfx_#t~mem253#1.base, xstrtou_range_sfx_#t~mem253#1.offset;call xstrtou_range_sfx_#t~mem254#1 := read~int#8(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3168: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem253#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem253#1.offset);havoc xstrtou_range_sfx_#t~mem253#1.base, xstrtou_range_sfx_#t~mem253#1.offset; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~2#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~2#1;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~2#1 % 4294967296); [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3193: assume xstrtou_range_sfx_~r~2#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3193: assume !(xstrtou_range_sfx_~r~2#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3189-1: call xstrtou_range_sfx_#t~mem260#1.base, xstrtou_range_sfx_#t~mem260#1.offset := read~$Pointer$#21(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem261#1 := read~int#16(xstrtou_range_sfx_#t~mem260#1.base, xstrtou_range_sfx_#t~mem260#1.offset, 1); [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3189: assume 0 == xstrtou_range_sfx_#t~mem261#1;havoc xstrtou_range_sfx_#t~mem260#1.base, xstrtou_range_sfx_#t~mem260#1.offset;havoc xstrtou_range_sfx_#t~mem261#1; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3189: assume !(0 == xstrtou_range_sfx_#t~mem261#1);havoc xstrtou_range_sfx_#t~mem260#1.base, xstrtou_range_sfx_#t~mem260#1.offset;havoc xstrtou_range_sfx_#t~mem261#1; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3183: assume !(4294967295 / (xstrtou_range_sfx_#t~mem258#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~2#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem258#1; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3183: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem258#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~2#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem258#1;call xstrtou_range_sfx_#t~mem259#1 := read~int#10(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~2#1 := xstrtou_range_sfx_~r~2#1 * xstrtou_range_sfx_#t~mem259#1;havoc xstrtou_range_sfx_#t~mem259#1; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3181: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem258#1 := read~int#10(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3181: assume !(0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1);havoc xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_~suffixes#1.base, 8 + xstrtou_range_sfx_~suffixes#1.offset; [2025-02-08 13:26:18,247 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:26:18,248 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:26:23,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513-1: SUMMARY for call __main_#t~ret96#1 := adjust_column(__main_~column~0#1, (if __main_~c~0#1 % 256 <= 127 then __main_~c~0#1 % 256 else __main_~c~0#1 % 256 - 256)); srcloc: null [2025-02-08 13:26:23,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513: assume -2147483648 <= __main_#t~ret96#1 && __main_#t~ret96#1 <= 2147483647;__main_~return_value_adjust_column$2~0#1 := __main_#t~ret96#1;havoc __main_#t~ret96#1;__main_~column~0#1 := __main_~return_value_adjust_column$2~0#1; [2025-02-08 13:26:23,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2944-1: assume true; [2025-02-08 13:26:23,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2944-1: assume !true; [2025-02-08 13:26:23,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548: assume -2147483648 <= __main_#t~ret102#1 && __main_#t~ret102#1 <= 2147483647;__main_~return_value_adjust_column$4~0#1 := __main_#t~ret102#1;havoc __main_#t~mem101#1;havoc __main_#t~ret102#1;__main_~column~0#1 := __main_~return_value_adjust_column$4~0#1;havoc __main_~return_value_adjust_column$4~0#1;__main_~fold_main$$1$$2$$2$$4$$i~0#1 := 1 + __main_~fold_main$$1$$2$$2$$4$$i~0#1; [2025-02-08 13:26:23,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2482: __main_#t~ret93#1.base, __main_#t~ret93#1.offset := fopen_or_warn_stdin_#res#1.base, fopen_or_warn_stdin_#res#1.offset;havoc fopen_or_warn_stdin_#t~mem108#1, fopen_or_warn_stdin_#t~mem109#1, fopen_or_warn_stdin_#t~ret110#1.base, fopen_or_warn_stdin_#t~ret110#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_~istream~0#1.base, __main_~istream~0#1.offset := __main_#t~ret93#1.base, __main_#t~ret93#1.offset;havoc __main_#t~mem92#1.base, __main_#t~mem92#1.offset;havoc __main_#t~ret93#1.base, __main_#t~ret93#1.offset;havoc __main_~c~0#1;__main_~column~0#1 := 0;__main_~offset_out~0#1 := 0; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548-1: SUMMARY for call __main_#t~ret102#1 := adjust_column(__main_~column~0#1, __main_#t~mem101#1); srcloc: null [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2515: assume !(__main_~width~0#1 % 4294967296 >= __main_~column~0#1 % 4294967296); [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2515: assume !!(__main_~width~0#1 % 4294967296 >= __main_~column~0#1 % 4294967296);__main_~offset_out~0#1 := 1 + __main_~offset_out~0#1; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2517: assume 0 == __main_~offset_out~0#1 % 4294967296; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2517: assume !(0 == __main_~offset_out~0#1 % 4294967296); [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2947: assume -1 == getopt32_~c~1#1; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2947: assume !(-1 == getopt32_~c~1#1);getopt32_~c~1#1 := getopt32_~c~1#1 % 256;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3212: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret264#1.base, xzalloc_#t~ret264#1.offset;havoc xzalloc_#t~ret264#1.base, xzalloc_#t~ret264#1.offset; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3212-1: SUMMARY for call xzalloc_#t~ret264#1.base, xzalloc_#t~ret264#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2486: assume __main_~istream~0#1.base == 0 && __main_~istream~0#1.offset == 0;__main_~exitcode~0#1 := 1; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2486: assume !(__main_~istream~0#1.base == 0 && __main_~istream~0#1.offset == 0); [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3213-1: SUMMARY for call xzalloc_#t~memset~res265#1.base, xzalloc_#t~memset~res265#1.offset := #Ultimate.C_memset#16(xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset, 0, xzalloc_~size#1); srcloc: null [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3213: havoc xzalloc_#t~memset~res265#1.base, xzalloc_#t~memset~res265#1.offset;xzalloc_#res#1.base, xzalloc_#res#1.offset := xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: assume true;call getopt32_#t~mem189#1 := read~int#17(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: assume !true; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951-2: assume !!((if getopt32_#t~mem189#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem189#1 % 256 % 4294967296 else getopt32_#t~mem189#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~1#1);havoc getopt32_#t~mem189#1; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951-2: assume !((if getopt32_#t~mem189#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem189#1 % 256 % 4294967296 else getopt32_#t~mem189#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~1#1);havoc getopt32_#t~mem189#1;call getopt32_#t~mem190#1 := read~int#17(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2555: call write~int#15(10, __main_~line_out~0#1.base, __main_~line_out~0#1.offset + (if __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 else __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2489: havoc __main_~return_value_fclose_if_not_stdin$5~0#1; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952: assume 0 == (if getopt32_#t~mem190#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem190#1 % 256 % 4294967296 else getopt32_#t~mem190#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem190#1; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952: assume !(0 == (if getopt32_#t~mem190#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem190#1 % 256 % 4294967296 else getopt32_#t~mem190#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem190#1;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~on_off~0#1.base, 34 + getopt32_~on_off~0#1.offset; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2556: __main_~offset_out~0#1 := 0;__main_~column~0#1 := __main_~offset_out~0#1; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: assume true;assume { :begin_inline__IO_getc } true;_IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset := __main_~istream~0#1.base, __main_~istream~0#1.offset;havoc _IO_getc_#res#1;havoc _IO_getc_#t~nondet266#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~nondet266#1 && _IO_getc_#t~nondet266#1 <= 2147483647;_IO_getc_#res#1 := _IO_getc_#t~nondet266#1;havoc _IO_getc_#t~nondet266#1; [2025-02-08 13:26:23,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: assume !true; [2025-02-08 13:26:23,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2556-1: SUMMARY for call write2stdout(__main_~line_out~0#1.base, __main_~line_out~0#1.offset, 1 + __main_~offset_out~0#1); srcloc: null [2025-02-08 13:26:23,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490-1: assume true; [2025-02-08 13:26:23,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490-1: assume !true; [2025-02-08 13:26:23,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217: havoc _IO_getc_#t~nondet266#1;__main_#t~ret94#1 := _IO_getc_#res#1;havoc _IO_getc_#t~nondet266#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~ret94#1 && __main_#t~ret94#1 <= 2147483647;__main_~c~0#1 := __main_#t~ret94#1;havoc __main_#t~ret94#1; [2025-02-08 13:26:23,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954: assume 0 != getopt32_#t~bitwise192#1 % 4294967296;havoc getopt32_#t~mem191#1;havoc getopt32_#t~bitwise192#1; [2025-02-08 13:26:23,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954: assume !(0 != getopt32_#t~bitwise192#1 % 4294967296);havoc getopt32_#t~mem191#1;havoc getopt32_#t~bitwise192#1;call getopt32_#t~mem193#1 := read~int#17(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem194#1 := read~int#17(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:26:23,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-2: havoc getopt32_#t~bitwise192#1;assume getopt32_#t~bitwise192#1 % 4294967296 <= getopt32_#t~mem191#1 % 4294967296 && getopt32_#t~bitwise192#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:26:23,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-1: [2025-02-08 13:26:23,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-4: assume 0 == getopt32_#t~mem191#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise192#1 := 0; [2025-02-08 13:26:23,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-4: assume !(0 == getopt32_#t~mem191#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:26:23,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-3: assume getopt32_#t~mem191#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise192#1 := getopt32_#t~mem191#1; [2025-02-08 13:26:23,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-3: assume !(getopt32_#t~mem191#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:26:23,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-5: call getopt32_#t~mem191#1 := read~int#17(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:26:23,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2625: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:26:23,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2493: assume -1 == __main_~c~0#1; [2025-02-08 13:26:23,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2493: assume !(-1 == __main_~c~0#1); [2025-02-08 13:26:23,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956: getopt32_~trigger~0#1 := getopt32_#t~bitwise195#1;havoc getopt32_#t~mem193#1;havoc getopt32_#t~mem194#1;havoc getopt32_#t~bitwise195#1;call getopt32_#t~mem196#1 := read~int#17(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:26:23,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-2: havoc getopt32_#t~bitwise195#1;assume getopt32_#t~bitwise195#1 % 4294967296 <= getopt32_#t~mem193#1 % 4294967296 && getopt32_#t~bitwise195#1 % 4294967296 <= getopt32_#t~mem194#1 % 4294967296; [2025-02-08 13:26:23,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-1: [2025-02-08 13:26:23,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-4: assume 0 == getopt32_#t~mem193#1 % 4294967296 || 0 == getopt32_#t~mem194#1 % 4294967296;getopt32_#t~bitwise195#1 := 0; [2025-02-08 13:26:23,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-4: assume !(0 == getopt32_#t~mem193#1 % 4294967296 || 0 == getopt32_#t~mem194#1 % 4294967296); [2025-02-08 13:26:23,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-3: assume getopt32_#t~mem193#1 % 4294967296 == getopt32_#t~mem194#1 % 4294967296;getopt32_#t~bitwise195#1 := getopt32_#t~mem193#1; [2025-02-08 13:26:23,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956-3: assume !(getopt32_#t~mem193#1 % 4294967296 == getopt32_#t~mem194#1 % 4294967296); [2025-02-08 13:26:23,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-1: [2025-02-08 13:26:23,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: assume !(0 == __main_#t~bitwise97#1 % 4294967296);havoc __main_#t~bitwise97#1;havoc __main_~fold_main$$1$$2$$2$$4$$i~0#1;__main_~logical_end~0#1 := __main_~offset_out~0#1 - 1; [2025-02-08 13:26:23,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: assume !!(0 == __main_#t~bitwise97#1 % 4294967296);havoc __main_#t~bitwise97#1; [2025-02-08 13:26:23,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-3: assume 2 == ~option_mask32~0 % 4294967296;__main_#t~bitwise97#1 := 2; [2025-02-08 13:26:23,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-3: assume !(2 == ~option_mask32~0 % 4294967296); [2025-02-08 13:26:23,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-2: havoc __main_#t~bitwise97#1;assume __main_#t~bitwise97#1 % 4294967296 <= 2 && __main_#t~bitwise97#1 % 4294967296 <= ~option_mask32~0 % 4294967296; [2025-02-08 13:26:23,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-4: assume 0 == ~option_mask32~0 % 4294967296;__main_#t~bitwise97#1 := 0; [2025-02-08 13:26:23,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-4: assume !(0 == ~option_mask32~0 % 4294967296); [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-1: [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957: getopt32_~flags~0#1 := getopt32_#t~bitwise198#1;havoc getopt32_#t~mem196#1;havoc getopt32_#t~bitwise197#1;havoc getopt32_#t~bitwise198#1;call getopt32_#t~mem199#1 := read~int#17(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise197#1) % 4294967296;getopt32_#t~bitwise198#1 := getopt32_~flags~0#1; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise197#1) % 4294967296); [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-2: havoc getopt32_#t~bitwise198#1;assume getopt32_#t~bitwise198#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise198#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise197#1) % 4294967296; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-5: [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise197#1) % 4294967296;getopt32_#t~bitwise198#1 := 0; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise197#1) % 4294967296); [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-7: assume getopt32_#t~mem196#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise197#1 := 0; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-7: assume !(getopt32_#t~mem196#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-6: havoc getopt32_#t~bitwise197#1;assume getopt32_#t~bitwise197#1 % 4294967296 <= getopt32_#t~mem196#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-9: assume 0 == getopt32_#t~mem196#1 % 4294967296;getopt32_#t~bitwise197#1 := getopt32_~trigger~0#1; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-9: assume !(0 == getopt32_#t~mem196#1 % 4294967296); [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise197#1 := getopt32_#t~mem196#1; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2495: assume 0 == __main_~offset_out~0#1 % 4096 % 4294967296;havoc __main_~return_value_xrealloc$1~0#1.base, __main_~return_value_xrealloc$1~0#1.offset;assume { :begin_inline_xrealloc } true;xrealloc_#in~ptr#1.base, xrealloc_#in~ptr#1.offset, xrealloc_#in~size#1 := __main_~line_out~0#1.base, __main_~line_out~0#1.offset, (4096 + __main_~offset_out~0#1) % 4294967296;havoc xrealloc_#res#1.base, xrealloc_#res#1.offset;havoc xrealloc_#t~realloc~res246#1.base, xrealloc_#t~realloc~res246#1.offset, xrealloc_#t~varargs247#1.base, xrealloc_#t~varargs247#1.offset, xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset, xrealloc_~size#1;xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset := xrealloc_#in~ptr#1.base, xrealloc_#in~ptr#1.offset;xrealloc_~size#1 := xrealloc_#in~size#1; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2495: assume !(0 == __main_~offset_out~0#1 % 4096 % 4294967296); [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958: getopt32_~flags~0#1 := getopt32_#t~bitwise201#1;havoc getopt32_#t~mem199#1;havoc getopt32_#t~bitwise200#1;havoc getopt32_#t~bitwise201#1; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-2: havoc getopt32_#t~bitwise201#1;assume (getopt32_#t~bitwise201#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise201#1 % 4294967296 >= getopt32_#t~bitwise200#1 % 4294967296) && getopt32_#t~bitwise201#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise200#1 % 4294967296; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-1: [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise200#1 % 4294967296;getopt32_#t~bitwise201#1 := getopt32_#t~bitwise200#1; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise200#1 % 4294967296); [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-3: assume 0 == getopt32_#t~bitwise200#1 % 4294967296;getopt32_#t~bitwise201#1 := getopt32_~flags~0#1; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-3: assume !(0 == getopt32_#t~bitwise200#1 % 4294967296); [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-6: havoc getopt32_#t~bitwise200#1;assume getopt32_#t~bitwise200#1 % 4294967296 <= getopt32_#t~mem199#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-5: [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise200#1 := getopt32_#t~mem199#1; [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-7: assume getopt32_#t~mem199#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise200#1 := 0; [2025-02-08 13:26:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-7: assume !(getopt32_#t~mem199#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-9: assume 0 == getopt32_#t~mem199#1 % 4294967296;getopt32_#t~bitwise200#1 := getopt32_~trigger~0#1; [2025-02-08 13:26:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958-9: assume !(0 == getopt32_#t~mem199#1 % 4294967296); [2025-02-08 13:26:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-1: [2025-02-08 13:26:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: getopt32_~flags~0#1 := getopt32_#t~bitwise202#1;havoc getopt32_#t~bitwise202#1;call getopt32_#t~mem203#1.base, getopt32_#t~mem203#1.offset := read~$Pointer$#17(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:26:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise202#1 := 0; [2025-02-08 13:26:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-2: havoc getopt32_#t~bitwise202#1;assume getopt32_#t~bitwise202#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise202#1 := getopt32_~trigger~0#1; [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise202#1 := getopt32_~flags~0#1; [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563: assume !(0 == __main_~offset_out~0#1 % 4294967296); [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563: assume !!(0 == __main_~offset_out~0#1 % 4294967296); [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2960: assume !(getopt32_#t~mem203#1.base == 0 && getopt32_#t~mem203#1.offset == 0);havoc getopt32_#t~mem203#1.base, getopt32_#t~mem203#1.offset;call getopt32_#t~mem204#1.base, getopt32_#t~mem204#1.offset := read~$Pointer$#17(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem205#1.base, getopt32_#t~mem205#1.offset := read~$Pointer$#17(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem206#1 := read~int#16(getopt32_#t~mem205#1.base, getopt32_#t~mem205#1.offset, 4); [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2960: assume !!(getopt32_#t~mem203#1.base == 0 && getopt32_#t~mem203#1.offset == 0);havoc getopt32_#t~mem203#1.base, getopt32_#t~mem203#1.offset; [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2564: SUMMARY for call write2stdout(__main_~line_out~0#1.base, __main_~line_out~0#1.offset, __main_~offset_out~0#1); srcloc: null [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2498: __main_#t~ret95#1.base, __main_#t~ret95#1.offset := xrealloc_#res#1.base, xrealloc_#res#1.offset;havoc xrealloc_#t~realloc~res246#1.base, xrealloc_#t~realloc~res246#1.offset, xrealloc_#t~varargs247#1.base, xrealloc_#t~varargs247#1.offset, xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset, xrealloc_~size#1;havoc xrealloc_#in~ptr#1.base, xrealloc_#in~ptr#1.offset, xrealloc_#in~size#1;assume { :end_inline_xrealloc } true;__main_~return_value_xrealloc$1~0#1.base, __main_~return_value_xrealloc$1~0#1.offset := __main_#t~ret95#1.base, __main_#t~ret95#1.offset;havoc __main_#t~ret95#1.base, __main_#t~ret95#1.offset;__main_~line_out~0#1.base, __main_~line_out~0#1.offset := __main_~return_value_xrealloc$1~0#1.base, __main_~return_value_xrealloc$1~0#1.offset;havoc __main_~return_value_xrealloc$1~0#1.base, __main_~return_value_xrealloc$1~0#1.offset; [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: assume (if __main_~logical_end~0#1 % 4294967296 % 4294967296 <= 2147483647 then __main_~logical_end~0#1 % 4294967296 % 4294967296 else __main_~logical_end~0#1 % 4294967296 % 4294967296 - 4294967296) >= 0;havoc __main_~bb__isblank~0#1;call __main_#t~mem98#1 := read~int#15(__main_~line_out~0#1.base, __main_~line_out~0#1.offset + (if __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 else __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);__main_~bb__isblank~0#1 := __main_#t~mem98#1;havoc __main_#t~mem98#1;__main_~tmp_statement_expression$3~0#1 := (if 0 == (if 32 == (if __main_~bb__isblank~0#1 % 256 % 4294967296 <= 2147483647 then __main_~bb__isblank~0#1 % 256 % 4294967296 else __main_~bb__isblank~0#1 % 256 % 4294967296 - 4294967296) || 9 == (if __main_~bb__isblank~0#1 % 256 % 4294967296 <= 2147483647 then __main_~bb__isblank~0#1 % 256 % 4294967296 else __main_~bb__isblank~0#1 % 256 % 4294967296 - 4294967296) then 1 else 0) then 0 else 1); [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: assume !((if __main_~logical_end~0#1 % 4294967296 % 4294967296 <= 2147483647 then __main_~logical_end~0#1 % 4294967296 % 4294967296 else __main_~logical_end~0#1 % 4294967296 % 4294967296 - 4294967296) >= 0);havoc __main_~fold_main$$1$$2$$2$$4$$i~0#1, __main_~logical_end~0#1; [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961-1: assume 1 + getopt32_#t~mem206#1 >= -2147483648; [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961-1: assume !(1 + getopt32_#t~mem206#1 >= -2147483648); [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume 1 + getopt32_#t~mem206#1 <= 2147483647;call write~int#16(1 + getopt32_#t~mem206#1, getopt32_#t~mem204#1.base, getopt32_#t~mem204#1.offset, 4); [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume !(1 + getopt32_#t~mem206#1 <= 2147483647); [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2598: fopen_or_warn_stdin_#t~ret110#1.base, fopen_or_warn_stdin_#t~ret110#1.offset := fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset;havoc fopen_or_warn_#t~nondet107#1.base, fopen_or_warn_#t~nondet107#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~ret110#1.base, fopen_or_warn_stdin_#t~ret110#1.offset; [2025-02-08 13:26:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: havoc __main_~return_value_fclose_if_not_stdin$5~0#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_~istream~0#1.base, __main_~istream~0#1.offset;havoc fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet73#1, fclose_if_not_stdin_#t~nondet74#1, fclose_if_not_stdin_#t~bitwise75#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~nondet73#1 && fclose_if_not_stdin_#t~nondet73#1 <= 2147483647;fclose_if_not_stdin_~r~0#1 := fclose_if_not_stdin_#t~nondet73#1;havoc fclose_if_not_stdin_#t~nondet73#1; [2025-02-08 13:26:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem207#1 := read~int#17(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:26:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:26:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566: __main_#t~ret103#1 := fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet73#1, fclose_if_not_stdin_#t~nondet74#1, fclose_if_not_stdin_#t~bitwise75#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~ret103#1 && __main_#t~ret103#1 <= 2147483647;__main_~return_value_fclose_if_not_stdin$5~0#1 := __main_#t~ret103#1;havoc __main_#t~ret103#1; [2025-02-08 13:26:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567: assume !(0 == __main_~return_value_fclose_if_not_stdin$5~0#1);call __main_#t~mem104#1.base, __main_#t~mem104#1.offset := read~$Pointer$#4(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:26:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567: assume !!(0 == __main_~return_value_fclose_if_not_stdin$5~0#1); [2025-02-08 13:26:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2501-1: assume true; [2025-02-08 13:26:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2501-1: assume !true; [2025-02-08 13:26:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2501: assume true;call write~int#15((if __main_~c~0#1 % 256 <= 127 then __main_~c~0#1 % 256 else __main_~c~0#1 % 256 - 256), __main_~line_out~0#1.base, __main_~line_out~0#1.offset + (if __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 else __main_~offset_out~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); [2025-02-08 13:26:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2501: assume !true; [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964: assume 1 == getopt32_#t~mem207#1;havoc getopt32_#t~mem207#1;call getopt32_#t~mem208#1.base, getopt32_#t~mem208#1.offset := read~$Pointer$#17(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~mem208#1.base, getopt32_#t~mem208#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem227#1.base, llist_add_to_end_#t~mem227#1.offset, llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#1.offset, llist_add_to_end_#t~ret229#1.base, llist_add_to_end_#t~ret229#1.offset, llist_add_to_end_#t~mem230#1.base, llist_add_to_end_#t~mem230#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset;llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset := llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset; [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964: assume !(1 == getopt32_#t~mem207#1);havoc getopt32_#t~mem207#1;call getopt32_#t~mem209#1 := read~int#17(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3097: havoc xasprintf_#t~mem240#1.base, xasprintf_#t~mem240#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset;__main_#t~ret86#1.base, __main_#t~ret86#1.offset := xasprintf_#res#1.base, xasprintf_#res#1.offset;havoc xasprintf_#t~ret238#1, xasprintf_#t~varargs239#1.base, xasprintf_#t~varargs239#1.offset, xasprintf_#t~mem240#1.base, xasprintf_#t~mem240#1.offset, xasprintf_~format#1.base, xasprintf_~format#1.offset, xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset, xasprintf_~r~1#1, xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset;havoc xasprintf_#in~format#1.base, xasprintf_#in~format#1.offset, xasprintf_#varArgs#1.base, xasprintf_#varArgs#1.offset;assume { :end_inline_xasprintf } true;call write~$Pointer$#4(__main_#t~ret86#1.base, __main_#t~ret86#1.offset, __main_~argv#1.base, __main_~argv#1.offset + 8 * __main_~i~0#1, 8);havoc __main_#t~varargs85#1.base, __main_#t~varargs85#1.offset;havoc __main_#t~ret86#1.base, __main_#t~ret86#1.offset; [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2569-1: SUMMARY for call bb_simple_perror_msg(__main_#t~mem104#1.base, __main_#t~mem104#1.offset); srcloc: null [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2536: assume !(0 == __main_~tmp_statement_expression$3~0#1 % 256);__main_~logical_end~0#1 := 1 + __main_~logical_end~0#1; [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2536: assume !!(0 == __main_~tmp_statement_expression$3~0#1 % 256);havoc __main_~bb__isblank~0#1;__main_~logical_end~0#1 := __main_~logical_end~0#1 - 1; [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2569: havoc __main_#t~mem104#1.base, __main_#t~mem104#1.offset;__main_~exitcode~0#1 := 1; [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2405: assume !(0 == fclose_if_not_stdin_~r~0#1);call write~int#8(5, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2405: assume !!(0 == fclose_if_not_stdin_~r~0#1); [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume 2 == getopt32_#t~mem209#1;havoc getopt32_#t~mem209#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~ret241#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; [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume !(2 == getopt32_#t~mem209#1);havoc getopt32_#t~mem209#1;call getopt32_#t~mem212#1.base, getopt32_#t~mem212#1.offset := read~$Pointer$#17(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539-1: SUMMARY for call write2stdout(__main_~line_out~0#1.base, __main_~line_out~0#1.offset, __main_~logical_end~0#1); srcloc: null [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2506: assume 10 == __main_~c~0#1; [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2506: assume !(10 == __main_~c~0#1); [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539: assume -2147483648 <= __main_#t~nondet99#1 && __main_#t~nondet99#1 <= 2147483647;havoc __main_#t~nondet99#1; [2025-02-08 13:26:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: call ULTIMATE.dealloc(__main_~#w_opt~0#1.base, __main_~#w_opt~0#1.offset);havoc __main_~#w_opt~0#1.base, __main_~#w_opt~0#1.offset; [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2407: havoc fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3134: xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset := xrealloc_#t~realloc~res246#1.base, xrealloc_#t~realloc~res246#1.offset;havoc xrealloc_#t~realloc~res246#1.base, xrealloc_#t~realloc~res246#1.offset; [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3134-1: SUMMARY for call xrealloc_#t~realloc~res246#1.base, xrealloc_#t~realloc~res246#1.offset := #Ultimate.C_realloc#15(xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset, xrealloc_~size#1); srcloc: null [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2573: __main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset;havoc __main_~istream~0#1.base, __main_~istream~0#1.offset, __main_~c~0#1, __main_~column~0#1, __main_~offset_out~0#1;call __main_#t~mem105#1.base, __main_#t~mem105#1.offset := read~$Pointer$#4(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2408: 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~nondet74#1 && fclose_if_not_stdin_#t~nondet74#1 <= 2147483647;fclose_if_not_stdin_~return_value_fclose$1~0#1 := fclose_if_not_stdin_#t~nondet74#1;havoc fclose_if_not_stdin_#t~nondet74#1; [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2408: assume !!(fclose_if_not_stdin_~f#1.base == ~stdin~0.base && fclose_if_not_stdin_~f#1.offset == ~stdin~0.offset); [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3102: xatoi_positive_~return_value_xatou_range$1~0#1 := xatoi_positive_#t~ret241#1;havoc xatoi_positive_#t~ret241#1;xatoi_positive_#res#1 := (if xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 <= 2147483647 then xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 else xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3135: assume xrealloc_~ptr#1.base == 0 && xrealloc_~ptr#1.offset == 0; [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3135: assume !(xrealloc_~ptr#1.base == 0 && xrealloc_~ptr#1.offset == 0); [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036: assume true;call llist_add_to_end_#t~mem227#1.base, llist_add_to_end_#t~mem227#1.offset := read~$Pointer$#16(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036: assume !true; [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3102-1: SUMMARY for call xatoi_positive_#t~ret241#1 := xatou_range(xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, 0, 2147483647); srcloc: null [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036-2: assume !!(llist_add_to_end_#t~mem227#1.base == 0 && llist_add_to_end_#t~mem227#1.offset == 0);havoc llist_add_to_end_#t~mem227#1.base, llist_add_to_end_#t~mem227#1.offset; [2025-02-08 13:26:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036-2: assume !(llist_add_to_end_#t~mem227#1.base == 0 && llist_add_to_end_#t~mem227#1.offset == 0);havoc llist_add_to_end_#t~mem227#1.base, llist_add_to_end_#t~mem227#1.offset;call llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#1.offset := read~$Pointer$#16(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~mem228#1.base, llist_add_to_end_#t~mem228#1.offset;havoc llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#1.offset; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: getopt32_#t~ret210#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret241#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~ret210#1 && getopt32_#t~ret210#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret210#1;havoc getopt32_#t~ret210#1;call getopt32_#t~mem211#1.base, getopt32_#t~mem211#1.offset := read~$Pointer$#17(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~int#16(getopt32_~return_value_xatoi_positive$13~0#1, getopt32_#t~mem211#1.base, getopt32_#t~mem211#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem211#1.base, getopt32_#t~mem211#1.offset; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2541-1: SUMMARY for call __main_#t~memmove~res100#1.base, __main_#t~memmove~res100#1.offset := #Ultimate.C_memmove#15(__main_~line_out~0#1.base, __main_~line_out~0#1.offset, __main_~line_out~0#1.base, __main_~line_out~0#1.offset + (if __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 else __main_~logical_end~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), (__main_~offset_out~0#1 - __main_~logical_end~0#1) % 4294967296); srcloc: null [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2508: __main_~offset_out~0#1 := 0;__main_~column~0#1 := __main_~offset_out~0#1; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2541: havoc __main_#t~memmove~res100#1.base, __main_#t~memmove~res100#1.offset;__main_~offset_out~0#1 := __main_~offset_out~0#1 - __main_~logical_end~0#1;__main_~fold_main$$1$$2$$2$$4$$i~0#1 := 0;__main_~column~0#1 := __main_~fold_main$$1$$2$$2$$4$$i~0#1; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2508-1: SUMMARY for call write2stdout(__main_~line_out~0#1.base, __main_~line_out~0#1.offset, 1 + __main_~offset_out~0#1); srcloc: null [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: havoc getopt_long_#t~ret295#1;getopt32_#t~ret188#1 := getopt_long_#res#1;havoc getopt_long_#t~mem291#1.base, getopt_long_#t~mem291#1.offset, getopt_long_#t~mem292#1, getopt_long_#t~mem293#1.base, getopt_long_#t~mem293#1.offset, getopt_long_#t~mem294#1, getopt_long_#t~ret295#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~ret188#1 && getopt32_#t~ret188#1 <= 2147483647;getopt32_~c~1#1 := getopt32_#t~ret188#1;havoc getopt32_#t~ret188#1; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268-2: getopt_long_#t~ret295#1 := getopt_#res#1;havoc getopt_#t~mem275#1.base, getopt_#t~mem275#1.offset, getopt_#t~mem276#1, getopt_#t~short277#1, getopt_#t~nondet278#1, getopt_#t~nondet279#1, getopt_#t~mem280#1, getopt_#t~short281#1, getopt_#t~nondet282#1, getopt_#t~mem283#1, getopt_#t~nondet284#1, getopt_#t~pre285#1, getopt_#t~mem286#1, getopt_#t~short287#1, getopt_#t~nondet288#1, getopt_#t~mem289#1.base, getopt_#t~mem289#1.offset, getopt_#t~pre290#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~ret295#1 && getopt_long_#t~ret295#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret295#1;havoc getopt_long_#t~ret295#1; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3137: assume !(0 == xrealloc_~size#1 % 18446744073709551616);call xrealloc_#t~varargs247#1.base, xrealloc_#t~varargs247#1.offset := #Ultimate.allocOnHeap(0); [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3137: assume !!(0 == xrealloc_~size#1 % 18446744073709551616); [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3038: 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~ret264#1.base, xzalloc_#t~ret264#1.offset, xzalloc_#t~memset~res265#1.base, xzalloc_#t~memset~res265#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;xzalloc_~size#1 := xzalloc_#in~size#1;havoc xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411: havoc fclose_if_not_stdin_#t~bitwise75#1; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-3: [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-2: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_#t~bitwise75#1;havoc fclose_if_not_stdin_#t~bitwise75#1; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-5: assume 0 == fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_#t~bitwise75#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-5: assume !(0 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-4: havoc fclose_if_not_stdin_#t~bitwise75#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~bitwise75#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~bitwise75#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~bitwise75#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~bitwise75#1 < 0)) && fclose_if_not_stdin_#t~bitwise75#1 <= 2147483647; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-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~bitwise75#1 := fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-6: assume !(0 == fclose_if_not_stdin_~r~0#1 || fclose_if_not_stdin_~r~0#1 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3138: SUMMARY for call bb_error_msg_and_die(~#bb_msg_memory_exhausted~0.base, ~#bb_msg_memory_exhausted~0.offset, xrealloc_#t~varargs247#1.base, xrealloc_#t~varargs247#1.offset); srcloc: null [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3039: llist_add_to_end_#t~ret229#1.base, llist_add_to_end_#t~ret229#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret264#1.base, xzalloc_#t~ret264#1.offset, xzalloc_#t~memset~res265#1.base, xzalloc_#t~memset~res265#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~ret229#1.base, llist_add_to_end_#t~ret229#1.offset;havoc llist_add_to_end_#t~ret229#1.base, llist_add_to_end_#t~ret229#1.offset;call write~$Pointer$#16(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~mem230#1.base, llist_add_to_end_#t~mem230#1.offset := read~$Pointer$#16(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$#16(llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_#t~mem230#1.base, 8 + llist_add_to_end_#t~mem230#1.offset, 8);havoc llist_add_to_end_#t~mem230#1.base, llist_add_to_end_#t~mem230#1.offset;havoc llist_add_to_end_#t~mem227#1.base, llist_add_to_end_#t~mem227#1.offset, llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#1.offset, llist_add_to_end_#t~ret229#1.base, llist_add_to_end_#t~ret229#1.offset, llist_add_to_end_#t~mem230#1.base, llist_add_to_end_#t~mem230#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;havoc llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset;assume { :end_inline_llist_add_to_end } true; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume !(getopt32_#t~mem212#1.base == 0 && getopt32_#t~mem212#1.offset == 0);havoc getopt32_#t~mem212#1.base, getopt32_#t~mem212#1.offset;call getopt32_#t~mem213#1.base, getopt32_#t~mem213#1.offset := read~$Pointer$#17(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~$Pointer$#16(~optarg~0.base, ~optarg~0.offset, getopt32_#t~mem213#1.base, getopt32_#t~mem213#1.offset, 8); [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume !!(getopt32_#t~mem212#1.base == 0 && getopt32_#t~mem212#1.offset == 0);havoc getopt32_#t~mem212#1.base, getopt32_#t~mem212#1.offset; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545: assume !(__main_~fold_main$$1$$2$$2$$4$$i~0#1 % 4294967296 >= __main_~offset_out~0#1 % 4294967296);havoc __main_~return_value_adjust_column$4~0#1;call __main_#t~mem101#1 := read~int#15(__main_~line_out~0#1.base, __main_~line_out~0#1.offset + (if __main_~fold_main$$1$$2$$2$$4$$i~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~fold_main$$1$$2$$2$$4$$i~0#1 % 4294967296 % 18446744073709551616 else __main_~fold_main$$1$$2$$2$$4$$i~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545: assume !!(__main_~fold_main$$1$$2$$2$$4$$i~0#1 % 4294967296 >= __main_~offset_out~0#1 % 4294967296); [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479-1: assume !(__main_#t~mem105#1.base == 0 && __main_#t~mem105#1.offset == 0);havoc __main_#t~mem105#1.base, __main_#t~mem105#1.offset; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479-1: assume !!(__main_#t~mem105#1.base == 0 && __main_#t~mem105#1.offset == 0);havoc __main_#t~mem105#1.base, __main_#t~mem105#1.offset; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2413-1: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:26:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3140-1: xrealloc_#res#1.base, xrealloc_#res#1.offset := xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset; [2025-02-08 13:26:24,025 INFO L? ?]: Removed 1008 outVars from TransFormulas that were not future-live. [2025-02-08 13:26:24,026 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:26:24,079 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:26:24,079 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:26:24,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:24 BoogieIcfgContainer [2025-02-08 13:26:24,080 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:26:24,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:26:24,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:26:24,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:26:24,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:26:14" (1/3) ... [2025-02-08 13:26:24,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bd182a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:24, skipping insertion in model container [2025-02-08 13:26:24,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:15" (2/3) ... [2025-02-08 13:26:24,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bd182a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:24, skipping insertion in model container [2025-02-08 13:26:24,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:24" (3/3) ... [2025-02-08 13:26:24,091 INFO L128 eAbstractionObserver]: Analyzing ICFG fold-1.i [2025-02-08 13:26:24,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:26:24,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fold-1.i that has 102 procedures, 852 locations, 1 initial locations, 126 loop locations, and 66 error locations. [2025-02-08 13:26:24,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:26:24,194 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;@58e4dabc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:26:24,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-02-08 13:26:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 461 states, 345 states have (on average 1.6753623188405797) internal successors, (578), 431 states have internal predecessors, (578), 21 states have call successors, (21), 12 states have call predecessors, (21), 12 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 13:26:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:26:24,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:24,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:26:24,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:26:24,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1503370, now seen corresponding path program 1 times [2025-02-08 13:26:24,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:24,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768280191] [2025-02-08 13:26:24,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:24,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:24,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:26:25,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:26:25,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:25,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:25,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:25,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768280191] [2025-02-08 13:26:25,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768280191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:25,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:25,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:26:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208411382] [2025-02-08 13:26:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:25,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:25,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:25,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:25,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:25,460 INFO L87 Difference]: Start difference. First operand has 461 states, 345 states have (on average 1.6753623188405797) internal successors, (578), 431 states have internal predecessors, (578), 21 states have call successors, (21), 12 states have call predecessors, (21), 12 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:25,589 INFO L93 Difference]: Finished difference Result 713 states and 974 transitions. [2025-02-08 13:26:25,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:25,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 13:26:25,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:25,605 INFO L225 Difference]: With dead ends: 713 [2025-02-08 13:26:25,607 INFO L226 Difference]: Without dead ends: 235 [2025-02-08 13:26:25,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:25,617 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 1 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:25,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 620 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-08 13:26:25,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-02-08 13:26:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 185 states have (on average 1.518918918918919) internal successors, (281), 220 states have internal predecessors, (281), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 297 transitions. [2025-02-08 13:26:25,682 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 297 transitions. Word has length 3 [2025-02-08 13:26:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:25,682 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 297 transitions. [2025-02-08 13:26:25,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 297 transitions. [2025-02-08 13:26:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:26:25,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:25,685 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:26:25,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:26:25,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:26:25,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:25,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1838661693, now seen corresponding path program 1 times [2025-02-08 13:26:25,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:25,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814539708] [2025-02-08 13:26:25,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:25,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:26,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:26:26,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:26:26,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:26,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:26,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:26,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814539708] [2025-02-08 13:26:26,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814539708] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927928340] [2025-02-08 13:26:26,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:26,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:26,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:26,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:26,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:26:27,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:26:27,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:26:27,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:27,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:27,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:27,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:27,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:27,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927928340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:27,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:27,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:26:27,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569762871] [2025-02-08 13:26:27,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:27,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:26:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:27,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:26:27,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:27,689 INFO L87 Difference]: Start difference. First operand 235 states and 297 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:31,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:31,818 INFO L93 Difference]: Finished difference Result 235 states and 297 transitions. [2025-02-08 13:26:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:26:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:26:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:31,820 INFO L225 Difference]: With dead ends: 235 [2025-02-08 13:26:31,820 INFO L226 Difference]: Without dead ends: 234 [2025-02-08 13:26:31,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:31,821 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:31,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 567 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-08 13:26:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-02-08 13:26:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 185 states have (on average 1.5135135135135136) internal successors, (280), 219 states have internal predecessors, (280), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 296 transitions. [2025-02-08 13:26:31,840 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 296 transitions. Word has length 6 [2025-02-08 13:26:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:31,841 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 296 transitions. [2025-02-08 13:26:31,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 296 transitions. [2025-02-08 13:26:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:26:31,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:31,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:26:31,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:32,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:32,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:26:32,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1163939084, now seen corresponding path program 1 times [2025-02-08 13:26:32,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:32,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934199619] [2025-02-08 13:26:32,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:32,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:26:32,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:26:32,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:32,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:26:32,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:32,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934199619] [2025-02-08 13:26:32,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934199619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:32,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:32,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:32,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276982066] [2025-02-08 13:26:32,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:32,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:32,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:32,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:32,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:32,618 INFO L87 Difference]: Start difference. First operand 234 states and 296 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:32,690 INFO L93 Difference]: Finished difference Result 234 states and 296 transitions. [2025-02-08 13:26:32,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:32,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 13:26:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:32,691 INFO L225 Difference]: With dead ends: 234 [2025-02-08 13:26:32,691 INFO L226 Difference]: Without dead ends: 233 [2025-02-08 13:26:32,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:32,692 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:32,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:32,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-08 13:26:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2025-02-08 13:26:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 183 states have (on average 1.5136612021857923) internal successors, (277), 216 states have internal predecessors, (277), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 293 transitions. [2025-02-08 13:26:32,705 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 293 transitions. Word has length 7 [2025-02-08 13:26:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:32,705 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 293 transitions. [2025-02-08 13:26:32,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 293 transitions. [2025-02-08 13:26:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:26:32,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:32,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:32,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:26:32,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:26:32,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:32,706 INFO L85 PathProgramCache]: Analyzing trace with hash -871180563, now seen corresponding path program 1 times [2025-02-08 13:26:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:32,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796670108] [2025-02-08 13:26:32,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:32,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:33,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:26:33,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:26:33,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:33,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:33,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796670108] [2025-02-08 13:26:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796670108] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042944028] [2025-02-08 13:26:33,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:33,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:33,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:33,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:33,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:26:34,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:26:34,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:26:34,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:34,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:34,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 1507 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:26:34,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:34,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:26:34,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:34,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042944028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:34,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:34,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:26:34,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154148046] [2025-02-08 13:26:34,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:34,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:34,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:34,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:34,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:34,567 INFO L87 Difference]: Start difference. First operand 231 states and 293 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:38,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:38,710 INFO L93 Difference]: Finished difference Result 231 states and 293 transitions. [2025-02-08 13:26:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:38,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 13:26:38,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:38,712 INFO L225 Difference]: With dead ends: 231 [2025-02-08 13:26:38,713 INFO L226 Difference]: Without dead ends: 229 [2025-02-08 13:26:38,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:38,715 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 237 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:38,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 321 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-08 13:26:38,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-02-08 13:26:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 183 states have (on average 1.5027322404371584) internal successors, (275), 214 states have internal predecessors, (275), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 291 transitions. [2025-02-08 13:26:38,738 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 291 transitions. Word has length 11 [2025-02-08 13:26:38,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:38,740 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 291 transitions. [2025-02-08 13:26:38,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 291 transitions. [2025-02-08 13:26:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:26:38,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:38,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:38,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:38,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:38,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:26:38,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1236792234, now seen corresponding path program 1 times [2025-02-08 13:26:38,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:38,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083668342] [2025-02-08 13:26:38,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:38,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:39,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:26:39,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:26:39,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:39,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:39,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:39,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083668342] [2025-02-08 13:26:39,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083668342] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:39,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058465072] [2025-02-08 13:26:39,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:39,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:39,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:39,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:39,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:26:40,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:26:40,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:26:40,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:40,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:40,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:40,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:40,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:26:40,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058465072] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:40,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:40,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:26:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019509597] [2025-02-08 13:26:40,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:40,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:26:40,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:40,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:26:40,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:40,863 INFO L87 Difference]: Start difference. First operand 229 states and 291 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:40,918 INFO L93 Difference]: Finished difference Result 462 states and 588 transitions. [2025-02-08 13:26:40,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:40,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:26:40,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:40,920 INFO L225 Difference]: With dead ends: 462 [2025-02-08 13:26:40,920 INFO L226 Difference]: Without dead ends: 238 [2025-02-08 13:26:40,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:40,921 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 4 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:40,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 564 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-08 13:26:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-02-08 13:26:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 192 states have (on average 1.4791666666666667) internal successors, (284), 223 states have internal predecessors, (284), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 300 transitions. [2025-02-08 13:26:40,929 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 300 transitions. Word has length 12 [2025-02-08 13:26:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:40,930 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 300 transitions. [2025-02-08 13:26:40,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:26:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 300 transitions. [2025-02-08 13:26:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:26:40,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:40,930 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:40,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:26:41,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:41,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:26:41,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash 501187875, now seen corresponding path program 2 times [2025-02-08 13:26:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:41,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341555386] [2025-02-08 13:26:41,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:26:41,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:41,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:26:41,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:26:41,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:26:41,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:41,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:41,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341555386] [2025-02-08 13:26:41,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341555386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:41,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:41,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:26:41,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985161057] [2025-02-08 13:26:41,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:41,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:26:41,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:41,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:26:41,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:41,761 INFO L87 Difference]: Start difference. First operand 238 states and 300 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:45,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:45,952 INFO L93 Difference]: Finished difference Result 238 states and 300 transitions. [2025-02-08 13:26:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:26:45,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:26:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:45,954 INFO L225 Difference]: With dead ends: 238 [2025-02-08 13:26:45,954 INFO L226 Difference]: Without dead ends: 236 [2025-02-08 13:26:45,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:45,955 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 236 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:45,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 860 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:26:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-08 13:26:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-02-08 13:26:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 192 states have (on average 1.46875) internal successors, (282), 221 states have internal predecessors, (282), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 298 transitions. [2025-02-08 13:26:45,967 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 298 transitions. Word has length 21 [2025-02-08 13:26:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:45,967 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 298 transitions. [2025-02-08 13:26:45,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 298 transitions. [2025-02-08 13:26:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:26:45,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:45,969 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:45,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:26:45,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:26:45,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:45,970 INFO L85 PathProgramCache]: Analyzing trace with hash 935031035, now seen corresponding path program 1 times [2025-02-08 13:26:45,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:45,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116534499] [2025-02-08 13:26:45,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:45,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:46,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:26:46,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:26:46,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:46,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:46,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:46,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116534499] [2025-02-08 13:26:46,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116534499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:46,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:26:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996094987] [2025-02-08 13:26:46,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:46,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:46,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:46,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:46,530 INFO L87 Difference]: Start difference. First operand 236 states and 298 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:50,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:50,634 INFO L93 Difference]: Finished difference Result 456 states and 581 transitions. [2025-02-08 13:26:50,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:50,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:26:50,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:50,636 INFO L225 Difference]: With dead ends: 456 [2025-02-08 13:26:50,636 INFO L226 Difference]: Without dead ends: 239 [2025-02-08 13:26:50,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:50,637 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 2 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:50,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 557 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-08 13:26:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-02-08 13:26:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 224 states have internal predecessors, (285), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 301 transitions. [2025-02-08 13:26:50,650 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 301 transitions. Word has length 26 [2025-02-08 13:26:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:50,652 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 301 transitions. [2025-02-08 13:26:50,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 301 transitions. [2025-02-08 13:26:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:26:50,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:50,653 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:50,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:26:50,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:26:50,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1642128676, now seen corresponding path program 1 times [2025-02-08 13:26:50,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:50,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478938072] [2025-02-08 13:26:50,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:50,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:51,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:51,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:51,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:51,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478938072] [2025-02-08 13:26:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478938072] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12903528] [2025-02-08 13:26:51,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:51,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:51,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:51,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:51,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:26:52,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:52,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:52,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:52,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:52,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:26:52,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 13:26:52,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:52,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12903528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:52,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:52,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:26:52,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845100500] [2025-02-08 13:26:52,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:52,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:52,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:52,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:52,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:52,513 INFO L87 Difference]: Start difference. First operand 239 states and 301 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:56,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:56,597 INFO L93 Difference]: Finished difference Result 239 states and 301 transitions. [2025-02-08 13:26:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:56,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 13:26:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:56,599 INFO L225 Difference]: With dead ends: 239 [2025-02-08 13:26:56,599 INFO L226 Difference]: Without dead ends: 238 [2025-02-08 13:26:56,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:56,599 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 3 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:56,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 547 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-08 13:26:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-02-08 13:26:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 195 states have (on average 1.4564102564102563) internal successors, (284), 223 states have internal predecessors, (284), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 300 transitions. [2025-02-08 13:26:56,610 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 300 transitions. Word has length 29 [2025-02-08 13:26:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:56,610 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 300 transitions. [2025-02-08 13:26:56,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 300 transitions. [2025-02-08 13:26:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:26:56,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:56,611 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:56,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:26:56,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 13:26:56,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:26:56,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1642128516, now seen corresponding path program 1 times [2025-02-08 13:26:56,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:56,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155653648] [2025-02-08 13:26:56,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:56,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:57,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:57,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:57,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:57,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:57,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:57,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155653648] [2025-02-08 13:26:57,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155653648] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:57,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484919247] [2025-02-08 13:26:57,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:57,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:57,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:57,420 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:57,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:26:58,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:58,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:58,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:58,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:58,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:26:58,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:26:58,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:58,649 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:26:58,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484919247] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:58,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:58,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:26:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609844112] [2025-02-08 13:26:58,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:58,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:26:58,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:58,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:26:58,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:26:58,650 INFO L87 Difference]: Start difference. First operand 238 states and 300 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:27:02,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:06,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:06,930 INFO L93 Difference]: Finished difference Result 479 states and 609 transitions. [2025-02-08 13:27:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:27:06,931 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-02-08 13:27:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:06,934 INFO L225 Difference]: With dead ends: 479 [2025-02-08 13:27:06,934 INFO L226 Difference]: Without dead ends: 255 [2025-02-08 13:27:06,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:27:06,935 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 5 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:06,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1906 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-08 13:27:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-08 13:27:06,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-02-08 13:27:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 213 states have (on average 1.4131455399061033) internal successors, (301), 240 states have internal predecessors, (301), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 317 transitions. [2025-02-08 13:27:06,947 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 317 transitions. Word has length 29 [2025-02-08 13:27:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:06,948 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 317 transitions. [2025-02-08 13:27:06,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:27:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 317 transitions. [2025-02-08 13:27:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:27:06,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:06,950 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:06,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 13:27:07,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:07,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:27:07,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:07,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1774089432, now seen corresponding path program 1 times [2025-02-08 13:27:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:07,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068924123] [2025-02-08 13:27:07,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:07,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:07,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:27:07,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:27:07,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:07,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:27:07,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:07,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068924123] [2025-02-08 13:27:07,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068924123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:07,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:07,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:07,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053734005] [2025-02-08 13:27:07,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:07,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:07,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:07,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:07,650 INFO L87 Difference]: Start difference. First operand 255 states and 317 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:11,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:11,745 INFO L93 Difference]: Finished difference Result 266 states and 330 transitions. [2025-02-08 13:27:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:11,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:27:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:11,747 INFO L225 Difference]: With dead ends: 266 [2025-02-08 13:27:11,747 INFO L226 Difference]: Without dead ends: 265 [2025-02-08 13:27:11,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:11,748 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:11,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 551 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:27:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-08 13:27:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2025-02-08 13:27:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 222 states have (on average 1.40990990990991) internal successors, (313), 249 states have internal predecessors, (313), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 329 transitions. [2025-02-08 13:27:11,757 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 329 transitions. Word has length 48 [2025-02-08 13:27:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:11,757 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 329 transitions. [2025-02-08 13:27:11,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 329 transitions. [2025-02-08 13:27:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:27:11,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:11,759 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:11,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:27:11,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:27:11,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1774094397, now seen corresponding path program 1 times [2025-02-08 13:27:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:11,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335236256] [2025-02-08 13:27:11,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:12,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:27:12,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:27:12,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:12,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:27:12,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:12,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335236256] [2025-02-08 13:27:12,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335236256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:12,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:12,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:12,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150625119] [2025-02-08 13:27:12,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:12,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:12,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:12,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:12,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:12,319 INFO L87 Difference]: Start difference. First operand 264 states and 329 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:16,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:16,423 INFO L93 Difference]: Finished difference Result 264 states and 329 transitions. [2025-02-08 13:27:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:16,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:27:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:16,425 INFO L225 Difference]: With dead ends: 264 [2025-02-08 13:27:16,425 INFO L226 Difference]: Without dead ends: 263 [2025-02-08 13:27:16,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:16,426 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:16,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 553 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:27:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-08 13:27:16,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2025-02-08 13:27:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 1.408256880733945) internal successors, (307), 244 states have internal predecessors, (307), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 323 transitions. [2025-02-08 13:27:16,435 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 323 transitions. Word has length 48 [2025-02-08 13:27:16,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:16,435 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 323 transitions. [2025-02-08 13:27:16,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 323 transitions. [2025-02-08 13:27:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 13:27:16,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:16,437 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:16,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:27:16,437 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:27:16,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash -919435705, now seen corresponding path program 1 times [2025-02-08 13:27:16,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:16,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609101129] [2025-02-08 13:27:16,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:16,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:27:16,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:27:16,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:16,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:16,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:16,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609101129] [2025-02-08 13:27:16,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609101129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:16,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:16,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:16,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983020270] [2025-02-08 13:27:16,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:16,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:16,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:16,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:16,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:16,856 INFO L87 Difference]: Start difference. First operand 259 states and 323 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:16,907 INFO L93 Difference]: Finished difference Result 273 states and 341 transitions. [2025-02-08 13:27:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:16,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-08 13:27:16,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:16,909 INFO L225 Difference]: With dead ends: 273 [2025-02-08 13:27:16,910 INFO L226 Difference]: Without dead ends: 271 [2025-02-08 13:27:16,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:16,911 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 11 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:16,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 549 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:27:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-08 13:27:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2025-02-08 13:27:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 229 states have (on average 1.4061135371179039) internal successors, (322), 255 states have internal predecessors, (322), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 338 transitions. [2025-02-08 13:27:16,920 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 338 transitions. Word has length 49 [2025-02-08 13:27:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:16,920 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 338 transitions. [2025-02-08 13:27:16,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 338 transitions. [2025-02-08 13:27:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 13:27:16,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:16,921 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:16,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:27:16,921 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:27:16,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1304989194, now seen corresponding path program 1 times [2025-02-08 13:27:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:16,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304899101] [2025-02-08 13:27:16,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:16,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:17,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 13:27:17,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 13:27:17,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:17,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:17,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:17,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304899101] [2025-02-08 13:27:17,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304899101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:17,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:17,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:17,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933449301] [2025-02-08 13:27:17,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:17,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:17,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:17,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:17,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:17,344 INFO L87 Difference]: Start difference. First operand 270 states and 338 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:17,390 INFO L93 Difference]: Finished difference Result 387 states and 493 transitions. [2025-02-08 13:27:17,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:17,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-02-08 13:27:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:17,392 INFO L225 Difference]: With dead ends: 387 [2025-02-08 13:27:17,392 INFO L226 Difference]: Without dead ends: 385 [2025-02-08 13:27:17,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:17,393 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 140 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:17,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 551 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:27:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-08 13:27:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 274. [2025-02-08 13:27:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 233 states have (on average 1.4034334763948497) internal successors, (327), 259 states have internal predecessors, (327), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 343 transitions. [2025-02-08 13:27:17,403 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 343 transitions. Word has length 53 [2025-02-08 13:27:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:17,403 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 343 transitions. [2025-02-08 13:27:17,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 343 transitions. [2025-02-08 13:27:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:27:17,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:17,404 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:17,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:27:17,404 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:27:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1777260045, now seen corresponding path program 1 times [2025-02-08 13:27:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:17,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458731043] [2025-02-08 13:27:17,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:17,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:17,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:27:17,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:27:17,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:17,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:17,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:17,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458731043] [2025-02-08 13:27:17,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458731043] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:17,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518864859] [2025-02-08 13:27:17,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:17,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:17,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:17,963 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:27:17,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:27:18,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:27:19,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:27:19,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:19,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:19,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:19,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:19,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:27:19,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518864859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:19,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:27:19,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:27:19,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280294718] [2025-02-08 13:27:19,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:19,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:27:19,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:19,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:27:19,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:27:19,040 INFO L87 Difference]: Start difference. First operand 274 states and 343 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:19,101 INFO L93 Difference]: Finished difference Result 275 states and 344 transitions. [2025-02-08 13:27:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:27:19,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-02-08 13:27:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:19,103 INFO L225 Difference]: With dead ends: 275 [2025-02-08 13:27:19,103 INFO L226 Difference]: Without dead ends: 274 [2025-02-08 13:27:19,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:27:19,103 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 21 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:19,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 820 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-08 13:27:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2025-02-08 13:27:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 233 states have (on average 1.3991416309012876) internal successors, (326), 258 states have internal predecessors, (326), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 342 transitions. [2025-02-08 13:27:19,112 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 342 transitions. Word has length 54 [2025-02-08 13:27:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:19,113 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 342 transitions. [2025-02-08 13:27:19,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 342 transitions. [2025-02-08 13:27:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:27:19,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:19,114 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:19,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:27:19,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 13:27:19,314 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:27:19,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash 739514814, now seen corresponding path program 1 times [2025-02-08 13:27:19,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:19,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536404893] [2025-02-08 13:27:19,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:19,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:19,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:27:19,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:27:19,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:19,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:19,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:19,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536404893] [2025-02-08 13:27:19,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536404893] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:19,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437658296] [2025-02-08 13:27:19,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:19,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:19,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:19,768 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:27:19,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:27:20,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:27:20,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:27:20,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:20,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:20,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1788 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:20,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:20,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:27:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:27:20,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437658296] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:27:20,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:27:20,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:27:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133894046] [2025-02-08 13:27:20,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:27:20,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:27:20,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:20,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:27:20,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:20,849 INFO L87 Difference]: Start difference. First operand 273 states and 342 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:20,930 INFO L93 Difference]: Finished difference Result 311 states and 394 transitions. [2025-02-08 13:27:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:27:20,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-08 13:27:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:20,932 INFO L225 Difference]: With dead ends: 311 [2025-02-08 13:27:20,932 INFO L226 Difference]: Without dead ends: 310 [2025-02-08 13:27:20,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:20,933 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 60 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:20,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 853 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-08 13:27:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306. [2025-02-08 13:27:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 266 states have (on average 1.394736842105263) internal successors, (371), 291 states have internal predecessors, (371), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:27:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 387 transitions. [2025-02-08 13:27:20,942 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 387 transitions. Word has length 55 [2025-02-08 13:27:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:20,942 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 387 transitions. [2025-02-08 13:27:20,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 387 transitions. [2025-02-08 13:27:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:27:20,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:20,943 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:20,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 13:27:21,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:21,144 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-02-08 13:27:21,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2111344129, now seen corresponding path program 1 times [2025-02-08 13:27:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:21,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607882557] [2025-02-08 13:27:21,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:21,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:21,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:27:21,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:27:21,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:21,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:27:21,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:21,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607882557] [2025-02-08 13:27:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607882557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:21,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329017524] [2025-02-08 13:27:21,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:21,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:21,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:21,667 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:27:21,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:27:22,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:27:22,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:27:22,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:22,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:22,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:22,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:27:22,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:27:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:27:22,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329017524] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:27:22,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:27:22,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:27:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523187550] [2025-02-08 13:27:22,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:27:22,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:27:22,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:22,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:27:22,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:22,796 INFO L87 Difference]: Start difference. First operand 306 states and 387 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:26,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:30,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:34,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:38,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []