./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/head-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/head-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 215d23787da0121fe1d31fb918e95ec539d610f21ad7af0cf3de67b0df205419 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:26:14,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:26:14,439 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:14,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:26:14,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:26:14,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:26:14,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:26:14,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:26:14,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:26:14,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:26:14,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:26:14,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:26:14,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:26:14,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:26:14,465 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:26:14,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:26:14,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:26:14,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:26:14,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:26:14,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:26:14,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:26:14,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:26:14,466 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:26:14,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:26:14,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:26:14,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:26:14,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:26:14,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:26:14,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:26:14,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:26:14,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:26:14,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:26:14,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:26:14,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:26:14,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:26:14,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:26:14,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:26:14,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:26:14,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:26:14,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:26:14,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:26:14,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:26:14,469 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 -> 215d23787da0121fe1d31fb918e95ec539d610f21ad7af0cf3de67b0df205419 [2025-02-08 13:26:14,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:26:14,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:26:14,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:26:14,753 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:26:14,753 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:26:14,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/head-2.i [2025-02-08 13:26:16,011 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14fd7b582/0bf909d2c80d4617bd879cf689e94c1d/FLAGf9a1ea7b8 [2025-02-08 13:26:16,449 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:26:16,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/head-2.i [2025-02-08 13:26:16,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14fd7b582/0bf909d2c80d4617bd879cf689e94c1d/FLAGf9a1ea7b8 [2025-02-08 13:26:16,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14fd7b582/0bf909d2c80d4617bd879cf689e94c1d [2025-02-08 13:26:16,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:26:16,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:26:16,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:26:16,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:26:16,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:26:16,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:26:16" (1/1) ... [2025-02-08 13:26:16,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4294f0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:16, skipping insertion in model container [2025-02-08 13:26:16,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:26:16" (1/1) ... [2025-02-08 13:26:16,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:26:17,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:26:17,664 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:26:17,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:26:17,948 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:26:17,958 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:26:17,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:17 WrapperNode [2025-02-08 13:26:17,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:26:17,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:26:17,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:26:17,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:26:17,966 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:17" (1/1) ... [2025-02-08 13:26:18,001 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:17" (1/1) ... [2025-02-08 13:26:18,080 INFO L138 Inliner]: procedures = 581, calls = 697, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 1389 [2025-02-08 13:26:18,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:26:18,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:26:18,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:26:18,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:26:18,088 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:17" (1/1) ... [2025-02-08 13:26:18,088 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:17" (1/1) ... [2025-02-08 13:26:18,100 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:17" (1/1) ... [2025-02-08 13:26:18,174 INFO L175 MemorySlicer]: Split 566 memory accesses to 19 slices as follows [2, 3, 2, 4, 3, 2, 9, 32, 9, 24, 10, 3, 15, 7, 355, 1, 18, 47, 20]. 63 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 2, 1, 0, 0, 1, 2, 0, 0, 7, 0, 0, 0, 355, 0, 0, 2, 4]. The 120 writes are split as follows [0, 0, 0, 1, 0, 1, 4, 21, 6, 21, 0, 3, 1, 7, 0, 1, 4, 35, 15]. [2025-02-08 13:26:18,174 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:17" (1/1) ... [2025-02-08 13:26:18,174 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:17" (1/1) ... [2025-02-08 13:26:18,245 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:17" (1/1) ... [2025-02-08 13:26:18,251 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:17" (1/1) ... [2025-02-08 13:26:18,278 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:17" (1/1) ... [2025-02-08 13:26:18,291 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:17" (1/1) ... [2025-02-08 13:26:18,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:26:18,324 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:26:18,325 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:26:18,325 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:26:18,326 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:17" (1/1) ... [2025-02-08 13:26:18,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:26:18,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:18,359 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:18,364 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:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-02-08 13:26:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-02-08 13:26:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-02-08 13:26:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-02-08 13:26:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-02-08 13:26:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-02-08 13:26:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-02-08 13:26:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-02-08 13:26:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-02-08 13:26:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-02-08 13:26:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-02-08 13:26:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-02-08 13:26:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-02-08 13:26:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-02-08 13:26:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-02-08 13:26:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-02-08 13:26:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-02-08 13:26:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-02-08 13:26:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-02-08 13:26:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-02-08 13:26:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-02-08 13:26:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-02-08 13:26:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-02-08 13:26:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-02-08 13:26:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-02-08 13:26:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-02-08 13:26:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-02-08 13:26:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-02-08 13:26:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-02-08 13:26:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-02-08 13:26:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-02-08 13:26:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-02-08 13:26:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-02-08 13:26:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-02-08 13:26:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-02-08 13:26:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-02-08 13:26:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-02-08 13:26:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-02-08 13:26:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2025-02-08 13:26:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure _IO_getc [2025-02-08 13:26:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-02-08 13:26:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-02-08 13:26:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:26:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-08 13:26:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-08 13:26:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-08 13:26:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-08 13:26:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:26:18,421 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 13:26:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 13:26:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 13:26:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 13:26:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 13:26:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 13:26:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 13:26:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 13:26:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 13:26:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 13:26:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 13:26:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 13:26:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 13:26:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 13:26:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 13:26:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 13:26:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 13:26:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 13:26:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 13:26:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:26:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:26:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:26:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 13:26:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 13:26:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 13:26:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 13:26:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 13:26:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 13:26:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 13:26:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 13:26:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 13:26:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 13:26:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 13:26:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 13:26:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 13:26:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 13:26:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 13:26:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 13:26:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:26:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:26:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:26:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:26:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:26:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:26:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:26:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:26:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:26:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:26:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:26:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:26:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:26:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:26:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:26:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:26:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:26:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:26:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2025-02-08 13:26:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 13:26:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-08 13:26:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-08 13:26:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-08 13:26:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:26:18,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:26:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:26:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:26:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:26:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:26:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 13:26:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 13:26:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 13:26:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 13:26:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 13:26:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 13:26:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 13:26:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 13:26:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 13:26:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 13:26:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 13:26:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 13:26:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 13:26:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 13:26:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 13:26:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 13:26:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 13:26:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 13:26:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 13:26:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 13:26:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-02-08 13:26:18,439 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:26:18,439 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 13:26:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 13:26:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 13:26:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 13:26:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 13:26:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 13:26:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 13:26:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 13:26:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 13:26:19,058 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:26:19,060 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:26:19,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: havoc #t~nondet150; [2025-02-08 13:26:19,713 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:26:19,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2381: #t~ret68#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet81#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret68#1 && #t~ret68#1 <= 2147483647;havoc #t~ret68#1;call #t~mem69#1.base, #t~mem69#1.offset := read~$Pointer$#12(~#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~mem69#1.base, #t~mem69#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret88#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:19,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2472: full_write_#t~ret88#1 := safe_write_#res#1;havoc safe_write_#t~ret122#1, safe_write_#t~mem123#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~1#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret88#1 && full_write_#t~ret88#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret88#1;havoc full_write_#t~ret88#1; [2025-02-08 13:26:19,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2382: #t~ret70#1 := full_write_#res#1;havoc full_write_#t~ret88#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~ret70#1 && #t~ret70#1 <= 9223372036854775807;havoc #t~mem69#1.base, #t~mem69#1.offset;havoc #t~ret70#1; [2025-02-08 13:26:19,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2473: assume full_write_~cc~0#1 < 0; [2025-02-08 13:26:19,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2473: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:26:19,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729: safe_write_#t~ret122#1 := write_#res#1;havoc write_#t~nondet183#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~ret122#1 && safe_write_#t~ret122#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret122#1;havoc safe_write_#t~ret122#1; [2025-02-08 13:26:19,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2928: write_#res#1 := write_~ret~1#1; [2025-02-08 13:26:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2928-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:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem123#1 := read~int#6(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~1#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem123#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:26:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~1#1 := 0; [2025-02-08 13:26:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2475: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:26:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2475: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:26:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2470: 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~ret122#1, safe_write_#t~mem123#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~1#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~1#1; [2025-02-08 13:26:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2470: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:26:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:26:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:26:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: 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:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:26:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2727-1: assume 0 != safe_write_~tmp_if_expr$1~1#1 % 256; [2025-02-08 13:26:19,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2727-1: assume !(0 != safe_write_~tmp_if_expr$1~1#1 % 256); [2025-02-08 13:26:19,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2727: 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~nondet183#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~nondet183#1;assume -9223372036854775808 <= write_#t~nondet183#1 && write_#t~nondet183#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet183#1;havoc write_#t~nondet183#1; [2025-02-08 13:26:19,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2727: assume !true; [2025-02-08 13:26:19,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: call ULTIMATE.dealloc(~#i~0#1.base, ~#i~0#1.offset);havoc ~#i~0#1.base, ~#i~0#1.offset; [2025-02-08 13:26:24,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2529: __main_~header_threshhold~0#1 := -1; [2025-02-08 13:26:24,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2397: havoc die_if_ferror_#t~nondet74#1, die_if_ferror_#t~varargs75#1.base, die_if_ferror_#t~varargs75#1.offset, die_if_ferror_~fp#1.base, die_if_ferror_~fp#1.offset, die_if_ferror_~fn#1.base, die_if_ferror_~fn#1.offset, die_if_ferror_~return_value_ferror$1~0#1;havoc die_if_ferror_#in~fp#1.base, die_if_ferror_#in~fp#1.offset, die_if_ferror_#in~fn#1.base, die_if_ferror_#in~fn#1.offset;assume { :end_inline_die_if_ferror } true;assume { :end_inline_die_if_ferror_stdout } true;havoc __main_~return_value_fclose_if_not_stdin$1~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_~fp~2#1.base, __main_~fp~2#1.offset;havoc fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet78#1, fclose_if_not_stdin_#t~nondet79#1, fclose_if_not_stdin_#t~bitwise80#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~nondet78#1 && fclose_if_not_stdin_#t~nondet78#1 <= 2147483647;fclose_if_not_stdin_~r~0#1 := fclose_if_not_stdin_#t~nondet78#1;havoc fclose_if_not_stdin_#t~nondet78#1; [2025-02-08 13:26:24,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2678: assume print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.base == 0 && print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.offset == 0; [2025-02-08 13:26:24,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2678: assume !(print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.base == 0 && print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.offset == 0);call print_except_N_last_lines_#t~mem118#1.base, print_except_N_last_lines_#t~mem118#1.offset := read~$Pointer$#8(print_except_N_last_lines_~circle~1#1.base, print_except_N_last_lines_~circle~1#1.offset + 8 * (if print_except_N_last_lines_~head~1#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_except_N_last_lines_~head~1#1 % 4294967296 % 18446744073709551616 else print_except_N_last_lines_~head~1#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 8);call ULTIMATE.dealloc(print_except_N_last_lines_#t~mem118#1.base, print_except_N_last_lines_#t~mem118#1.offset);havoc print_except_N_last_lines_#t~mem118#1.base, print_except_N_last_lines_#t~mem118#1.offset;print_except_N_last_lines_~tmp_post$3~0#1 := print_except_N_last_lines_~head~1#1;print_except_N_last_lines_~head~1#1 := 1 + print_except_N_last_lines_~head~1#1;call write~$Pointer$#8(print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.base, print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.offset, print_except_N_last_lines_~circle~1#1.base, print_except_N_last_lines_~circle~1#1.offset + 8 * (if print_except_N_last_lines_~tmp_post$3~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_except_N_last_lines_~tmp_post$3~0#1 % 4294967296 % 18446744073709551616 else print_except_N_last_lines_~tmp_post$3~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 8);havoc print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.base, print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.offset; [2025-02-08 13:26:24,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2711: assume 10 == print_first_N_~c~2#1; [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2711: assume !(10 == print_first_N_~c~2#1); [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2414: assume !(0 == fclose_if_not_stdin_~r~0#1);call write~int#6(5, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2414: assume !!(0 == fclose_if_not_stdin_~r~0#1); [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2447: assume fopen_or_warn_~fp~0#1.base == 0 && fopen_or_warn_~fp~0#1.offset == 0; [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2447: assume !(fopen_or_warn_~fp~0#1.base == 0 && fopen_or_warn_~fp~0#1.offset == 0); [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2695: assume print_except_N_last_lines_~head~1#1 % 4294967296 == print_except_N_last_lines_~count#1 % 4294967296; [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2695: assume !(print_except_N_last_lines_~head~1#1 % 4294967296 == print_except_N_last_lines_~count#1 % 4294967296); [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563-1: call __main_#t~mem98#1 := read~int#3(__main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset, 1); [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563: assume !(0 == (if __main_#t~mem98#1 % 256 % 4294967296 <= 2147483647 then __main_#t~mem98#1 % 256 % 4294967296 else __main_#t~mem98#1 % 256 % 4294967296 - 4294967296));havoc __main_#t~mem98#1; [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563: assume !!(0 == (if __main_#t~mem98#1 % 256 % 4294967296 <= 2147483647 then __main_#t~mem98#1 % 256 % 4294967296 else __main_#t~mem98#1 % 256 % 4294967296 - 4294967296));havoc __main_#t~mem98#1; [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464-1: fopen_or_warn_stdin_#res#1.base, fopen_or_warn_stdin_#res#1.offset := fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset; [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2646: call ULTIMATE.dealloc(print_except_N_last_bytes_~circle~0#1.base, print_except_N_last_bytes_~circle~0#1.offset);havoc print_except_N_last_bytes_#t~ret109#1.base, print_except_N_last_bytes_#t~ret109#1.offset, print_except_N_last_bytes_#t~ret110#1, print_except_N_last_bytes_~c~0#1, print_except_N_last_bytes_#t~mem111#1, print_except_N_last_bytes_#t~nondet112#1, print_except_N_last_bytes_#t~ret113#1, print_except_N_last_bytes_~print_except_N_last_bytes$$1$$2$$1$$c~0#1, print_except_N_last_bytes_~fp#1.base, print_except_N_last_bytes_~fp#1.offset, print_except_N_last_bytes_~count#1, print_except_N_last_bytes_~circle~0#1.base, print_except_N_last_bytes_~circle~0#1.offset, print_except_N_last_bytes_~return_value_xmalloc$1~0#1.base, print_except_N_last_bytes_~return_value_xmalloc$1~0#1.offset, print_except_N_last_bytes_~head~0#1, print_except_N_last_bytes_~tmp_post$2~1#1;havoc print_except_N_last_bytes_#in~fp#1.base, print_except_N_last_bytes_#in~fp#1.offset, print_except_N_last_bytes_#in~count#1;assume { :end_inline_print_except_N_last_bytes } true; [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2448: SUMMARY for call bb_simple_perror_msg(fopen_or_warn_~path#1.base, fopen_or_warn_~path#1.offset); srcloc: null [2025-02-08 13:26:24,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2614: print_except_N_last_bytes_~return_value_xmalloc$1~0#1.base, print_except_N_last_bytes_~return_value_xmalloc$1~0#1.offset := print_except_N_last_bytes_#t~ret109#1.base, print_except_N_last_bytes_#t~ret109#1.offset;havoc print_except_N_last_bytes_#t~ret109#1.base, print_except_N_last_bytes_#t~ret109#1.offset;print_except_N_last_bytes_~circle~0#1.base, print_except_N_last_bytes_~circle~0#1.offset := print_except_N_last_bytes_~return_value_xmalloc$1~0#1.base, print_except_N_last_bytes_~return_value_xmalloc$1~0#1.offset;print_except_N_last_bytes_~head~0#1 := 0;havoc print_except_N_last_bytes_~tmp_post$2~1#1; [2025-02-08 13:26:24,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581-1: call __main_#t~mem104#1 := read~int#3(__main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset, 1); [2025-02-08 13:26:24,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2614-1: SUMMARY for call print_except_N_last_bytes_#t~ret109#1.base, print_except_N_last_bytes_#t~ret109#1.offset := xmalloc(print_except_N_last_bytes_~count#1 % 4294967296); srcloc: null [2025-02-08 13:26:24,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581: assume !(0 == (if __main_#t~mem104#1 % 256 % 4294967296 <= 2147483647 then __main_#t~mem104#1 % 256 % 4294967296 else __main_#t~mem104#1 % 256 % 4294967296 - 4294967296));havoc __main_#t~mem104#1; [2025-02-08 13:26:24,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581: assume !!(0 == (if __main_#t~mem104#1 % 256 % 4294967296 <= 2147483647 then __main_#t~mem104#1 % 256 % 4294967296 else __main_#t~mem104#1 % 256 % 4294967296 - 4294967296));havoc __main_#t~mem104#1;assume { :begin_inline_print_first_N } true;print_first_N_#in~fp#1.base, print_first_N_#in~fp#1.offset, print_first_N_#in~count#1, print_first_N_#in~count_bytes#1 := __main_~fp~2#1.base, __main_~fp~2#1.offset, __main_~count~0#1, (if 0 == __main_~count_bytes~0#1 % 256 then 0 else 1);havoc print_first_N_#t~ret120#1, print_first_N_#t~nondet121#1, print_first_N_~c~2#1, print_first_N_~fp#1.base, print_first_N_~fp#1.offset, print_first_N_~count#1, print_first_N_~count_bytes#1;print_first_N_~fp#1.base, print_first_N_~fp#1.offset := print_first_N_#in~fp#1.base, print_first_N_#in~fp#1.offset;print_first_N_~count#1 := print_first_N_#in~count#1;print_first_N_~count_bytes#1 := print_first_N_#in~count_bytes#1; [2025-02-08 13:26:24,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2416: havoc fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:26:24,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449-1: fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset := fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset; [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(bb_error_msg_~p~0#1.base, 0);havoc bb_error_msg_~s#1.base, bb_error_msg_~s#1.offset, bb_error_msg_~p~0#1.base, bb_error_msg_~p~0#1.offset;havoc bb_error_msg_#in~s#1.base, bb_error_msg_#in~s#1.offset, bb_error_msg_#varArgs#1.base, bb_error_msg_#varArgs#1.offset;assume { :end_inline_bb_error_msg } true; [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218-1: SUMMARY for call bb_verror_msg(bb_error_msg_~s#1.base, bb_error_msg_~s#1.offset, bb_error_msg_~p~0#1.base, bb_error_msg_~p~0#1.offset, 0, 0); srcloc: null [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2631-1: assume true; [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2631-1: assume !true; [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2631: assume true;havoc print_except_N_last_bytes_~print_except_N_last_bytes$$1$$2$$1$$c~0#1; [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2631: assume !true; [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: assume __main_~count~0#1 % 18446744073709551616 >= 268435455;call __main_#t~varargs99#1.base, __main_#t~varargs99#1.offset := #Ultimate.allocOnHeap(8);call write~int#13(__main_~count~0#1, __main_#t~varargs99#1.base, __main_#t~varargs99#1.offset, 8);assume { :begin_inline_bb_error_msg } true;bb_error_msg_#in~s#1.base, bb_error_msg_#in~s#1.offset, bb_error_msg_#varArgs#1.base, bb_error_msg_#varArgs#1.offset := 11, 0, __main_#t~varargs99#1.base, __main_#t~varargs99#1.offset;havoc bb_error_msg_~s#1.base, bb_error_msg_~s#1.offset, bb_error_msg_~p~0#1.base, bb_error_msg_~p~0#1.offset;bb_error_msg_~s#1.base, bb_error_msg_~s#1.offset := bb_error_msg_#in~s#1.base, bb_error_msg_#in~s#1.offset;havoc bb_error_msg_~p~0#1.base, bb_error_msg_~p~0#1.offset;bb_error_msg_~p~0#1.base, bb_error_msg_~p~0#1.offset := bb_error_msg_#varArgs#1.base, bb_error_msg_#varArgs#1.offset; [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: assume !(__main_~count~0#1 % 18446744073709551616 >= 268435455); [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2417: 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~nondet79#1 && fclose_if_not_stdin_#t~nondet79#1 <= 2147483647;fclose_if_not_stdin_~return_value_fclose$1~0#1 := fclose_if_not_stdin_#t~nondet79#1;havoc fclose_if_not_stdin_#t~nondet79#1; [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2417: 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:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2533: __main_~count_bytes~0#1 := 1;__main_~p~4#1.base, __main_~p~4#1.offset := ~optarg~0.base, ~optarg~0.offset; [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2583: assume !(0 == (if __main_~count_bytes~0#1 % 256 % 4294967296 <= 2147483647 then __main_~count_bytes~0#1 % 256 % 4294967296 else __main_~count_bytes~0#1 % 256 % 4294967296 - 4294967296));assume { :begin_inline_print_except_N_last_bytes } true;print_except_N_last_bytes_#in~fp#1.base, print_except_N_last_bytes_#in~fp#1.offset, print_except_N_last_bytes_#in~count#1 := __main_~fp~2#1.base, __main_~fp~2#1.offset, __main_~count~0#1;havoc print_except_N_last_bytes_#t~ret109#1.base, print_except_N_last_bytes_#t~ret109#1.offset, print_except_N_last_bytes_#t~ret110#1, print_except_N_last_bytes_~c~0#1, print_except_N_last_bytes_#t~mem111#1, print_except_N_last_bytes_#t~nondet112#1, print_except_N_last_bytes_#t~ret113#1, print_except_N_last_bytes_~print_except_N_last_bytes$$1$$2$$1$$c~0#1, print_except_N_last_bytes_~fp#1.base, print_except_N_last_bytes_~fp#1.offset, print_except_N_last_bytes_~count#1, print_except_N_last_bytes_~circle~0#1.base, print_except_N_last_bytes_~circle~0#1.offset, print_except_N_last_bytes_~return_value_xmalloc$1~0#1.base, print_except_N_last_bytes_~return_value_xmalloc$1~0#1.offset, print_except_N_last_bytes_~head~0#1, print_except_N_last_bytes_~tmp_post$2~1#1;print_except_N_last_bytes_~fp#1.base, print_except_N_last_bytes_~fp#1.offset := print_except_N_last_bytes_#in~fp#1.base, print_except_N_last_bytes_#in~fp#1.offset;print_except_N_last_bytes_~count#1 := print_except_N_last_bytes_#in~count#1;havoc print_except_N_last_bytes_~circle~0#1.base, print_except_N_last_bytes_~circle~0#1.offset;print_except_N_last_bytes_~count#1 := 1 + print_except_N_last_bytes_~count#1;havoc print_except_N_last_bytes_~return_value_xmalloc$1~0#1.base, print_except_N_last_bytes_~return_value_xmalloc$1~0#1.offset; [2025-02-08 13:26:24,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2583: assume !!(0 == (if __main_~count_bytes~0#1 % 256 % 4294967296 <= 2147483647 then __main_~count_bytes~0#1 % 256 % 4294967296 else __main_~count_bytes~0#1 % 256 % 4294967296 - 4294967296));assume { :begin_inline_print_except_N_last_lines } true;print_except_N_last_lines_#in~fp#1.base, print_except_N_last_lines_#in~fp#1.offset, print_except_N_last_lines_#in~count#1 := __main_~fp~2#1.base, __main_~fp~2#1.offset, __main_~count~0#1;havoc print_except_N_last_lines_#t~ret114#1.base, print_except_N_last_lines_#t~ret114#1.offset, print_except_N_last_lines_#t~ret115#1.base, print_except_N_last_lines_#t~ret115#1.offset, print_except_N_last_lines_~c~1#1.base, print_except_N_last_lines_~c~1#1.offset, print_except_N_last_lines_#t~nondet116#1, print_except_N_last_lines_#t~ret117#1.base, print_except_N_last_lines_#t~ret117#1.offset, print_except_N_last_lines_#t~mem118#1.base, print_except_N_last_lines_#t~mem118#1.offset, print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.base, print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.offset, print_except_N_last_lines_#t~mem119#1.base, print_except_N_last_lines_#t~mem119#1.offset, print_except_N_last_lines_~fp#1.base, print_except_N_last_lines_~fp#1.offset, print_except_N_last_lines_~count#1, print_except_N_last_lines_~circle~1#1.base, print_except_N_last_lines_~circle~1#1.offset, print_except_N_last_lines_~return_value_xzalloc$1~0#1.base, print_except_N_last_lines_~return_value_xzalloc$1~0#1.offset, print_except_N_last_lines_~head~1#1, print_except_N_last_lines_~tmp_post$2~2#1, print_except_N_last_lines_~tmp_post$3~0#1, print_except_N_last_lines_~tmp_post$4~0#1;print_except_N_last_lines_~fp#1.base, print_except_N_last_lines_~fp#1.offset := print_except_N_last_lines_#in~fp#1.base, print_except_N_last_lines_#in~fp#1.offset;print_except_N_last_lines_~count#1 := print_except_N_last_lines_#in~count#1;havoc print_except_N_last_lines_~circle~1#1.base, print_except_N_last_lines_~circle~1#1.offset;print_except_N_last_lines_~count#1 := 1 + print_except_N_last_lines_~count#1;havoc print_except_N_last_lines_~return_value_xzalloc$1~0#1.base, print_except_N_last_lines_~return_value_xzalloc$1~0#1.offset;assume { :begin_inline_xzalloc } true;xzalloc_#in~size#1 := 8 * (print_except_N_last_lines_~count#1 % 4294967296);havoc xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret148#1.base, xzalloc_#t~ret148#1.offset, xzalloc_#t~memset~res149#1.base, xzalloc_#t~memset~res149#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:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2666: assume print_except_N_last_lines_~head~1#1 % 4294967296 == print_except_N_last_lines_~count#1 % 4294967296; [2025-02-08 13:26:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2666: assume !(print_except_N_last_lines_~head~1#1 % 4294967296 == print_except_N_last_lines_~count#1 % 4294967296);havoc print_except_N_last_lines_~c~1#1.base, print_except_N_last_lines_~c~1#1.offset; [2025-02-08 13:26:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2699: call ULTIMATE.dealloc(print_except_N_last_lines_~circle~1#1.base, print_except_N_last_lines_~circle~1#1.offset);havoc print_except_N_last_lines_#t~ret114#1.base, print_except_N_last_lines_#t~ret114#1.offset, print_except_N_last_lines_#t~ret115#1.base, print_except_N_last_lines_#t~ret115#1.offset, print_except_N_last_lines_~c~1#1.base, print_except_N_last_lines_~c~1#1.offset, print_except_N_last_lines_#t~nondet116#1, print_except_N_last_lines_#t~ret117#1.base, print_except_N_last_lines_#t~ret117#1.offset, print_except_N_last_lines_#t~mem118#1.base, print_except_N_last_lines_#t~mem118#1.offset, print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.base, print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.offset, print_except_N_last_lines_#t~mem119#1.base, print_except_N_last_lines_#t~mem119#1.offset, print_except_N_last_lines_~fp#1.base, print_except_N_last_lines_~fp#1.offset, print_except_N_last_lines_~count#1, print_except_N_last_lines_~circle~1#1.base, print_except_N_last_lines_~circle~1#1.offset, print_except_N_last_lines_~return_value_xzalloc$1~0#1.base, print_except_N_last_lines_~return_value_xzalloc$1~0#1.offset, print_except_N_last_lines_~head~1#1, print_except_N_last_lines_~tmp_post$2~2#1, print_except_N_last_lines_~tmp_post$3~0#1, print_except_N_last_lines_~tmp_post$4~0#1;havoc print_except_N_last_lines_#in~fp#1.base, print_except_N_last_lines_#in~fp#1.offset, print_except_N_last_lines_#in~count#1;assume { :end_inline_print_except_N_last_lines } true; [2025-02-08 13:26:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2634: assume print_except_N_last_bytes_~head~0#1 % 4294967296 == print_except_N_last_bytes_~count#1 % 4294967296;print_except_N_last_bytes_~head~0#1 := 0; [2025-02-08 13:26:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2634: assume !(print_except_N_last_bytes_~head~0#1 % 4294967296 == print_except_N_last_bytes_~count#1 % 4294967296); [2025-02-08 13:26:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568: assume true;call __main_#t~mem100#1.base, __main_#t~mem100#1.offset := read~$Pointer$#16(__main_~argv#1.base, __main_~argv#1.offset, 8);assume { :begin_inline_fopen_or_warn_stdin } true;fopen_or_warn_stdin_#in~filename#1.base, fopen_or_warn_stdin_#in~filename#1.offset := __main_#t~mem100#1.base, __main_#t~mem100#1.offset;havoc fopen_or_warn_stdin_#res#1.base, fopen_or_warn_stdin_#res#1.offset;havoc fopen_or_warn_stdin_#t~mem85#1, fopen_or_warn_stdin_#t~mem86#1, fopen_or_warn_stdin_#t~ret87#1.base, fopen_or_warn_stdin_#t~ret87#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;fopen_or_warn_stdin_~filename#1.base, fopen_or_warn_stdin_~filename#1.offset := fopen_or_warn_stdin_#in~filename#1.base, fopen_or_warn_stdin_#in~filename#1.offset;fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset := ~stdin~0.base, ~stdin~0.offset;havoc fopen_or_warn_stdin_~tmp_if_expr$1~0#1; [2025-02-08 13:26:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568: assume !true; [2025-02-08 13:26:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2601: __main_~fmt~0#1.base, __main_~fmt~0#1.offset := 12, 0;__main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset;call __main_#t~mem107#1.base, __main_#t~mem107#1.offset := read~$Pointer$#16(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:26:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2618: assume true;havoc print_except_N_last_bytes_~c~0#1; [2025-02-08 13:26:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2618: assume !true; [2025-02-08 13:26:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2618-1: assume true; [2025-02-08 13:26:24,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2618-1: assume !true; [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc fclose_if_not_stdin_#t~bitwise80#1; [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420-2: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_#t~bitwise80#1;havoc fclose_if_not_stdin_#t~bitwise80#1; [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420-4: havoc fclose_if_not_stdin_#t~bitwise80#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~bitwise80#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~bitwise80#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~bitwise80#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~bitwise80#1 < 0)) && fclose_if_not_stdin_#t~bitwise80#1 <= 2147483647; [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420-3: [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420-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~bitwise80#1 := fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420-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:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420-5: assume 0 == fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_#t~bitwise80#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420-5: assume !(0 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2553-1: assume __main_~argc#1 - ~optind~0 >= -2147483648; [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2553-1: assume !(__main_~argc#1 - ~optind~0 >= -2147483648); [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2553: assume __main_~argc#1 - ~optind~0 <= 2147483647;__main_~argc#1 := __main_~argc#1 - ~optind~0;__main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, __main_~argv#1.offset + 8 * ~optind~0;call __main_#t~mem97#1.base, __main_#t~mem97#1.offset := read~$Pointer$#16(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2553: assume !(__main_~argc#1 - ~optind~0 <= 2147483647); [2025-02-08 13:26:24,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2636: call print_except_N_last_bytes_#t~mem111#1 := read~int#8(print_except_N_last_bytes_~circle~0#1.base, print_except_N_last_bytes_~circle~0#1.offset + (if print_except_N_last_bytes_~head~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_except_N_last_bytes_~head~0#1 % 4294967296 % 18446744073709551616 else print_except_N_last_bytes_~head~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);assume -2147483648 <= print_except_N_last_bytes_#t~nondet112#1 && print_except_N_last_bytes_#t~nondet112#1 <= 2147483647;havoc print_except_N_last_bytes_#t~mem111#1;havoc print_except_N_last_bytes_#t~nondet112#1; [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2570: __main_#t~ret101#1.base, __main_#t~ret101#1.offset := fopen_or_warn_stdin_#res#1.base, fopen_or_warn_stdin_#res#1.offset;havoc fopen_or_warn_stdin_#t~mem85#1, fopen_or_warn_stdin_#t~mem86#1, fopen_or_warn_stdin_#t~ret87#1.base, fopen_or_warn_stdin_#t~ret87#1.offset, fopen_or_warn_stdin_~filename#1.base, fopen_or_warn_stdin_~filename#1.offset, fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset, fopen_or_warn_stdin_~tmp_if_expr$1~0#1;havoc fopen_or_warn_stdin_#in~filename#1.base, fopen_or_warn_stdin_#in~filename#1.offset;assume { :end_inline_fopen_or_warn_stdin } true;__main_~fp~2#1.base, __main_~fp~2#1.offset := __main_#t~ret101#1.base, __main_#t~ret101#1.offset;havoc __main_#t~mem100#1.base, __main_#t~mem100#1.offset;havoc __main_#t~ret101#1.base, __main_#t~ret101#1.offset; [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2603: assume __main_#t~mem107#1.base == 0 && __main_#t~mem107#1.offset == 0;havoc __main_#t~mem107#1.base, __main_#t~mem107#1.offset; [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2603: assume !(__main_#t~mem107#1.base == 0 && __main_#t~mem107#1.offset == 0);havoc __main_#t~mem107#1.base, __main_#t~mem107#1.offset; [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2653: print_except_N_last_lines_#t~ret114#1.base, print_except_N_last_lines_#t~ret114#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret148#1.base, xzalloc_#t~ret148#1.offset, xzalloc_#t~memset~res149#1.base, xzalloc_#t~memset~res149#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;print_except_N_last_lines_~return_value_xzalloc$1~0#1.base, print_except_N_last_lines_~return_value_xzalloc$1~0#1.offset := print_except_N_last_lines_#t~ret114#1.base, print_except_N_last_lines_#t~ret114#1.offset;havoc print_except_N_last_lines_#t~ret114#1.base, print_except_N_last_lines_#t~ret114#1.offset;print_except_N_last_lines_~circle~1#1.base, print_except_N_last_lines_~circle~1#1.offset := print_except_N_last_lines_~return_value_xzalloc$1~0#1.base, print_except_N_last_lines_~return_value_xzalloc$1~0#1.offset;print_except_N_last_lines_~head~1#1 := 0;havoc print_except_N_last_lines_~tmp_post$2~2#1; [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2455: assume !(fopen_or_warn_stdin_~filename#1.base == ~#bb_msg_standard_input~0.base && fopen_or_warn_stdin_~filename#1.offset == ~#bb_msg_standard_input~0.offset);call fopen_or_warn_stdin_#t~mem85#1 := read~int#17(fopen_or_warn_stdin_~filename#1.base, fopen_or_warn_stdin_~filename#1.offset, 1); [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2455: assume !!(fopen_or_warn_stdin_~filename#1.base == ~#bb_msg_standard_input~0.base && fopen_or_warn_stdin_~filename#1.offset == ~#bb_msg_standard_input~0.offset); [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2422-1: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2670: havoc print_except_N_last_lines_~tmp_post$3~0#1; [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2703: assume !(0 == print_first_N_~count#1 % 18446744073709551616);havoc print_first_N_~c~2#1; [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2703: assume !!(0 == print_first_N_~count#1 % 18446744073709551616); [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2637-1: SUMMARY for call print_except_N_last_bytes_#t~ret113#1 := _IO_getc(print_except_N_last_bytes_~fp#1.base, print_except_N_last_bytes_~fp#1.offset); srcloc: null [2025-02-08 13:26:24,889 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2637: assume -2147483648 <= print_except_N_last_bytes_#t~ret113#1 && print_except_N_last_bytes_#t~ret113#1 <= 2147483647;print_except_N_last_bytes_~print_except_N_last_bytes$$1$$2$$1$$c~0#1 := print_except_N_last_bytes_#t~ret113#1;havoc print_except_N_last_bytes_#t~ret113#1; [2025-02-08 13:26:24,891 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2571: assume !(__main_~fp~2#1.base == 0 && __main_~fp~2#1.offset == 0); [2025-02-08 13:26:24,891 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2571: assume !!(__main_~fp~2#1.base == 0 && __main_~fp~2#1.offset == 0);__main_~retval~0#1 := 1; [2025-02-08 13:26:24,891 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2720: assume -2147483648 <= print_first_N_#t~nondet121#1 && print_first_N_#t~nondet121#1 <= 2147483647;havoc print_first_N_~c~2#1;havoc print_first_N_#t~nondet121#1; [2025-02-08 13:26:24,891 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2621-1: SUMMARY for call print_except_N_last_bytes_#t~ret110#1 := _IO_getc(print_except_N_last_bytes_~fp#1.base, print_except_N_last_bytes_~fp#1.offset); srcloc: null [2025-02-08 13:26:24,892 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-08 13:26:24,892 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2621: assume -2147483648 <= print_except_N_last_bytes_#t~ret110#1 && print_except_N_last_bytes_#t~ret110#1 <= 2147483647;print_except_N_last_bytes_~c~0#1 := print_except_N_last_bytes_#t~ret110#1;havoc print_except_N_last_bytes_#t~ret110#1; [2025-02-08 13:26:24,892 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2555: assume __main_#t~mem97#1.base == 0 && __main_#t~mem97#1.offset == 0;havoc __main_#t~mem97#1.base, __main_#t~mem97#1.offset;__main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, __main_~argv#1.offset - 8;call write~$Pointer$#16(9, 0, __main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:26:24,892 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2555: assume !(__main_#t~mem97#1.base == 0 && __main_#t~mem97#1.offset == 0);havoc __main_#t~mem97#1.base, __main_#t~mem97#1.offset; [2025-02-08 13:26:24,892 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2638: assume -1 == print_except_N_last_bytes_~print_except_N_last_bytes$$1$$2$$1$$c~0#1; [2025-02-08 13:26:24,892 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2638: assume !(-1 == print_except_N_last_bytes_~print_except_N_last_bytes$$1$$2$$1$$c~0#1);call write~int#8(print_except_N_last_bytes_~print_except_N_last_bytes$$1$$2$$1$$c~0#1, print_except_N_last_bytes_~circle~0#1.base, print_except_N_last_bytes_~circle~0#1.offset + (if print_except_N_last_bytes_~head~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_except_N_last_bytes_~head~0#1 % 4294967296 % 18446744073709551616 else print_except_N_last_bytes_~head~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);print_except_N_last_bytes_~head~0#1 := 1 + print_except_N_last_bytes_~head~0#1;havoc print_except_N_last_bytes_~print_except_N_last_bytes$$1$$2$$1$$c~0#1; [2025-02-08 13:26:24,892 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2671-1: assume true; [2025-02-08 13:26:24,892 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2671-1: assume !true; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2671: assume true;havoc print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.base, print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.offset; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2671: assume !true; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2572: havoc __main_~return_value_fclose_if_not_stdin$1~0#1; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2407: eat_num_#t~ret77#1 := xatoul_sfx_#res#1;havoc xatoul_sfx_#t~ret124#1, xatoul_sfx_~str#1.base, xatoul_sfx_~str#1.offset, xatoul_sfx_~sfx#1.base, xatoul_sfx_~sfx#1.offset, xatoul_sfx_~return_value_xatoull_sfx$1~0#1;havoc xatoul_sfx_#in~str#1.base, xatoul_sfx_#in~str#1.offset, xatoul_sfx_#in~sfx#1.base, xatoul_sfx_#in~sfx#1.offset;assume { :end_inline_xatoul_sfx } true;eat_num_~return_value_xatoul_sfx$1~0#1 := eat_num_#t~ret77#1;havoc eat_num_#t~ret77#1;eat_num_#res#1 := eat_num_~return_value_xatoul_sfx$1~0#1; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688: print_except_N_last_lines_~head~1#1 := 0;havoc print_except_N_last_lines_~tmp_post$4~0#1; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2622: assume -1 == print_except_N_last_bytes_~c~0#1; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2622: assume !(-1 == print_except_N_last_bytes_~c~0#1);print_except_N_last_bytes_~tmp_post$2~1#1 := print_except_N_last_bytes_~head~0#1;print_except_N_last_bytes_~head~0#1 := 1 + print_except_N_last_bytes_~head~0#1;call write~int#8(print_except_N_last_bytes_~c~0#1, print_except_N_last_bytes_~circle~0#1.base, print_except_N_last_bytes_~circle~0#1.offset + (if print_except_N_last_bytes_~tmp_post$2~1#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_except_N_last_bytes_~tmp_post$2~1#1 % 4294967296 % 18446744073709551616 else print_except_N_last_bytes_~tmp_post$2~1#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2589: havoc print_first_N_#t~ret120#1, print_first_N_#t~nondet121#1, print_first_N_~c~2#1, print_first_N_~fp#1.base, print_first_N_~fp#1.offset, print_first_N_~count#1, print_first_N_~count_bytes#1;havoc print_first_N_#in~fp#1.base, print_first_N_#in~fp#1.offset, print_first_N_#in~count#1, print_first_N_#in~count_bytes#1;assume { :end_inline_print_first_N } true; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2457: assume !(45 == fopen_or_warn_stdin_#t~mem85#1);havoc fopen_or_warn_stdin_#t~mem85#1;fopen_or_warn_stdin_~tmp_if_expr$1~0#1 := 1; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2457: assume !!(45 == fopen_or_warn_stdin_#t~mem85#1);havoc fopen_or_warn_stdin_#t~mem85#1;call fopen_or_warn_stdin_#t~mem86#1 := read~int#17(fopen_or_warn_stdin_~filename#1.base, 1 + fopen_or_warn_stdin_~filename#1.offset, 1);fopen_or_warn_stdin_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 0 != fopen_or_warn_stdin_#t~mem86#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: assume true; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: assume !true;havoc __main_#t~nondet108#1;__main_#res#1 := __main_~retval~0#1;call ULTIMATE.dealloc(__main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset);havoc __main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606-1: assume false; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606-1: assume !false; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2573: assume __main_~fp~2#1.base == ~stdin~0.base && __main_~fp~2#1.offset == ~stdin~0.offset;call write~$Pointer$#16(~#bb_msg_standard_input~0.base, ~#bb_msg_standard_input~0.offset, __main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2573: assume !(__main_~fp~2#1.base == ~stdin~0.base && __main_~fp~2#1.offset == ~stdin~0.offset); [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: assume { :begin_inline_die_if_ferror_stdout } true;assume { :begin_inline_die_if_ferror } true;die_if_ferror_#in~fp#1.base, die_if_ferror_#in~fp#1.offset, die_if_ferror_#in~fn#1.base, die_if_ferror_#in~fn#1.offset := ~stdout~0.base, ~stdout~0.offset, ~#bb_msg_standard_output~0.base, ~#bb_msg_standard_output~0.offset;havoc die_if_ferror_#t~nondet74#1, die_if_ferror_#t~varargs75#1.base, die_if_ferror_#t~varargs75#1.offset, die_if_ferror_~fp#1.base, die_if_ferror_~fp#1.offset, die_if_ferror_~fn#1.base, die_if_ferror_~fn#1.offset, die_if_ferror_~return_value_ferror$1~0#1;die_if_ferror_~fp#1.base, die_if_ferror_~fp#1.offset := die_if_ferror_#in~fp#1.base, die_if_ferror_#in~fp#1.offset;die_if_ferror_~fn#1.base, die_if_ferror_~fn#1.offset := die_if_ferror_#in~fn#1.base, die_if_ferror_#in~fn#1.offset;havoc die_if_ferror_~return_value_ferror$1~0#1;assume -2147483648 <= die_if_ferror_#t~nondet74#1 && die_if_ferror_#t~nondet74#1 <= 2147483647;die_if_ferror_~return_value_ferror$1~0#1 := die_if_ferror_#t~nondet74#1;havoc die_if_ferror_#t~nondet74#1; [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2392: assume !(0 == die_if_ferror_~return_value_ferror$1~0#1);call die_if_ferror_#t~varargs75#1.base, die_if_ferror_#t~varargs75#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#13(die_if_ferror_~fn#1.base, die_if_ferror_~fn#1.offset, die_if_ferror_#t~varargs75#1.base, die_if_ferror_#t~varargs75#1.offset, 8); [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2392: assume !!(0 == die_if_ferror_~return_value_ferror$1~0#1); [2025-02-08 13:26:24,893 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2706: assume -2147483648 <= print_first_N_#t~ret120#1 && print_first_N_#t~ret120#1 <= 2147483647;print_first_N_~c~2#1 := print_first_N_#t~ret120#1;havoc print_first_N_#t~ret120#1; [2025-02-08 13:26:24,894 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2706-1: SUMMARY for call print_first_N_#t~ret120#1 := _IO_getc(print_first_N_~fp#1.base, print_first_N_~fp#1.offset); srcloc: null [2025-02-08 13:26:24,894 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2607: main_#t~ret198#1 := __main_#res#1;havoc __main_#t~mem89#1.base, __main_#t~mem89#1.offset, __main_#t~mem90#1.base, __main_#t~mem90#1.offset, __main_#t~mem91#1, __main_#t~mem92#1.base, __main_#t~mem92#1.offset, __main_#t~mem93#1, __main_#t~mem94#1.base, __main_#t~mem94#1.offset, __main_#t~ret95#1, __main_#t~ret96#1, __main_#t~mem97#1.base, __main_#t~mem97#1.offset, __main_#t~mem98#1, __main_#t~varargs99#1.base, __main_#t~varargs99#1.offset, __main_#t~mem100#1.base, __main_#t~mem100#1.offset, __main_#t~ret101#1.base, __main_#t~ret101#1.offset, __main_#t~ret102#1, __main_#t~mem103#1.base, __main_#t~mem103#1.offset, __main_#t~mem104#1, __main_#t~ret105#1, __main_#t~mem106#1.base, __main_#t~mem106#1.offset, __main_~return_value_fclose_if_not_stdin$1~0#1, __main_#t~mem107#1.base, __main_#t~mem107#1.offset, __main_#t~nondet108#1, __main_~argc#1, __main_~argv#1.base, __main_~argv#1.offset, __main_~count~0#1, __main_~header_threshhold~0#1, __main_~count_bytes~0#1, __main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset, __main_~fp~2#1.base, __main_~fp~2#1.offset, __main_~fmt~0#1.base, __main_~fmt~0#1.offset, __main_~p~4#1.base, __main_~p~4#1.offset, __main_~opt~0#1, __main_~retval~0#1;havoc __main_#in~argc#1, __main_#in~argv#1.base, __main_#in~argv#1.offset;assume { :end_inline___main } true;assume -2147483648 <= main_#t~ret198#1 && main_#t~ret198#1 <= 2147483647;main_~res~0#1 := main_#t~ret198#1;havoc main_#t~ret198#1;main_~i~5#1 := 0; [2025-02-08 13:26:24,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954: assume main_~i~5#1 < main_~argc~0#1;call main_#t~mem199#1.base, main_#t~mem199#1.offset := read~$Pointer$#5(main_~mem_track~0#1.base, main_~mem_track~0#1.offset + 8 * main_~i~5#1, 8);call ULTIMATE.dealloc(main_#t~mem199#1.base, main_#t~mem199#1.offset); [2025-02-08 13:26:24,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954: assume !(main_~i~5#1 < main_~argc~0#1);havoc main_~i~5#1;call ULTIMATE.dealloc(main_~mem_track~0#1.base, main_~mem_track~0#1.offset);call ULTIMATE.dealloc(main_~argv~0#1.base, main_~argv~0#1.offset);call ULTIMATE.dealloc(main_~a~0#1.base, main_~a~0#1.offset);main_#res#1 := main_~res~0#1;#t~ret201#1 := main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~pre186#1, main_~i~3#1, main_#t~nondet187#1, main_#t~nondet188#1, main_#t~malloc189#1.base, main_#t~malloc189#1.offset, main_#t~malloc190#1.base, main_#t~malloc190#1.offset, main_#t~malloc191#1.base, main_#t~malloc191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~nondet195#1, main_#t~pre196#1, main_~j~0#1, main_#t~pre197#1, main_~i~4#1, main_#t~ret198#1, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~pre200#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;assume { :end_inline_main } true; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-2: assume 1 + main_~i~5#1 >= -2147483648; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-2: assume !(1 + main_~i~5#1 >= -2147483648); [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-1: assume 1 + main_~i~5#1 <= 2147483647;main_#t~pre200#1 := 1 + main_~i~5#1;main_~i~5#1 := 1 + main_~i~5#1;havoc main_#t~pre200#1; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-1: assume !(1 + main_~i~5#1 <= 2147483647); [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2690: assume true;print_except_N_last_lines_~tmp_post$4~0#1 := print_except_N_last_lines_~head~1#1;print_except_N_last_lines_~head~1#1 := 1 + print_except_N_last_lines_~head~1#1;call print_except_N_last_lines_#t~mem119#1.base, print_except_N_last_lines_#t~mem119#1.offset := read~$Pointer$#8(print_except_N_last_lines_~circle~1#1.base, print_except_N_last_lines_~circle~1#1.offset + 8 * (if print_except_N_last_lines_~tmp_post$4~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_except_N_last_lines_~tmp_post$4~0#1 % 4294967296 % 18446744073709551616 else print_except_N_last_lines_~tmp_post$4~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 8);call ULTIMATE.dealloc(print_except_N_last_lines_#t~mem119#1.base, print_except_N_last_lines_#t~mem119#1.offset);havoc print_except_N_last_lines_#t~mem119#1.base, print_except_N_last_lines_#t~mem119#1.offset; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2690: assume !true; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2657-1: assume true; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2657-1: assume !true; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2690-1: assume true; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2690-1: assume !true; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2657: assume true;havoc print_except_N_last_lines_~c~1#1.base, print_except_N_last_lines_~c~1#1.offset; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2657: assume !true; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2492: call ULTIMATE.dealloc(__main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset);havoc __main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2393: SUMMARY for call bb_error_msg_and_die(7, 0, die_if_ferror_#t~varargs75#1.base, die_if_ferror_#t~varargs75#1.offset); srcloc: null [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2674: assume print_except_N_last_lines_~head~1#1 % 4294967296 == print_except_N_last_lines_~count#1 % 4294967296;print_except_N_last_lines_~head~1#1 := 0; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2674: assume !(print_except_N_last_lines_~head~1#1 % 4294967296 == print_except_N_last_lines_~count#1 % 4294967296); [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2707: assume -1 == print_first_N_~c~2#1; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2707: assume !(-1 == print_first_N_~c~2#1); [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542: __main_#t~ret96#1 := eat_num_#res#1;havoc eat_num_#t~mem76#1, eat_num_#t~ret77#1, eat_num_~negative_N#1.base, eat_num_~negative_N#1.offset, eat_num_~p#1.base, eat_num_~p#1.offset, eat_num_~return_value_xatoul_sfx$1~0#1;havoc eat_num_#in~negative_N#1.base, eat_num_#in~negative_N#1.offset, eat_num_#in~p#1.base, eat_num_#in~p#1.offset;assume { :end_inline_eat_num } true;__main_~count~0#1 := __main_#t~ret96#1;havoc __main_#t~ret96#1; [2025-02-08 13:26:24,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2592: __main_#t~ret105#1 := fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet78#1, fclose_if_not_stdin_#t~nondet79#1, fclose_if_not_stdin_#t~bitwise80#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~ret105#1 && __main_#t~ret105#1 <= 2147483647;__main_~return_value_fclose_if_not_stdin$1~0#1 := __main_#t~ret105#1;havoc __main_#t~ret105#1; [2025-02-08 13:26:24,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume #Ultimate.C_memset_#t~loopctr202#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616;#memory_$Pointer$#8.base, #memory_$Pointer$#8.offset := #memory_$Pointer$#8.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr202#1 := 0], #memory_$Pointer$#8.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr202#1 := (if #Ultimate.C_memset_#value#1 % 256 % 18446744073709551616 <= 9223372036854775807 then #Ultimate.C_memset_#value#1 % 256 % 18446744073709551616 else #Ultimate.C_memset_#value#1 % 256 % 18446744073709551616 - 18446744073709551616)];#memory_int#8 := #memory_int#8[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr202#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr202#1 := 1 + #Ultimate.C_memset_#t~loopctr202#1; [2025-02-08 13:26:24,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume !(#Ultimate.C_memset_#t~loopctr202#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616);assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;xzalloc_#t~memset~res149#1.base, xzalloc_#t~memset~res149#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr202#1;havoc #Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1;assume { :end_inline_#Ultimate.C_memset } true;havoc xzalloc_#t~memset~res149#1.base, xzalloc_#t~memset~res149#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:24,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: xatoul_sfx_#t~ret124#1 := xatoull_sfx_#res#1;havoc xatoull_sfx_#t~ret125#1, xatoull_sfx_~numstr#1.base, xatoull_sfx_~numstr#1.offset, xatoull_sfx_~suffixes#1.base, xatoull_sfx_~suffixes#1.offset, xatoull_sfx_~return_value_xstrtoull_range_sfx$1~0#1;havoc xatoull_sfx_#in~numstr#1.base, xatoull_sfx_#in~numstr#1.offset, xatoull_sfx_#in~suffixes#1.base, xatoull_sfx_#in~suffixes#1.offset;assume { :end_inline_xatoull_sfx } true;xatoul_sfx_~return_value_xatoull_sfx$1~0#1 := xatoul_sfx_#t~ret124#1;havoc xatoul_sfx_#t~ret124#1;xatoul_sfx_#res#1 := xatoul_sfx_~return_value_xatoull_sfx$1~0#1; [2025-02-08 13:26:24,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2560: __main_~fmt~0#1.base, __main_~fmt~0#1.offset := 10, 1; [2025-02-08 13:26:24,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2593: assume !(0 == __main_~return_value_fclose_if_not_stdin$1~0#1);call __main_#t~mem106#1.base, __main_#t~mem106#1.offset := read~$Pointer$#16(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:26:24,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2593: assume !!(0 == __main_~return_value_fclose_if_not_stdin$1~0#1); [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2461: assume !(0 == fopen_or_warn_stdin_~tmp_if_expr$1~0#1 % 256);assume { :begin_inline_fopen_or_warn } true;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 := fopen_or_warn_stdin_~filename#1.base, fopen_or_warn_stdin_~filename#1.offset, 8, 0;havoc fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset;havoc fopen_or_warn_#t~nondet84#1.base, fopen_or_warn_#t~nondet84#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;fopen_or_warn_~path#1.base, fopen_or_warn_~path#1.offset := fopen_or_warn_#in~path#1.base, fopen_or_warn_#in~path#1.offset;fopen_or_warn_~mode#1.base, fopen_or_warn_~mode#1.offset := fopen_or_warn_#in~mode#1.base, fopen_or_warn_#in~mode#1.offset;havoc fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset;fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset := fopen_or_warn_#t~nondet84#1.base, fopen_or_warn_#t~nondet84#1.offset;havoc fopen_or_warn_#t~nondet84#1.base, fopen_or_warn_#t~nondet84#1.offset; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2461: assume !!(0 == fopen_or_warn_stdin_~tmp_if_expr$1~0#1 % 256); [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2676: assume true; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2676: assume !true;havoc print_except_N_last_lines_#t~nondet116#1; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2709: assume 0 == (if print_first_N_~count_bytes#1 % 256 % 4294967296 <= 2147483647 then print_first_N_~count_bytes#1 % 256 % 4294967296 else print_first_N_~count_bytes#1 % 256 % 4294967296 - 4294967296); [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2709: assume !(0 == (if print_first_N_~count_bytes#1 % 256 % 4294967296 <= 2147483647 then print_first_N_~count_bytes#1 % 256 % 4294967296 else print_first_N_~count_bytes#1 % 256 % 4294967296 - 4294967296));print_first_N_~count#1 := print_first_N_~count#1 - 1; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2676-1: assume false; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2676-1: assume !false; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2577: assume !(0 == __main_~header_threshhold~0#1);havoc __main_#t~ret102#1;call __main_#t~mem103#1.base, __main_#t~mem103#1.offset := read~$Pointer$#16(__main_~argv#1.base, __main_~argv#1.offset, 8);havoc __main_#t~ret102#1;havoc __main_#t~mem103#1.base, __main_#t~mem103#1.offset; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2577: assume !!(0 == __main_~header_threshhold~0#1); [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret148#1.base, xzalloc_#t~ret148#1.offset;havoc xzalloc_#t~ret148#1.base, xzalloc_#t~ret148#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset, 0, xzalloc_~size#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr202#1;#Ultimate.C_memset_#t~loopctr202#1 := 0; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858-1: SUMMARY for call xzalloc_#t~ret148#1.base, xzalloc_#t~ret148#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2660: print_except_N_last_lines_~c~1#1.base, print_except_N_last_lines_~c~1#1.offset := print_except_N_last_lines_#t~ret115#1.base, print_except_N_last_lines_#t~ret115#1.offset;havoc print_except_N_last_lines_#t~ret115#1.base, print_except_N_last_lines_#t~ret115#1.offset; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2627: assume print_except_N_last_bytes_~head~0#1 % 4294967296 == print_except_N_last_bytes_~count#1 % 4294967296; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2627: assume !(print_except_N_last_bytes_~head~0#1 % 4294967296 == print_except_N_last_bytes_~count#1 % 4294967296);havoc print_except_N_last_bytes_~c~0#1; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2660-1: SUMMARY for call print_except_N_last_lines_#t~ret115#1.base, print_except_N_last_lines_#t~ret115#1.offset := xmalloc_fgets(print_except_N_last_lines_~fp#1.base, print_except_N_last_lines_~fp#1.offset); srcloc: null [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2561: assume __main_~header_threshhold~0#1 >= __main_~argc#1;__main_~header_threshhold~0#1 := 0; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2561: assume !(__main_~header_threshhold~0#1 >= __main_~argc#1); [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: fopen_or_warn_stdin_#t~ret87#1.base, fopen_or_warn_stdin_#t~ret87#1.offset := fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset;havoc fopen_or_warn_#t~nondet84#1.base, fopen_or_warn_#t~nondet84#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~ret87#1.base, fopen_or_warn_stdin_#t~ret87#1.offset; [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2677-1: SUMMARY for call print_except_N_last_lines_#t~ret117#1.base, print_except_N_last_lines_#t~ret117#1.offset := xmalloc_fgets(print_except_N_last_lines_~fp#1.base, print_except_N_last_lines_~fp#1.offset); srcloc: null [2025-02-08 13:26:24,900 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2677: print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.base, print_except_N_last_lines_~print_except_N_last_lines$$1$$2$$1$$c~0#1.offset := print_except_N_last_lines_#t~ret117#1.base, print_except_N_last_lines_#t~ret117#1.offset;havoc print_except_N_last_lines_#t~ret117#1.base, print_except_N_last_lines_#t~ret117#1.offset; [2025-02-08 13:26:24,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2661: assume print_except_N_last_lines_~c~1#1.base == 0 && print_except_N_last_lines_~c~1#1.offset == 0; [2025-02-08 13:26:24,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2661: assume !(print_except_N_last_lines_~c~1#1.base == 0 && print_except_N_last_lines_~c~1#1.offset == 0);print_except_N_last_lines_~tmp_post$2~2#1 := print_except_N_last_lines_~head~1#1;print_except_N_last_lines_~head~1#1 := 1 + print_except_N_last_lines_~head~1#1;call write~$Pointer$#8(print_except_N_last_lines_~c~1#1.base, print_except_N_last_lines_~c~1#1.offset, print_except_N_last_lines_~circle~1#1.base, print_except_N_last_lines_~circle~1#1.offset + 8 * (if print_except_N_last_lines_~tmp_post$2~2#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_except_N_last_lines_~tmp_post$2~2#1 % 4294967296 % 18446744073709551616 else print_except_N_last_lines_~tmp_post$2~2#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 8); [2025-02-08 13:26:24,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2595-1: SUMMARY for call bb_simple_perror_msg(__main_#t~mem106#1.base, __main_#t~mem106#1.offset); srcloc: null [2025-02-08 13:26:24,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2595: havoc __main_#t~mem106#1.base, __main_#t~mem106#1.offset;__main_~retval~0#1 := 1; [2025-02-08 13:26:25,016 INFO L? ?]: Removed 407 outVars from TransFormulas that were not future-live. [2025-02-08 13:26:25,017 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:26:25,051 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:26:25,052 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:26:25,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:25 BoogieIcfgContainer [2025-02-08 13:26:25,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:26:25,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:26:25,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:26:25,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:26:25,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:26:16" (1/3) ... [2025-02-08 13:26:25,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7c0ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:25, skipping insertion in model container [2025-02-08 13:26:25,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:17" (2/3) ... [2025-02-08 13:26:25,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7c0ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:25, skipping insertion in model container [2025-02-08 13:26:25,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:25" (3/3) ... [2025-02-08 13:26:25,064 INFO L128 eAbstractionObserver]: Analyzing ICFG head-2.i [2025-02-08 13:26:25,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:26:25,086 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG head-2.i that has 48 procedures, 387 locations, 1 initial locations, 41 loop locations, and 46 error locations. [2025-02-08 13:26:25,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:26:25,163 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;@2133e0bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:26:25,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 13:26:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 159 states have (on average 1.6540880503144655) internal successors, (263), 209 states have internal predecessors, (263), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 13:26:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:26:25,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:25,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:26:25,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:26:25,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash 795361, now seen corresponding path program 1 times [2025-02-08 13:26:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:25,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787398756] [2025-02-08 13:26:25,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:25,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:26,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:26:26,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:26:26,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:26,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:26,966 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:26,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:26,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787398756] [2025-02-08 13:26:26,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787398756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:26,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:26,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:26:26,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324241309] [2025-02-08 13:26:26,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:26,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:26,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:26,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:26,995 INFO L87 Difference]: Start difference. First operand has 235 states, 159 states have (on average 1.6540880503144655) internal successors, (263), 209 states have internal predecessors, (263), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:26:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:27,100 INFO L93 Difference]: Finished difference Result 266 states and 334 transitions. [2025-02-08 13:26:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:27,102 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:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:27,107 INFO L225 Difference]: With dead ends: 266 [2025-02-08 13:26:27,108 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 13:26:27,113 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:27,117 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:27,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 162 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 13:26:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-08 13:26:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 55 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2025-02-08 13:26:27,158 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 3 [2025-02-08 13:26:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:27,160 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2025-02-08 13:26:27,160 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:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2025-02-08 13:26:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:26:27,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:27,160 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:26:27,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:26:27,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:26:27,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:27,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2074473251, now seen corresponding path program 1 times [2025-02-08 13:26:27,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:27,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206484805] [2025-02-08 13:26:27,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:27,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:27,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:26:27,911 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,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:27,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:28,337 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:28,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206484805] [2025-02-08 13:26:28,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206484805] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716705322] [2025-02-08 13:26:28,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:28,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:28,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:28,342 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:28,343 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:29,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:26:29,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:26:29,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:29,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:29,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 1664 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:29,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:29,773 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:29,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:29,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716705322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:29,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:29,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:26:29,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230446257] [2025-02-08 13:26:29,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:29,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:26:29,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:29,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:26:29,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:29,775 INFO L87 Difference]: Start difference. First operand 60 states and 71 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:33,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:33,990 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2025-02-08 13:26:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:26:33,992 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:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:33,992 INFO L225 Difference]: With dead ends: 60 [2025-02-08 13:26:33,992 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 13:26:33,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:33,993 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:33,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 184 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:26:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 13:26:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-08 13:26:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 54 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-02-08 13:26:34,004 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 6 [2025-02-08 13:26:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:34,005 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-02-08 13:26:34,005 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:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-02-08 13:26:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:26:34,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:34,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:26:34,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:26:34,209 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:34,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:26:34,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash 115839395, now seen corresponding path program 1 times [2025-02-08 13:26:34,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:34,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885663076] [2025-02-08 13:26:34,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:34,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:34,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:26:34,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:26:34,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:34,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:35,045 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:35,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:35,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885663076] [2025-02-08 13:26:35,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885663076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:35,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:35,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:35,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213242875] [2025-02-08 13:26:35,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:35,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:35,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:35,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:35,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:35,048 INFO L87 Difference]: Start difference. First operand 59 states and 70 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:35,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:35,120 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-02-08 13:26:35,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:35,120 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:35,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:35,121 INFO L225 Difference]: With dead ends: 59 [2025-02-08 13:26:35,121 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 13:26:35,121 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:35,122 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:35,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 13:26:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-02-08 13:26:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.55) internal successors, (62), 51 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-02-08 13:26:35,135 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 7 [2025-02-08 13:26:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:35,135 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-02-08 13:26:35,136 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:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-02-08 13:26:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:26:35,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:35,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:35,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:26:35,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:26:35,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:35,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1328415559, now seen corresponding path program 1 times [2025-02-08 13:26:35,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:35,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901601972] [2025-02-08 13:26:35,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:35,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:35,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:26:35,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:26:35,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:35,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:36,093 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:36,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901601972] [2025-02-08 13:26:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901601972] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:36,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471537418] [2025-02-08 13:26:36,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:36,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:36,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:36,097 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:36,099 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:37,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:26:37,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:26:37,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:37,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:37,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:26:37,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:37,281 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:37,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:37,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471537418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:37,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:37,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:26:37,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858286566] [2025-02-08 13:26:37,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:37,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:37,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:37,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:37,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:37,283 INFO L87 Difference]: Start difference. First operand 56 states and 67 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:41,316 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:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:41,417 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-02-08 13:26:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:41,418 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:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:41,418 INFO L225 Difference]: With dead ends: 56 [2025-02-08 13:26:41,418 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 13:26:41,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:41,419 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 15 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:41,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 99 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 13:26:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 13:26:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.5) internal successors, (60), 49 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-02-08 13:26:41,424 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 11 [2025-02-08 13:26:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:41,425 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-02-08 13:26:41,425 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:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-02-08 13:26:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:26:41,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:41,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:41,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:26:41,626 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:41,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:26:41,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:41,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1768789901, now seen corresponding path program 1 times [2025-02-08 13:26:41,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:41,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159933140] [2025-02-08 13:26:41,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:41,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:42,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:26:42,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:26:42,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:42,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:42,593 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:42,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:42,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159933140] [2025-02-08 13:26:42,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159933140] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:42,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757808024] [2025-02-08 13:26:42,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:42,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:42,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:42,597 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:42,599 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:43,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:26:43,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:26:43,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:43,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:43,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:43,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:43,853 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:43,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:43,998 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:43,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757808024] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:43,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:43,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:26:43,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343576783] [2025-02-08 13:26:43,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:43,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:26:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:44,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:26:44,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:44,000 INFO L87 Difference]: Start difference. First operand 54 states and 65 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:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:44,121 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2025-02-08 13:26:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:44,122 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:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:44,122 INFO L225 Difference]: With dead ends: 112 [2025-02-08 13:26:44,122 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 13:26:44,123 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:44,123 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:44,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 120 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 13:26:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-08 13:26:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 58 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-02-08 13:26:44,135 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 12 [2025-02-08 13:26:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:44,136 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-02-08 13:26:44,136 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:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-02-08 13:26:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:26:44,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:44,137 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:44,150 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:44,337 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:44,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:26:44,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:44,338 INFO L85 PathProgramCache]: Analyzing trace with hash -227399561, now seen corresponding path program 2 times [2025-02-08 13:26:44,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:44,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658555718] [2025-02-08 13:26:44,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:26:44,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:44,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:26:45,011 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:45,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:26:45,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:45,479 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:45,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:45,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658555718] [2025-02-08 13:26:45,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658555718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:45,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:45,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:26:45,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181618415] [2025-02-08 13:26:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:45,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:26:45,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:45,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:26:45,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:45,481 INFO L87 Difference]: Start difference. First operand 63 states and 74 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:49,513 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:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:49,689 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2025-02-08 13:26:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:26:49,694 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:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:49,695 INFO L225 Difference]: With dead ends: 63 [2025-02-08 13:26:49,695 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 13:26:49,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:49,696 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 14 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:49,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 193 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:26:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 13:26:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-08 13:26:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 56 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-02-08 13:26:49,705 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 21 [2025-02-08 13:26:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:49,705 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-02-08 13:26:49,705 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:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-02-08 13:26:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:26:49,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:49,708 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:49,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:26:49,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:26:49,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash -81829314, now seen corresponding path program 1 times [2025-02-08 13:26:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:49,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889266327] [2025-02-08 13:26:49,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:49,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:50,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:26:50,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:26:50,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:50,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:50,441 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:50,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:50,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889266327] [2025-02-08 13:26:50,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889266327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:50,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:50,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:50,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331667996] [2025-02-08 13:26:50,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:50,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:50,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:50,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:50,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:50,443 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:54,475 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:54,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:54,547 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2025-02-08 13:26:54,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:54,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:26:54,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:54,549 INFO L225 Difference]: With dead ends: 106 [2025-02-08 13:26:54,549 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 13:26:54,549 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:54,549 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:54,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:26:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 13:26:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 13:26:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 59 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:26:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-02-08 13:26:54,555 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 26 [2025-02-08 13:26:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:54,556 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-02-08 13:26:54,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2025-02-08 13:26:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:26:54,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:54,556 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:54,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:26:54,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:26:54,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:54,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1765045840, now seen corresponding path program 1 times [2025-02-08 13:26:54,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:54,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964943218] [2025-02-08 13:26:54,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:54,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:55,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:55,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:55,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:55,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:55,386 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:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964943218] [2025-02-08 13:26:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964943218] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421609764] [2025-02-08 13:26:55,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:55,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:55,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:55,389 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:55,391 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:56,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:56,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:56,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:56,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:56,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:26:56,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:56,901 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:56,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:57,468 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:57,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421609764] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:57,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:57,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:26:57,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121941835] [2025-02-08 13:26:57,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:57,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:26:57,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:57,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:26:57,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:26:57,470 INFO L87 Difference]: Start difference. First operand 64 states and 75 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:01,503 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:05,516 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:05,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:05,936 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2025-02-08 13:27:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:27:05,937 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:05,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:05,937 INFO L225 Difference]: With dead ends: 131 [2025-02-08 13:27:05,937 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 13:27:05,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:27:05,939 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:05,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 257 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-02-08 13:27:05,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 13:27:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 13:27:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 76 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:27:05,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2025-02-08 13:27:05,946 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 29 [2025-02-08 13:27:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:05,946 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2025-02-08 13:27:05,946 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:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2025-02-08 13:27:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:27:05,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:05,947 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:05,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 13:27:06,148 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:27:06,148 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:27:06,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash -938983120, now seen corresponding path program 1 times [2025-02-08 13:27:06,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:06,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349765214] [2025-02-08 13:27:06,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:06,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:06,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:27:06,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:27:06,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:06,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:06,956 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:06,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349765214] [2025-02-08 13:27:06,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349765214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:06,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:06,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:06,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656528517] [2025-02-08 13:27:06,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:06,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:06,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:06,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:06,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:06,957 INFO L87 Difference]: Start difference. First operand 81 states and 92 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:27:10,991 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,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:11,123 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2025-02-08 13:27:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-08 13:27:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:11,124 INFO L225 Difference]: With dead ends: 93 [2025-02-08 13:27:11,124 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 13:27:11,124 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,125 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:11,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:27:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 13:27:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-02-08 13:27:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 85 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:27:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2025-02-08 13:27:11,137 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 47 [2025-02-08 13:27:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:11,139 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2025-02-08 13:27:11,140 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:27:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2025-02-08 13:27:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:27:11,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:11,142 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,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:27:11,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:27:11,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:11,143 INFO L85 PathProgramCache]: Analyzing trace with hash 956300032, now seen corresponding path program 1 times [2025-02-08 13:27:11,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:11,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643994615] [2025-02-08 13:27:11,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:11,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:11,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:27:11,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:27:11,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:11,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:11,831 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:11,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:11,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643994615] [2025-02-08 13:27:11,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643994615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:11,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:11,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:11,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306468414] [2025-02-08 13:27:11,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:11,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:11,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:11,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:11,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:11,833 INFO L87 Difference]: Start difference. First operand 90 states and 104 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:15,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:15,921 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2025-02-08 13:27:15,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:15,921 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:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:15,922 INFO L225 Difference]: With dead ends: 90 [2025-02-08 13:27:15,922 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 13:27:15,922 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:15,923 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:15,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:27:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 13:27:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2025-02-08 13:27:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.24) internal successors, (93), 80 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:27:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2025-02-08 13:27:15,929 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 48 [2025-02-08 13:27:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:15,929 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2025-02-08 13:27:15,929 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:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2025-02-08 13:27:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:27:15,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:15,931 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:15,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:27:15,932 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:27:15,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash 49518358, now seen corresponding path program 1 times [2025-02-08 13:27:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049860208] [2025-02-08 13:27:15,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:16,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:27:16,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:27:16,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:16,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:27:16,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:16,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049860208] [2025-02-08 13:27:16,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049860208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:16,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617155776] [2025-02-08 13:27:16,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:16,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:16,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:16,721 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:27:16,723 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:27:17,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:27:17,858 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,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:17,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:17,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:17,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:27:17,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:27:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:27:18,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617155776] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:27:18,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:27:18,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:27:18,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142939108] [2025-02-08 13:27:18,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:27:18,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:27:18,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:18,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:27:18,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:18,047 INFO L87 Difference]: Start difference. First operand 85 states and 98 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:22,074 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:26,105 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:30,113 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:34,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:38,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:38,350 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2025-02-08 13:27:38,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:27:38,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-02-08 13:27:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:38,351 INFO L225 Difference]: With dead ends: 146 [2025-02-08 13:27:38,351 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 13:27:38,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 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:27:38,352 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:38,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 219 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2025-02-08 13:27:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 13:27:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-08 13:27:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 98 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:27:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2025-02-08 13:27:38,358 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 54 [2025-02-08 13:27:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:38,358 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2025-02-08 13:27:38,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2025-02-08 13:27:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 13:27:38,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:38,360 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, 1, 1, 1, 1, 1] [2025-02-08 13:27:38,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:27:38,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 13:27:38,560 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting getoptErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:27:38,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2007036019, now seen corresponding path program 1 times [2025-02-08 13:27:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:38,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448245108] [2025-02-08 13:27:38,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:39,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 13:27:39,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 13:27:39,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:39,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 13:27:39,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:39,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448245108] [2025-02-08 13:27:39,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448245108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:39,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:39,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:27:39,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467187028] [2025-02-08 13:27:39,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:39,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:39,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:39,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:39,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:39,399 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:27:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:39,476 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2025-02-08 13:27:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:39,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-02-08 13:27:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:39,477 INFO L225 Difference]: With dead ends: 131 [2025-02-08 13:27:39,477 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 13:27:39,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:39,478 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:39,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 56 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 13:27:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-08 13:27:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 93 states have (on average 1.1397849462365592) internal successors, (106), 96 states have internal predecessors, (106), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:27:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2025-02-08 13:27:39,489 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 59 [2025-02-08 13:27:39,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:39,489 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2025-02-08 13:27:39,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:27:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2025-02-08 13:27:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-08 13:27:39,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:39,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:39,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:27:39,494 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:27:39,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:39,494 INFO L85 PathProgramCache]: Analyzing trace with hash -78205913, now seen corresponding path program 1 times [2025-02-08 13:27:39,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:39,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621598659] [2025-02-08 13:27:39,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:39,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:39,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 13:27:39,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 13:27:39,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:39,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 13:27:40,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:40,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621598659] [2025-02-08 13:27:40,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621598659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:40,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:40,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:27:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564129592] [2025-02-08 13:27:40,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:40,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:27:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:40,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:27:40,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:27:40,320 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:27:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:40,470 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2025-02-08 13:27:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:27:40,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2025-02-08 13:27:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:40,471 INFO L225 Difference]: With dead ends: 101 [2025-02-08 13:27:40,471 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 13:27:40,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:27:40,472 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:40,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 88 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 13:27:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-08 13:27:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 95 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:27:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-02-08 13:27:40,478 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 65 [2025-02-08 13:27:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:40,478 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-02-08 13:27:40,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:27:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-02-08 13:27:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 13:27:40,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:40,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:40,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:27:40,480 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:27:40,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:40,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1870583972, now seen corresponding path program 1 times [2025-02-08 13:27:40,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:40,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090132404] [2025-02-08 13:27:40,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:40,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:41,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 13:27:41,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 13:27:41,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:41,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 13:27:41,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:41,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090132404] [2025-02-08 13:27:41,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090132404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:41,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:41,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:27:41,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291734413] [2025-02-08 13:27:41,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:41,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:27:41,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:41,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:27:41,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:27:41,455 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:27:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:41,530 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2025-02-08 13:27:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:27:41,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2025-02-08 13:27:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:41,533 INFO L225 Difference]: With dead ends: 100 [2025-02-08 13:27:41,533 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 13:27:41,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:27:41,534 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 23 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:41,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 56 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 13:27:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-08 13:27:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 72 states have internal predecessors, (76), 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:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2025-02-08 13:27:41,539 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 66 [2025-02-08 13:27:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:41,540 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2025-02-08 13:27:41,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:27:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2025-02-08 13:27:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 13:27:41,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:41,541 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:41,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 13:27:41,541 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 13:27:41,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2133112550, now seen corresponding path program 2 times [2025-02-08 13:27:41,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:41,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618993191] [2025-02-08 13:27:41,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:27:41,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:42,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-02-08 13:27:42,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 13:27:42,325 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:27:42,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-08 13:27:42,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618993191] [2025-02-08 13:27:42,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618993191] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235410943] [2025-02-08 13:27:42,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:27:42,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:42,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:42,679 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:42,682 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