./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-08 09:11:15,223 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-08 09:11:15,270 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf
[2025-02-08 09:11:15,274 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-08 09:11:15,274 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-08 09:11:15,291 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-08 09:11:15,292 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-08 09:11:15,292 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-08 09:11:15,292 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-08 09:11:15,292 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-08 09:11:15,292 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-08 09:11:15,292 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-08 09:11:15,292 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-08 09:11:15,293 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-08 09:11:15,293 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-08 09:11:15,293 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-08 09:11:15,293 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-08 09:11:15,293 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-08 09:11:15,293 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-08 09:11:15,293 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-08 09:11:15,293 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-08 09:11:15,293 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-08 09:11:15,293 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-08 09:11:15,293 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-08 09:11:15,294 INFO  L153        SettingsManager]:  * Check absence of signed integer overflows=ASSERTandASSUME
[2025-02-08 09:11:15,294 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-08 09:11:15,294 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-08 09:11:15,294 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-08 09:11:15,294 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-08 09:11:15,294 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-08 09:11:15,294 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-08 09:11:15,294 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-08 09:11:15,294 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-08 09:11:15,294 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-08 09:11:15,295 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 09:11:15,295 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-08 09:11:15,295 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-08 09:11:15,295 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-08 09:11:15,295 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-08 09:11:15,295 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-08 09:11:15,295 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-08 09:11:15,295 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-08 09:11:15,295 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-08 09:11:15,295 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-08 09:11:15,295 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-08 09:11:15,296 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 -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c
[2025-02-08 09:11:15,464 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 09:11:15,470 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 09:11:15,471 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 09:11:15,472 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 09:11:15,472 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 09:11:15,473 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c
[2025-02-08 09:11:16,540 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c60362a8/b94c0348bb22472b9ab927b01d34feeb/FLAG94e688c6a
[2025-02-08 09:11:16,726 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 09:11:16,727 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c
[2025-02-08 09:11:16,732 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c60362a8/b94c0348bb22472b9ab927b01d34feeb/FLAG94e688c6a
[2025-02-08 09:11:17,119 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c60362a8/b94c0348bb22472b9ab927b01d34feeb
[2025-02-08 09:11:17,135 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 09:11:17,145 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 09:11:17,149 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 09:11:17,149 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 09:11:17,170 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 09:11:17,170 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,172 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59354560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17, skipping insertion in model container
[2025-02-08 09:11:17,172 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,195 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 09:11:17,348 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 09:11:17,356 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 09:11:17,398 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 09:11:17,411 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 09:11:17,412 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17 WrapperNode
[2025-02-08 09:11:17,412 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 09:11:17,413 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 09:11:17,413 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 09:11:17,413 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 09:11:17,418 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,426 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,448 INFO  L138                Inliner]: procedures = 14, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 312
[2025-02-08 09:11:17,448 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 09:11:17,449 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 09:11:17,449 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 09:11:17,449 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 09:11:17,456 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,457 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,459 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,472 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-08 09:11:17,473 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,473 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,483 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,489 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,490 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,491 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,492 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 09:11:17,493 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 09:11:17,493 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 09:11:17,493 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 09:11:17,495 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (1/1) ...
[2025-02-08 09:11:17,509 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 09:11:17,522 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 09:11:17,539 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 09:11:17,544 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 09:11:17,562 INFO  L130     BoogieDeclarations]: Found specification of procedure reach_error
[2025-02-08 09:11:17,562 INFO  L138     BoogieDeclarations]: Found implementation of procedure reach_error
[2025-02-08 09:11:17,563 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-08 09:11:17,563 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-08 09:11:17,563 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 09:11:17,563 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 09:11:17,616 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 09:11:17,617 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 09:11:17,900 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true;
[2025-02-08 09:11:17,901 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L301: havoc main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1;havoc main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1;havoc main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1;havoc main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1;havoc main_~main____CPAchecker_TMP_3~0#1;havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1;havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1;havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1;havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1;
[2025-02-08 09:11:17,901 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L379: havoc main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1;havoc main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1;
[2025-02-08 09:11:17,901 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L132: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;#t~ret11#1 := main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;assume { :end_inline_main } true;
[2025-02-08 09:11:17,918 INFO  L?                        ?]: Removed 152 outVars from TransFormulas that were not future-live.
[2025-02-08 09:11:17,918 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 09:11:17,930 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 09:11:17,930 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-08 09:11:17,931 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:11:17 BoogieIcfgContainer
[2025-02-08 09:11:17,931 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 09:11:17,932 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-08 09:11:17,932 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-08 09:11:17,940 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-08 09:11:17,943 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:11:17" (1/3) ...
[2025-02-08 09:11:17,944 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c8e7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:11:17, skipping insertion in model container
[2025-02-08 09:11:17,944 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:17" (2/3) ...
[2025-02-08 09:11:17,944 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c8e7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:11:17, skipping insertion in model container
[2025-02-08 09:11:17,944 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:11:17" (3/3) ...
[2025-02-08 09:11:17,945 INFO  L128   eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c
[2025-02-08 09:11:17,971 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-08 09:11:17,972 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG apache-escape-absolute.i.v+cfa-reducer.c that has 2 procedures, 147 locations, 1 initial locations, 0 loop locations, and 30 error locations.
[2025-02-08 09:11:18,028 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-08 09:11:18,037 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;@6d0fa6de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-08 09:11:18,037 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 30 error locations.
[2025-02-08 09:11:18,040 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 146 states, 89 states have (on average 1.7640449438202248) internal successors, (157), 126 states have internal predecessors, (157), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-02-08 09:11:18,043 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-02-08 09:11:18,043 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 09:11:18,044 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 09:11:18,044 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] ===
[2025-02-08 09:11:18,048 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 09:11:18,048 INFO  L85        PathProgramCache]: Analyzing trace with hash -190763368, now seen corresponding path program 1 times
[2025-02-08 09:11:18,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 09:11:18,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832439667]
[2025-02-08 09:11:18,054 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 09:11:18,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 09:11:18,103 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-08 09:11:18,116 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-08 09:11:18,116 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 09:11:18,116 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 09:11:18,168 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 09:11:18,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 09:11:18,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832439667]
[2025-02-08 09:11:18,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832439667] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 09:11:18,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 09:11:18,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 09:11:18,171 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088658019]
[2025-02-08 09:11:18,171 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 09:11:18,173 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 09:11:18,173 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 09:11:18,187 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 09:11:18,187 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 09:11:18,190 INFO  L87              Difference]: Start difference. First operand  has 146 states, 89 states have (on average 1.7640449438202248) internal successors, (157), 126 states have internal predecessors, (157), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand  has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 09:11:18,292 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 09:11:18,292 INFO  L93              Difference]: Finished difference Result 149 states and 193 transitions.
[2025-02-08 09:11:18,294 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 09:11:18,295 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12
[2025-02-08 09:11:18,295 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 09:11:18,298 INFO  L225             Difference]: With dead ends: 149
[2025-02-08 09:11:18,299 INFO  L226             Difference]: Without dead ends: 94
[2025-02-08 09:11:18,300 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 09:11:18,303 INFO  L435           NwaCegarLoop]: 115 mSDtfsCounter, 90 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-08 09:11:18,304 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 149 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-08 09:11:18,314 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-02-08 09:11:18,329 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2025-02-08 09:11:18,330 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 93 states have internal predecessors, (93), 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 09:11:18,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 93 transitions.
[2025-02-08 09:11:18,341 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 93 transitions. Word has length 12
[2025-02-08 09:11:18,341 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 09:11:18,341 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 93 transitions.
[2025-02-08 09:11:18,341 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 09:11:18,341 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 93 transitions.
[2025-02-08 09:11:18,342 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-02-08 09:11:18,342 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 09:11:18,342 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 09:11:18,342 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-08 09:11:18,342 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] ===
[2025-02-08 09:11:18,342 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 09:11:18,342 INFO  L85        PathProgramCache]: Analyzing trace with hash -1618696907, now seen corresponding path program 1 times
[2025-02-08 09:11:18,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 09:11:18,343 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908373023]
[2025-02-08 09:11:18,343 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 09:11:18,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 09:11:18,349 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-02-08 09:11:18,359 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-08 09:11:18,360 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 09:11:18,360 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 09:11:18,396 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 09:11:18,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 09:11:18,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908373023]
[2025-02-08 09:11:18,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908373023] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 09:11:18,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 09:11:18,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-02-08 09:11:18,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757268049]
[2025-02-08 09:11:18,397 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 09:11:18,397 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 09:11:18,397 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 09:11:18,398 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 09:11:18,398 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 09:11:18,398 INFO  L87              Difference]: Start difference. First operand 94 states and 93 transitions. Second operand  has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 09:11:18,458 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 09:11:18,461 INFO  L93              Difference]: Finished difference Result 94 states and 93 transitions.
[2025-02-08 09:11:18,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 09:11:18,461 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13
[2025-02-08 09:11:18,461 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 09:11:18,462 INFO  L225             Difference]: With dead ends: 94
[2025-02-08 09:11:18,462 INFO  L226             Difference]: Without dead ends: 89
[2025-02-08 09:11:18,462 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 09:11:18,462 INFO  L435           NwaCegarLoop]: 62 mSDtfsCounter, 64 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-08 09:11:18,462 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 72 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-08 09:11:18,463 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2025-02-08 09:11:18,467 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89.
[2025-02-08 09:11:18,468 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 88 states have internal predecessors, (88), 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 09:11:18,469 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 88 transitions.
[2025-02-08 09:11:18,469 INFO  L78                 Accepts]: Start accepts. Automaton has 89 states and 88 transitions. Word has length 13
[2025-02-08 09:11:18,470 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 09:11:18,470 INFO  L471      AbstractCegarLoop]: Abstraction has 89 states and 88 transitions.
[2025-02-08 09:11:18,471 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 09:11:18,471 INFO  L276                IsEmpty]: Start isEmpty. Operand 89 states and 88 transitions.
[2025-02-08 09:11:18,471 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-02-08 09:11:18,471 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 09:11:18,471 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 09:11:18,471 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-08 09:11:18,471 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] ===
[2025-02-08 09:11:18,471 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 09:11:18,472 INFO  L85        PathProgramCache]: Analyzing trace with hash -789559949, now seen corresponding path program 1 times
[2025-02-08 09:11:18,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 09:11:18,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322757384]
[2025-02-08 09:11:18,472 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 09:11:18,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 09:11:18,479 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-02-08 09:11:18,487 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-02-08 09:11:18,490 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 09:11:18,490 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 09:11:18,537 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 09:11:18,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 09:11:18,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322757384]
[2025-02-08 09:11:18,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322757384] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 09:11:18,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 09:11:18,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 09:11:18,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147989939]
[2025-02-08 09:11:18,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 09:11:18,538 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-08 09:11:18,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 09:11:18,538 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-08 09:11:18,538 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 09:11:18,538 INFO  L87              Difference]: Start difference. First operand 89 states and 88 transitions. Second operand  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 09:11:18,605 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 09:11:18,605 INFO  L93              Difference]: Finished difference Result 89 states and 88 transitions.
[2025-02-08 09:11:18,605 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-08 09:11:18,606 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15
[2025-02-08 09:11:18,606 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 09:11:18,606 INFO  L225             Difference]: With dead ends: 89
[2025-02-08 09:11:18,606 INFO  L226             Difference]: Without dead ends: 81
[2025-02-08 09:11:18,607 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 09:11:18,607 INFO  L435           NwaCegarLoop]: 40 mSDtfsCounter, 57 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-08 09:11:18,607 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 85 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-08 09:11:18,608 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2025-02-08 09:11:18,610 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81.
[2025-02-08 09:11:18,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 80 states have internal predecessors, (80), 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 09:11:18,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 80 transitions.
[2025-02-08 09:11:18,611 INFO  L78                 Accepts]: Start accepts. Automaton has 81 states and 80 transitions. Word has length 15
[2025-02-08 09:11:18,611 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 09:11:18,611 INFO  L471      AbstractCegarLoop]: Abstraction has 81 states and 80 transitions.
[2025-02-08 09:11:18,611 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 09:11:18,611 INFO  L276                IsEmpty]: Start isEmpty. Operand 81 states and 80 transitions.
[2025-02-08 09:11:18,611 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-02-08 09:11:18,611 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 09:11:18,611 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 09:11:18,611 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-08 09:11:18,612 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] ===
[2025-02-08 09:11:18,612 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 09:11:18,612 INFO  L85        PathProgramCache]: Analyzing trace with hash 1293445557, now seen corresponding path program 1 times
[2025-02-08 09:11:18,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 09:11:18,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338635628]
[2025-02-08 09:11:18,612 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 09:11:18,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 09:11:18,616 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-02-08 09:11:18,619 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-02-08 09:11:18,619 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 09:11:18,619 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 09:11:18,647 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 09:11:18,647 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 09:11:18,647 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338635628]
[2025-02-08 09:11:18,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338635628] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 09:11:18,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 09:11:18,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 09:11:18,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338247856]
[2025-02-08 09:11:18,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 09:11:18,648 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-08 09:11:18,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 09:11:18,648 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-08 09:11:18,648 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 09:11:18,649 INFO  L87              Difference]: Start difference. First operand 81 states and 80 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 09:11:18,700 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 09:11:18,700 INFO  L93              Difference]: Finished difference Result 81 states and 80 transitions.
[2025-02-08 09:11:18,700 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-08 09:11:18,701 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 16
[2025-02-08 09:11:18,701 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 09:11:18,701 INFO  L225             Difference]: With dead ends: 81
[2025-02-08 09:11:18,701 INFO  L226             Difference]: Without dead ends: 70
[2025-02-08 09:11:18,701 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 09:11:18,702 INFO  L435           NwaCegarLoop]: 47 mSDtfsCounter, 33 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-08 09:11:18,702 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 112 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-08 09:11:18,703 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2025-02-08 09:11:18,704 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2025-02-08 09:11:18,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 69 states have internal predecessors, (69), 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 09:11:18,705 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 69 transitions.
[2025-02-08 09:11:18,705 INFO  L78                 Accepts]: Start accepts. Automaton has 70 states and 69 transitions. Word has length 16
[2025-02-08 09:11:18,705 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 09:11:18,705 INFO  L471      AbstractCegarLoop]: Abstraction has 70 states and 69 transitions.
[2025-02-08 09:11:18,706 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 09:11:18,706 INFO  L276                IsEmpty]: Start isEmpty. Operand 70 states and 69 transitions.
[2025-02-08 09:11:18,706 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-02-08 09:11:18,706 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 09:11:18,706 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 09:11:18,707 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-08 09:11:18,707 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] ===
[2025-02-08 09:11:18,707 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 09:11:18,707 INFO  L85        PathProgramCache]: Analyzing trace with hash -540931800, now seen corresponding path program 1 times
[2025-02-08 09:11:18,707 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 09:11:18,707 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665177157]
[2025-02-08 09:11:18,708 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 09:11:18,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 09:11:18,716 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-02-08 09:11:18,728 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-02-08 09:11:18,728 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 09:11:18,729 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 09:11:18,791 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 09:11:18,792 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 09:11:18,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665177157]
[2025-02-08 09:11:18,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665177157] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 09:11:18,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 09:11:18,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 09:11:18,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072122585]
[2025-02-08 09:11:18,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 09:11:18,797 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 09:11:18,797 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 09:11:18,797 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 09:11:18,797 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 09:11:18,797 INFO  L87              Difference]: Start difference. First operand 70 states and 69 transitions. Second operand  has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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 09:11:18,808 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 09:11:18,808 INFO  L93              Difference]: Finished difference Result 70 states and 69 transitions.
[2025-02-08 09:11:18,808 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 09:11:18,808 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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 52
[2025-02-08 09:11:18,809 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 09:11:18,809 INFO  L225             Difference]: With dead ends: 70
[2025-02-08 09:11:18,809 INFO  L226             Difference]: Without dead ends: 69
[2025-02-08 09:11:18,809 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 09:11:18,810 INFO  L435           NwaCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-08 09:11:18,810 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-08 09:11:18,810 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2025-02-08 09:11:18,812 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2025-02-08 09:11:18,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 68 states have internal predecessors, (68), 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 09:11:18,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 68 transitions.
[2025-02-08 09:11:18,813 INFO  L78                 Accepts]: Start accepts. Automaton has 69 states and 68 transitions. Word has length 52
[2025-02-08 09:11:18,813 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 09:11:18,813 INFO  L471      AbstractCegarLoop]: Abstraction has 69 states and 68 transitions.
[2025-02-08 09:11:18,813 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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 09:11:18,813 INFO  L276                IsEmpty]: Start isEmpty. Operand 69 states and 68 transitions.
[2025-02-08 09:11:18,814 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2025-02-08 09:11:18,814 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 09:11:18,814 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 09:11:18,814 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-08 09:11:18,814 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] ===
[2025-02-08 09:11:18,815 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 09:11:18,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 410983477, now seen corresponding path program 1 times
[2025-02-08 09:11:18,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 09:11:18,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327185015]
[2025-02-08 09:11:18,815 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 09:11:18,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 09:11:18,823 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes.
[2025-02-08 09:11:18,830 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements.
[2025-02-08 09:11:18,831 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 09:11:18,831 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 09:11:18,913 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 09:11:18,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 09:11:18,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327185015]
[2025-02-08 09:11:18,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327185015] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 09:11:18,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 09:11:18,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-02-08 09:11:18,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318238895]
[2025-02-08 09:11:18,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 09:11:18,914 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 09:11:18,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 09:11:18,916 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 09:11:18,916 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 09:11:18,916 INFO  L87              Difference]: Start difference. First operand 69 states and 68 transitions. Second operand  has 3 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 09:11:18,927 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 09:11:18,928 INFO  L93              Difference]: Finished difference Result 69 states and 68 transitions.
[2025-02-08 09:11:18,928 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 09:11:18,928 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 53
[2025-02-08 09:11:18,928 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 09:11:18,929 INFO  L225             Difference]: With dead ends: 69
[2025-02-08 09:11:18,929 INFO  L226             Difference]: Without dead ends: 68
[2025-02-08 09:11:18,930 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 09:11:18,930 INFO  L435           NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-08 09:11:18,931 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-08 09:11:18,931 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2025-02-08 09:11:18,933 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68.
[2025-02-08 09:11:18,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 67 states have internal predecessors, (67), 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 09:11:18,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions.
[2025-02-08 09:11:18,935 INFO  L78                 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 53
[2025-02-08 09:11:18,938 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 09:11:18,938 INFO  L471      AbstractCegarLoop]: Abstraction has 68 states and 67 transitions.
[2025-02-08 09:11:18,938 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 09:11:18,938 INFO  L276                IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions.
[2025-02-08 09:11:18,939 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-02-08 09:11:18,939 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 09:11:18,939 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 09:11:18,939 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-08 09:11:18,939 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] ===
[2025-02-08 09:11:18,939 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 09:11:18,939 INFO  L85        PathProgramCache]: Analyzing trace with hash -2044702209, now seen corresponding path program 1 times
[2025-02-08 09:11:18,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 09:11:18,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79290537]
[2025-02-08 09:11:18,940 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 09:11:18,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 09:11:18,953 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-02-08 09:11:18,966 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-02-08 09:11:18,966 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 09:11:18,966 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 09:11:19,051 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 09:11:19,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 09:11:19,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79290537]
[2025-02-08 09:11:19,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79290537] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 09:11:19,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 09:11:19,052 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 09:11:19,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014927891]
[2025-02-08 09:11:19,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 09:11:19,052 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 09:11:19,052 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 09:11:19,053 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 09:11:19,053 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 09:11:19,053 INFO  L87              Difference]: Start difference. First operand 68 states and 67 transitions. Second operand  has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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 09:11:19,064 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 09:11:19,064 INFO  L93              Difference]: Finished difference Result 68 states and 67 transitions.
[2025-02-08 09:11:19,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 09:11:19,064 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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 58
[2025-02-08 09:11:19,064 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 09:11:19,065 INFO  L225             Difference]: With dead ends: 68
[2025-02-08 09:11:19,065 INFO  L226             Difference]: Without dead ends: 66
[2025-02-08 09:11:19,065 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 09:11:19,065 INFO  L435           NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-08 09:11:19,065 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-08 09:11:19,066 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66 states.
[2025-02-08 09:11:19,067 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66.
[2025-02-08 09:11:19,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 66 states, 65 states have (on average 1.0) internal successors, (65), 65 states have internal predecessors, (65), 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 09:11:19,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 65 transitions.
[2025-02-08 09:11:19,070 INFO  L78                 Accepts]: Start accepts. Automaton has 66 states and 65 transitions. Word has length 58
[2025-02-08 09:11:19,070 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 09:11:19,071 INFO  L471      AbstractCegarLoop]: Abstraction has 66 states and 65 transitions.
[2025-02-08 09:11:19,071 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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 09:11:19,071 INFO  L276                IsEmpty]: Start isEmpty. Operand 66 states and 65 transitions.
[2025-02-08 09:11:19,071 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-02-08 09:11:19,071 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 09:11:19,071 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 09:11:19,071 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-08 09:11:19,071 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] ===
[2025-02-08 09:11:19,072 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 09:11:19,072 INFO  L85        PathProgramCache]: Analyzing trace with hash 1128497031, now seen corresponding path program 1 times
[2025-02-08 09:11:19,072 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 09:11:19,072 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950649824]
[2025-02-08 09:11:19,072 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 09:11:19,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 09:11:19,085 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-02-08 09:11:19,098 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-02-08 09:11:19,098 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 09:11:19,098 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 09:11:19,231 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 09:11:19,231 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 09:11:19,231 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950649824]
[2025-02-08 09:11:19,232 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950649824] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 09:11:19,232 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 09:11:19,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 09:11:19,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95153101]
[2025-02-08 09:11:19,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 09:11:19,233 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-08 09:11:19,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 09:11:19,233 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-08 09:11:19,233 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-08 09:11:19,233 INFO  L87              Difference]: Start difference. First operand 66 states and 65 transitions. Second operand  has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 09:11:19,299 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 09:11:19,299 INFO  L93              Difference]: Finished difference Result 66 states and 65 transitions.
[2025-02-08 09:11:19,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 09:11:19,300 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65
[2025-02-08 09:11:19,300 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 09:11:19,300 INFO  L225             Difference]: With dead ends: 66
[2025-02-08 09:11:19,300 INFO  L226             Difference]: Without dead ends: 0
[2025-02-08 09:11:19,301 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-08 09:11:19,301 INFO  L435           NwaCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-08 09:11:19,301 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 42 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-08 09:11:19,301 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-08 09:11:19,302 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-08 09:11:19,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 09:11:19,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-08 09:11:19,302 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65
[2025-02-08 09:11:19,302 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 09:11:19,302 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-08 09:11:19,302 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 09:11:19,302 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-08 09:11:19,302 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-08 09:11:19,306 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining)
[2025-02-08 09:11:19,307 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining)
[2025-02-08 09:11:19,307 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining)
[2025-02-08 09:11:19,307 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining)
[2025-02-08 09:11:19,310 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining)
[2025-02-08 09:11:19,310 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining)
[2025-02-08 09:11:19,311 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining)
[2025-02-08 09:11:19,312 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-08 09:11:19,314 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 09:11:19,316 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-08 09:11:19,347 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-08 09:11:19,355 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:11:19 BoogieIcfgContainer
[2025-02-08 09:11:19,356 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-08 09:11:19,356 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-08 09:11:19,356 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-08 09:11:19,357 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-08 09:11:19,357 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:11:17" (3/4) ...
[2025-02-08 09:11:19,358 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-08 09:11:19,362 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure reach_error
[2025-02-08 09:11:19,366 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges
[2025-02-08 09:11:19,367 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-08 09:11:19,367 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2025-02-08 09:11:19,367 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-08 09:11:19,437 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-08 09:11:19,437 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-08 09:11:19,437 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-08 09:11:19,438 INFO  L158              Benchmark]: Toolchain (without parser) took 2293.82ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 69.8MB in the end (delta: 38.5MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB.
[2025-02-08 09:11:19,438 INFO  L158              Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 09:11:19,439 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 263.53ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 95.0MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-08 09:11:19,439 INFO  L158              Benchmark]: Boogie Procedure Inliner took 35.21ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 09:11:19,439 INFO  L158              Benchmark]: Boogie Preprocessor took 43.48ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-08 09:11:19,440 INFO  L158              Benchmark]: IcfgBuilder took 437.80ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 66.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-02-08 09:11:19,440 INFO  L158              Benchmark]: TraceAbstraction took 1423.40ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 79.0MB in the end (delta: -13.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 09:11:19,440 INFO  L158              Benchmark]: Witness Printer took 81.36ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 69.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-08 09:11:19,441 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 263.53ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 95.0MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 35.21ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 43.48ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 437.80ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 66.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 1423.40ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 79.0MB in the end (delta: -13.9MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 81.36ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 69.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 314]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 314]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 264]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 264]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 234]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 234]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 232]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 232]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 200]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 200]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 194]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 194]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 194]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 194]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 184]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 184]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 172]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 172]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 162]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 162]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 391]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 391]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 131]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 131]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 92]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 92]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 80]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 80]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 71]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 71]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 147 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 309 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309 mSDsluCounter, 707 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 320 IncrementalHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 472 mSDtfsCounter, 320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    30 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-02-08 09:11:19,456 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE