./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 17:42:42,030 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 17:42:42,076 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 17:42:42,082 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 17:42:42,083 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 17:42:42,104 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 17:42:42,105 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 17:42:42,106 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 17:42:42,106 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 17:42:42,106 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 17:42:42,106 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 17:42:42,106 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 17:42:42,106 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 17:42:42,106 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 17:42:42,106 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 17:42:42,106 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 17:42:42,106 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 17:42:42,106 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 17:42:42,107 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 17:42:42,107 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 17:42:42,107 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 17:42:42,107 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 17:42:42,107 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 17:42:42,107 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 17:42:42,107 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 17:42:42,107 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 17:42:42,107 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 17:42:42,109 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 17:42:42,109 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 17:42:42,109 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 17:42:42,109 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 17:42:42,109 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 17:42:42,109 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 17:42:42,109 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 17:42:42,110 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 17:42:42,110 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 17:42:42,110 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 17:42:42,110 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 17:42:42,110 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 17:42:42,110 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 17:42:42,110 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 17:42:42,110 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 17:42:42,110 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 17:42:42,110 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/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8
[2025-03-16 17:42:42,317 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 17:42:42,323 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 17:42:42,326 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 17:42:42,327 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 17:42:42,327 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 17:42:42,328 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i
[2025-03-16 17:42:43,483 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a001d02f0/6821e5c5a47b4731888bdb78b6597a1c/FLAG3881aee70
[2025-03-16 17:42:43,715 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 17:42:43,716 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i
[2025-03-16 17:42:43,729 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a001d02f0/6821e5c5a47b4731888bdb78b6597a1c/FLAG3881aee70
[2025-03-16 17:42:44,055 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a001d02f0/6821e5c5a47b4731888bdb78b6597a1c
[2025-03-16 17:42:44,057 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 17:42:44,058 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 17:42:44,059 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 17:42:44,059 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 17:42:44,062 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 17:42:44,062 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,063 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20efc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44, skipping insertion in model container
[2025-03-16 17:42:44,063 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,084 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 17:42:44,303 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288]
[2025-03-16 17:42:44,307 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 17:42:44,316 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 17:42:44,361 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288]
[2025-03-16 17:42:44,362 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 17:42:44,383 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 17:42:44,384 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44 WrapperNode
[2025-03-16 17:42:44,384 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 17:42:44,385 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 17:42:44,385 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 17:42:44,385 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 17:42:44,389 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,400 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,415 INFO  L138                Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89
[2025-03-16 17:42:44,416 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 17:42:44,417 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 17:42:44,417 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 17:42:44,417 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 17:42:44,423 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,423 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,426 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,439 INFO  L175           MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 6, 8]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5].
[2025-03-16 17:42:44,439 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,439 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,446 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,447 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,448 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,448 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,450 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 17:42:44,450 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 17:42:44,450 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 17:42:44,450 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 17:42:44,451 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (1/1) ...
[2025-03-16 17:42:44,455 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 17:42:44,462 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 17:42:44,472 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-16 17:42:44,474 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure myexit
[2025-03-16 17:42:44,488 INFO  L138     BoogieDeclarations]: Found implementation of procedure myexit
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#2
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#2
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-03-16 17:42:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2025-03-16 17:42:44,489 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 17:42:44,489 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 17:42:44,561 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 17:42:44,562 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 17:42:44,590 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true;
[2025-03-16 17:42:44,686 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L621: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset;
[2025-03-16 17:42:44,699 INFO  L?                        ?]: Removed 23 outVars from TransFormulas that were not future-live.
[2025-03-16 17:42:44,699 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 17:42:44,707 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 17:42:44,708 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 17:42:44,708 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:42:44 BoogieIcfgContainer
[2025-03-16 17:42:44,708 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 17:42:44,710 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 17:42:44,710 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 17:42:44,713 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 17:42:44,713 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:42:44" (1/3) ...
[2025-03-16 17:42:44,714 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5643234b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:42:44, skipping insertion in model container
[2025-03-16 17:42:44,715 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:44" (2/3) ...
[2025-03-16 17:42:44,715 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5643234b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:42:44, skipping insertion in model container
[2025-03-16 17:42:44,715 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:42:44" (3/3) ...
[2025-03-16 17:42:44,716 INFO  L128   eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i
[2025-03-16 17:42:44,727 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 17:42:44,728 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_remove_all_reverse.i that has 2 procedures, 22 locations, 1 initial locations, 3 loop locations, and 1 error locations.
[2025-03-16 17:42:44,765 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 17:42:44,775 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;@625f7da5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 17:42:44,776 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 17:42:44,779 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 21 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:42:44,783 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2025-03-16 17:42:44,784 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:42:44,784 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2025-03-16 17:42:44,784 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:42:44,788 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:42:44,789 INFO  L85        PathProgramCache]: Analyzing trace with hash 62695059, now seen corresponding path program 1 times
[2025-03-16 17:42:44,794 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:42:44,794 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095333514]
[2025-03-16 17:42:44,794 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:44,795 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:42:44,846 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-03-16 17:42:44,859 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-03-16 17:42:44,859 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:44,859 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:44,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:42:44,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:42:44,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095333514]
[2025-03-16 17:42:44,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095333514] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 17:42:44,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 17:42:44,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 17:42:44,970 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994952652]
[2025-03-16 17:42:44,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 17:42:44,973 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 17:42:44,973 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:42:44,984 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 17:42:44,984 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 17:42:44,986 INFO  L87              Difference]: Start difference. First operand  has 21 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-03-16 17:42:45,004 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:42:45,004 INFO  L93              Difference]: Finished difference Result 39 states and 53 transitions.
[2025-03-16 17:42:45,007 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 17:42:45,008 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5
[2025-03-16 17:42:45,008 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:42:45,011 INFO  L225             Difference]: With dead ends: 39
[2025-03-16 17:42:45,011 INFO  L226             Difference]: Without dead ends: 20
[2025-03-16 17:42:45,014 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-03-16 17:42:45,016 INFO  L435           NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 17:42:45,018 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 17:42:45,029 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2025-03-16 17:42:45,035 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16.
[2025-03-16 17:42:45,036 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-03-16 17:42:45,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions.
[2025-03-16 17:42:45,039 INFO  L78                 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 5
[2025-03-16 17:42:45,039 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:42:45,039 INFO  L471      AbstractCegarLoop]: Abstraction has 16 states and 20 transitions.
[2025-03-16 17:42:45,039 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-03-16 17:42:45,039 INFO  L276                IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions.
[2025-03-16 17:42:45,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2025-03-16 17:42:45,040 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:42:45,040 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:42:45,040 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 17:42:45,040 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:42:45,040 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:42:45,040 INFO  L85        PathProgramCache]: Analyzing trace with hash -1687124308, now seen corresponding path program 1 times
[2025-03-16 17:42:45,041 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:42:45,041 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614988577]
[2025-03-16 17:42:45,041 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:45,041 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:42:45,061 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes.
[2025-03-16 17:42:45,072 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements.
[2025-03-16 17:42:45,072 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:45,073 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:45,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:42:45,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:42:45,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614988577]
[2025-03-16 17:42:45,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614988577] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 17:42:45,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 17:42:45,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 17:42:45,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987203232]
[2025-03-16 17:42:45,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 17:42:45,120 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 17:42:45,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:42:45,121 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 17:42:45,121 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 17:42:45,121 INFO  L87              Difference]: Start difference. First operand 16 states and 20 transitions. Second operand  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-03-16 17:42:45,140 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:42:45,140 INFO  L93              Difference]: Finished difference Result 33 states and 42 transitions.
[2025-03-16 17:42:45,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 17:42:45,141 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10
[2025-03-16 17:42:45,141 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:42:45,141 INFO  L225             Difference]: With dead ends: 33
[2025-03-16 17:42:45,141 INFO  L226             Difference]: Without dead ends: 19
[2025-03-16 17:42:45,141 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-03-16 17:42:45,142 INFO  L435           NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 17:42:45,142 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 17:42:45,142 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2025-03-16 17:42:45,143 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2025-03-16 17:42:45,144 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-03-16 17:42:45,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions.
[2025-03-16 17:42:45,144 INFO  L78                 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10
[2025-03-16 17:42:45,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:42:45,144 INFO  L471      AbstractCegarLoop]: Abstraction has 19 states and 23 transitions.
[2025-03-16 17:42:45,144 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-03-16 17:42:45,144 INFO  L276                IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions.
[2025-03-16 17:42:45,145 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2025-03-16 17:42:45,145 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:42:45,145 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:42:45,145 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 17:42:45,145 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:42:45,145 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:42:45,146 INFO  L85        PathProgramCache]: Analyzing trace with hash -1658495157, now seen corresponding path program 1 times
[2025-03-16 17:42:45,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:42:45,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278385672]
[2025-03-16 17:42:45,146 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:45,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:42:45,159 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes.
[2025-03-16 17:42:45,165 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements.
[2025-03-16 17:42:45,165 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:45,165 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:45,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:42:45,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:42:45,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278385672]
[2025-03-16 17:42:45,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278385672] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 17:42:45,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105239983]
[2025-03-16 17:42:45,282 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:45,282 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:45,282 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 17:42:45,284 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 17:42:45,285 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-16 17:42:45,342 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes.
[2025-03-16 17:42:45,367 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements.
[2025-03-16 17:42:45,367 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:45,367 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:45,369 INFO  L256         TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-16 17:42:45,372 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 17:42:45,415 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:42:45,415 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-16 17:42:45,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:42:45,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [105239983] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-16 17:42:45,442 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-16 17:42:45,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4
[2025-03-16 17:42:45,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824661634]
[2025-03-16 17:42:45,443 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-16 17:42:45,443 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 17:42:45,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:42:45,443 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 17:42:45,444 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-16 17:42:45,444 INFO  L87              Difference]: Start difference. First operand 19 states and 23 transitions. Second operand  has 5 states, 5 states have (on average 3.2) 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-03-16 17:42:45,459 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:42:45,459 INFO  L93              Difference]: Finished difference Result 30 states and 37 transitions.
[2025-03-16 17:42:45,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 17:42:45,460 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.2) 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 10
[2025-03-16 17:42:45,461 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:42:45,461 INFO  L225             Difference]: With dead ends: 30
[2025-03-16 17:42:45,461 INFO  L226             Difference]: Without dead ends: 21
[2025-03-16 17:42:45,461 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-16 17:42:45,461 INFO  L435           NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 17:42:45,462 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 43 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 17:42:45,462 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2025-03-16 17:42:45,463 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2025-03-16 17:42:45,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-03-16 17:42:45,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions.
[2025-03-16 17:42:45,466 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10
[2025-03-16 17:42:45,466 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:42:45,467 INFO  L471      AbstractCegarLoop]: Abstraction has 21 states and 25 transitions.
[2025-03-16 17:42:45,467 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 3.2) 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-03-16 17:42:45,467 INFO  L276                IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions.
[2025-03-16 17:42:45,467 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-03-16 17:42:45,467 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:42:45,467 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:42:45,474 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-16 17:42:45,668 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:45,668 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:42:45,668 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:42:45,668 INFO  L85        PathProgramCache]: Analyzing trace with hash -659128076, now seen corresponding path program 1 times
[2025-03-16 17:42:45,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:42:45,669 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954328612]
[2025-03-16 17:42:45,669 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:45,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:42:45,679 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-03-16 17:42:45,693 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-03-16 17:42:45,693 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:45,694 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:45,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-16 17:42:45,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:42:45,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954328612]
[2025-03-16 17:42:45,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954328612] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 17:42:45,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732839620]
[2025-03-16 17:42:45,823 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:45,823 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:45,823 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 17:42:45,826 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 17:42:45,828 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-16 17:42:45,884 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-03-16 17:42:45,911 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-03-16 17:42:45,911 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:45,911 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:45,912 INFO  L256         TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-16 17:42:45,914 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 17:42:45,938 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-16 17:42:45,938 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 17:42:45,938 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [732839620] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 17:42:45,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 17:42:45,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4
[2025-03-16 17:42:45,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665574611]
[2025-03-16 17:42:45,939 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 17:42:45,939 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 17:42:45,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:42:45,939 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 17:42:45,940 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 17:42:45,940 INFO  L87              Difference]: Start difference. First operand 21 states and 25 transitions. Second operand  has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-03-16 17:42:45,953 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:42:45,953 INFO  L93              Difference]: Finished difference Result 30 states and 36 transitions.
[2025-03-16 17:42:45,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 17:42:45,954 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-03-16 17:42:45,954 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:42:45,955 INFO  L225             Difference]: With dead ends: 30
[2025-03-16 17:42:45,955 INFO  L226             Difference]: Without dead ends: 27
[2025-03-16 17:42:45,955 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 17:42:45,955 INFO  L435           NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 39 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-03-16 17:42:45,956 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 39 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 17:42:45,956 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2025-03-16 17:42:45,957 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22.
[2025-03-16 17:42:45,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-03-16 17:42:45,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions.
[2025-03-16 17:42:45,960 INFO  L78                 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15
[2025-03-16 17:42:45,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:42:45,961 INFO  L471      AbstractCegarLoop]: Abstraction has 22 states and 26 transitions.
[2025-03-16 17:42:45,961 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-03-16 17:42:45,961 INFO  L276                IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions.
[2025-03-16 17:42:45,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2025-03-16 17:42:45,962 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:42:45,962 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:42:45,968 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-16 17:42:46,162 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3
[2025-03-16 17:42:46,162 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:42:46,163 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:42:46,163 INFO  L85        PathProgramCache]: Analyzing trace with hash 825756585, now seen corresponding path program 1 times
[2025-03-16 17:42:46,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:42:46,163 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434914663]
[2025-03-16 17:42:46,163 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:46,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:42:46,175 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes.
[2025-03-16 17:42:46,183 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements.
[2025-03-16 17:42:46,183 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:46,183 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:46,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-16 17:42:46,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:42:46,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434914663]
[2025-03-16 17:42:46,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434914663] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 17:42:46,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405632078]
[2025-03-16 17:42:46,259 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:46,259 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:46,259 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 17:42:46,263 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 17:42:46,264 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-16 17:42:46,322 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes.
[2025-03-16 17:42:46,343 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements.
[2025-03-16 17:42:46,343 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:46,343 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:46,344 INFO  L256         TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-16 17:42:46,346 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 17:42:46,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-16 17:42:46,374 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-16 17:42:46,404 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-16 17:42:46,405 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405632078] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-16 17:42:46,405 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-16 17:42:46,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2025-03-16 17:42:46,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036408900]
[2025-03-16 17:42:46,405 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-16 17:42:46,405 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-16 17:42:46,405 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:42:46,405 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-16 17:42:46,406 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-16 17:42:46,406 INFO  L87              Difference]: Start difference. First operand 22 states and 26 transitions. Second operand  has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-03-16 17:42:46,431 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:42:46,431 INFO  L93              Difference]: Finished difference Result 31 states and 37 transitions.
[2025-03-16 17:42:46,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 17:42:46,433 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 18
[2025-03-16 17:42:46,433 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:42:46,433 INFO  L225             Difference]: With dead ends: 31
[2025-03-16 17:42:46,433 INFO  L226             Difference]: Without dead ends: 28
[2025-03-16 17:42:46,433 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-16 17:42:46,434 INFO  L435           NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 17:42:46,434 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 62 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 17:42:46,434 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2025-03-16 17:42:46,436 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2025-03-16 17:42:46,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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-03-16 17:42:46,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions.
[2025-03-16 17:42:46,436 INFO  L78                 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18
[2025-03-16 17:42:46,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:42:46,436 INFO  L471      AbstractCegarLoop]: Abstraction has 28 states and 34 transitions.
[2025-03-16 17:42:46,438 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-03-16 17:42:46,439 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions.
[2025-03-16 17:42:46,439 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-03-16 17:42:46,439 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:42:46,439 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:42:46,445 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-16 17:42:46,639 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:46,640 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:42:46,640 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:42:46,640 INFO  L85        PathProgramCache]: Analyzing trace with hash -1138456364, now seen corresponding path program 2 times
[2025-03-16 17:42:46,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:42:46,640 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425367071]
[2025-03-16 17:42:46,640 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-16 17:42:46,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:42:46,655 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes.
[2025-03-16 17:42:46,661 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements.
[2025-03-16 17:42:46,661 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-16 17:42:46,661 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:46,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-16 17:42:46,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:42:46,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425367071]
[2025-03-16 17:42:46,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425367071] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 17:42:46,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 17:42:46,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 17:42:46,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356290134]
[2025-03-16 17:42:46,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 17:42:46,846 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 17:42:46,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:42:46,847 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 17:42:46,847 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 17:42:46,847 INFO  L87              Difference]: Start difference. First operand 28 states and 34 transitions. Second operand  has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-03-16 17:42:46,877 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:42:46,878 INFO  L93              Difference]: Finished difference Result 39 states and 47 transitions.
[2025-03-16 17:42:46,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 17:42:46,878 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 21
[2025-03-16 17:42:46,878 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:42:46,878 INFO  L225             Difference]: With dead ends: 39
[2025-03-16 17:42:46,879 INFO  L226             Difference]: Without dead ends: 28
[2025-03-16 17:42:46,879 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-16 17:42:46,880 INFO  L435           NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 17:42:46,881 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 67 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 17:42:46,881 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2025-03-16 17:42:46,883 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2025-03-16 17:42:46,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-03-16 17:42:46,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions.
[2025-03-16 17:42:46,884 INFO  L78                 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 21
[2025-03-16 17:42:46,884 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:42:46,884 INFO  L471      AbstractCegarLoop]: Abstraction has 28 states and 32 transitions.
[2025-03-16 17:42:46,884 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-03-16 17:42:46,884 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions.
[2025-03-16 17:42:46,884 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-03-16 17:42:46,884 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:42:46,884 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:42:46,884 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 17:42:46,884 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:42:46,887 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:42:46,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 368049470, now seen corresponding path program 1 times
[2025-03-16 17:42:46,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:42:46,887 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279711714]
[2025-03-16 17:42:46,887 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:46,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:42:46,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-03-16 17:42:46,914 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-16 17:42:46,914 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:46,914 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:47,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-16 17:42:47,714 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:42:47,715 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279711714]
[2025-03-16 17:42:47,715 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279711714] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 17:42:47,715 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72346395]
[2025-03-16 17:42:47,715 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:47,715 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:47,715 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 17:42:47,717 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 17:42:47,719 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-16 17:42:47,791 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-03-16 17:42:47,834 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-16 17:42:47,834 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:47,834 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:47,836 INFO  L256         TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 23 conjuncts are in the unsatisfiable core
[2025-03-16 17:42:47,837 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 17:42:47,886 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33
[2025-03-16 17:42:47,891 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25
[2025-03-16 17:42:47,922 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19
[2025-03-16 17:42:47,926 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2025-03-16 17:42:47,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-16 17:42:47,943 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 17:42:47,943 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [72346395] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 17:42:47,943 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 17:42:47,943 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16
[2025-03-16 17:42:47,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394633220]
[2025-03-16 17:42:47,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 17:42:47,944 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 17:42:47,944 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:42:47,945 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 17:42:47,945 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240
[2025-03-16 17:42:47,945 INFO  L87              Difference]: Start difference. First operand 28 states and 32 transitions. Second operand  has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-03-16 17:42:47,987 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:42:47,988 INFO  L93              Difference]: Finished difference Result 44 states and 51 transitions.
[2025-03-16 17:42:47,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 17:42:47,988 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 27
[2025-03-16 17:42:47,988 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:42:47,989 INFO  L225             Difference]: With dead ends: 44
[2025-03-16 17:42:47,989 INFO  L226             Difference]: Without dead ends: 32
[2025-03-16 17:42:47,990 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272
[2025-03-16 17:42:47,991 INFO  L435           NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 17:42:47,991 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 17:42:47,991 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-03-16 17:42:47,993 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-03-16 17:42:47,993 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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-03-16 17:42:47,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions.
[2025-03-16 17:42:47,994 INFO  L78                 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 27
[2025-03-16 17:42:47,994 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:42:47,994 INFO  L471      AbstractCegarLoop]: Abstraction has 32 states and 36 transitions.
[2025-03-16 17:42:47,994 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-03-16 17:42:47,994 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions.
[2025-03-16 17:42:47,994 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-03-16 17:42:47,994 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:42:47,994 INFO  L218           NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:42:48,001 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-16 17:42:48,195 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:48,195 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:42:48,196 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:42:48,196 INFO  L85        PathProgramCache]: Analyzing trace with hash 1702822528, now seen corresponding path program 1 times
[2025-03-16 17:42:48,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:42:48,196 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465795705]
[2025-03-16 17:42:48,196 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:48,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:42:48,213 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-03-16 17:42:48,223 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-03-16 17:42:48,223 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:48,223 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:48,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-16 17:42:48,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:42:48,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465795705]
[2025-03-16 17:42:48,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465795705] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 17:42:48,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233376468]
[2025-03-16 17:42:48,598 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:42:48,598 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:48,598 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 17:42:48,601 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 17:42:48,602 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-16 17:42:48,678 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-03-16 17:42:48,865 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-03-16 17:42:48,865 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:42:48,865 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:48,867 INFO  L256         TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 75 conjuncts are in the unsatisfiable core
[2025-03-16 17:42:48,870 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 17:42:49,065 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2025-03-16 17:42:49,070 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2025-03-16 17:42:49,149 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18
[2025-03-16 17:42:49,200 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2025-03-16 17:42:49,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-16 17:42:49,231 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-16 17:42:49,319 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37
[2025-03-16 17:42:49,324 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-16 17:42:49,325 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-16 17:42:49,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-16 17:42:49,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [233376468] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-16 17:42:49,393 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-16 17:42:49,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 30
[2025-03-16 17:42:49,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110015281]
[2025-03-16 17:42:49,393 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-16 17:42:49,394 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2025-03-16 17:42:49,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:42:49,395 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2025-03-16 17:42:49,395 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870
[2025-03-16 17:42:49,396 INFO  L87              Difference]: Start difference. First operand 32 states and 36 transitions. Second operand  has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 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-03-16 17:42:49,581 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:42:49,581 INFO  L93              Difference]: Finished difference Result 56 states and 64 transitions.
[2025-03-16 17:42:49,581 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-16 17:42:49,581 INFO  L78                 Accepts]: Start accepts. Automaton has  has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 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) Word has length 31
[2025-03-16 17:42:49,582 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:42:49,582 INFO  L225             Difference]: With dead ends: 56
[2025-03-16 17:42:49,582 INFO  L226             Difference]: Without dead ends: 39
[2025-03-16 17:42:49,582 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056
[2025-03-16 17:42:49,583 INFO  L435           NwaCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 17:42:49,583 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 76 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 17:42:49,583 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2025-03-16 17:42:49,586 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39.
[2025-03-16 17:42:49,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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-03-16 17:42:49,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions.
[2025-03-16 17:42:49,587 INFO  L78                 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 31
[2025-03-16 17:42:49,587 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:42:49,587 INFO  L471      AbstractCegarLoop]: Abstraction has 39 states and 44 transitions.
[2025-03-16 17:42:49,587 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 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-03-16 17:42:49,587 INFO  L276                IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions.
[2025-03-16 17:42:49,587 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-03-16 17:42:49,587 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:42:49,588 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:42:49,595 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-03-16 17:42:49,789 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:49,789 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:42:49,789 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:42:49,789 INFO  L85        PathProgramCache]: Analyzing trace with hash 1765830401, now seen corresponding path program 2 times
[2025-03-16 17:42:49,789 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:42:49,789 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036866003]
[2025-03-16 17:42:49,789 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-16 17:42:49,789 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:42:49,803 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes.
[2025-03-16 17:42:49,823 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements.
[2025-03-16 17:42:49,823 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-16 17:42:49,823 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:50,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-03-16 17:42:50,512 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:42:50,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036866003]
[2025-03-16 17:42:50,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036866003] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 17:42:50,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795587679]
[2025-03-16 17:42:50,512 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-16 17:42:50,513 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:50,513 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 17:42:50,514 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 17:42:50,516 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-16 17:42:50,588 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes.
[2025-03-16 17:42:50,628 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements.
[2025-03-16 17:42:50,628 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-16 17:42:50,628 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:50,631 INFO  L256         TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 109 conjuncts are in the unsatisfiable core
[2025-03-16 17:42:50,634 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 17:42:50,662 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2025-03-16 17:42:50,699 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15
[2025-03-16 17:42:50,704 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15
[2025-03-16 17:42:50,815 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2025-03-16 17:42:50,815 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2025-03-16 17:42:50,879 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 17
[2025-03-16 17:42:50,887 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16
[2025-03-16 17:42:50,899 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27
[2025-03-16 17:42:50,910 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15
[2025-03-16 17:42:50,976 INFO  L349             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2025-03-16 17:42:50,976 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60
[2025-03-16 17:42:50,982 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49
[2025-03-16 17:42:51,405 INFO  L349             Elim1Store]: treesize reduction 30, result has 9.1 percent of original size
[2025-03-16 17:42:51,406 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 45
[2025-03-16 17:42:51,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-03-16 17:42:51,475 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-16 17:42:51,649 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64
[2025-03-16 17:42:51,651 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48
[2025-03-16 17:42:51,768 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-16 17:42:51,768 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 106
[2025-03-16 17:42:51,776 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-16 17:42:51,776 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 86
[2025-03-16 17:42:51,795 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-16 17:42:51,796 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 126
[2025-03-16 17:42:51,804 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-16 17:42:51,804 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 86
[2025-03-16 17:42:52,557 INFO  L349             Elim1Store]: treesize reduction 651, result has 11.1 percent of original size
[2025-03-16 17:42:52,558 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 585 treesize of output 450
[2025-03-16 17:42:52,580 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-16 17:42:52,580 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 449 treesize of output 409
[2025-03-16 17:42:52,606 INFO  L349             Elim1Store]: treesize reduction 8, result has 79.5 percent of original size
[2025-03-16 17:42:52,606 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 715 treesize of output 688
[2025-03-16 17:42:52,634 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 422 treesize of output 410
[2025-03-16 17:42:52,652 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 366 treesize of output 348
[2025-03-16 17:42:52,693 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-16 17:42:52,693 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 500 treesize of output 466
[2025-03-16 17:42:52,750 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17
[2025-03-16 17:42:52,773 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2025-03-16 17:42:52,781 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-16 17:42:52,840 INFO  L349             Elim1Store]: treesize reduction 436, result has 22.4 percent of original size
[2025-03-16 17:42:52,840 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1822 treesize of output 1533
[2025-03-16 17:42:52,866 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-16 17:42:52,867 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 884 treesize of output 694
[2025-03-16 17:42:52,887 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-16 17:42:52,887 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 652 treesize of output 592
[2025-03-16 17:42:52,914 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-16 17:42:52,914 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 530 treesize of output 498
[2025-03-16 17:42:52,942 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 278
[2025-03-16 17:42:52,968 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-16 17:42:52,968 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 72
[2025-03-16 17:42:52,990 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 226
[2025-03-16 17:42:53,052 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17
[2025-03-16 17:42:53,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-03-16 17:42:53,181 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [795587679] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-16 17:42:53,181 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-16 17:42:53,181 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 40
[2025-03-16 17:42:53,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238833704]
[2025-03-16 17:42:53,182 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-16 17:42:53,182 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 41 states
[2025-03-16 17:42:53,182 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:42:53,182 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2025-03-16 17:42:53,183 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1468, Unknown=36, NotChecked=0, Total=1640
[2025-03-16 17:42:53,183 INFO  L87              Difference]: Start difference. First operand 39 states and 44 transitions. Second operand  has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 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-03-16 17:42:54,099 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:42:54,100 INFO  L93              Difference]: Finished difference Result 83 states and 94 transitions.
[2025-03-16 17:42:54,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-03-16 17:42:54,100 INFO  L78                 Accepts]: Start accepts. Automaton has  has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 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 33
[2025-03-16 17:42:54,101 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:42:54,102 INFO  L225             Difference]: With dead ends: 83
[2025-03-16 17:42:54,102 INFO  L226             Difference]: Without dead ends: 50
[2025-03-16 17:42:54,103 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=223, Invalid=2182, Unknown=45, NotChecked=0, Total=2450
[2025-03-16 17:42:54,103 INFO  L435           NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-16 17:42:54,103 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 182 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-16 17:42:54,103 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2025-03-16 17:42:54,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44.
[2025-03-16 17:42:54,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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-03-16 17:42:54,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions.
[2025-03-16 17:42:54,111 INFO  L78                 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 33
[2025-03-16 17:42:54,111 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:42:54,111 INFO  L471      AbstractCegarLoop]: Abstraction has 44 states and 50 transitions.
[2025-03-16 17:42:54,111 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 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-03-16 17:42:54,112 INFO  L276                IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions.
[2025-03-16 17:42:54,113 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2025-03-16 17:42:54,113 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:42:54,113 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:42:54,120 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-16 17:42:54,313 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:54,314 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:42:54,314 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:42:54,314 INFO  L85        PathProgramCache]: Analyzing trace with hash 1258389304, now seen corresponding path program 3 times
[2025-03-16 17:42:54,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:42:54,314 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000431368]
[2025-03-16 17:42:54,314 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-16 17:42:54,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:42:54,331 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes.
[2025-03-16 17:42:54,346 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 36 of 38 statements.
[2025-03-16 17:42:54,347 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-03-16 17:42:54,347 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:54,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2025-03-16 17:42:54,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:42:54,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000431368]
[2025-03-16 17:42:54,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000431368] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 17:42:54,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142266776]
[2025-03-16 17:42:54,409 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-16 17:42:54,409 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:54,410 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 17:42:54,412 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 17:42:54,414 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-16 17:42:54,505 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes.
[2025-03-16 17:42:54,726 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 36 of 38 statements.
[2025-03-16 17:42:54,726 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-03-16 17:42:54,726 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:42:54,728 INFO  L256         TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-16 17:42:54,729 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 17:42:54,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2025-03-16 17:42:54,749 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 17:42:54,749 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142266776] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 17:42:54,749 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 17:42:54,750 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5
[2025-03-16 17:42:54,750 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004335823]
[2025-03-16 17:42:54,750 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 17:42:54,750 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 17:42:54,750 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:42:54,750 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 17:42:54,750 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-16 17:42:54,750 INFO  L87              Difference]: Start difference. First operand 44 states and 50 transitions. Second operand  has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-03-16 17:42:54,760 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:42:54,760 INFO  L93              Difference]: Finished difference Result 44 states and 50 transitions.
[2025-03-16 17:42:54,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 17:42:54,761 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 38
[2025-03-16 17:42:54,761 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:42:54,761 INFO  L225             Difference]: With dead ends: 44
[2025-03-16 17:42:54,761 INFO  L226             Difference]: Without dead ends: 0
[2025-03-16 17:42:54,761 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-16 17:42:54,761 INFO  L435           NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 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-03-16 17:42:54,762 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 17:42:54,762 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-16 17:42:54,762 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-16 17:42:54,762 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-03-16 17:42:54,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-16 17:42:54,762 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38
[2025-03-16 17:42:54,762 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:42:54,762 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-16 17:42:54,762 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-03-16 17:42:54,762 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-16 17:42:54,762 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-16 17:42:54,764 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-16 17:42:54,773 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-03-16 17:42:54,966 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:42:54,968 INFO  L422         BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1]
[2025-03-16 17:42:54,969 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-16 17:42:55,173 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-16 17:42:55,179 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
[2025-03-16 17:42:55,179 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
[2025-03-16 17:42:55,179 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
[2025-03-16 17:42:55,180 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
[2025-03-16 17:42:55,181 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
[2025-03-16 17:42:55,182 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
[2025-03-16 17:42:55,182 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]]
[2025-03-16 17:42:55,182 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset
[2025-03-16 17:42:55,182 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,182 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,182 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]]
[2025-03-16 17:42:55,183 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
[2025-03-16 17:42:55,183 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
[2025-03-16 17:42:55,183 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
[2025-03-16 17:42:55,183 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0
[2025-03-16 17:42:55,183 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base
[2025-03-16 17:42:55,183 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~last~0!base,<LOCAL,dll_remove_last>]]],[IntegerLiteral[4]]]]]
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]]
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]]
[2025-03-16 17:42:55,184 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~last~0!base,<LOCAL,dll_remove_last>]]]
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!offset
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]]
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~last~0!base,<LOCAL,dll_remove_last>]]]
[2025-03-16 17:42:55,185 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]]
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]]
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!base
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
[2025-03-16 17:42:55,186 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~last~0!base,<LOCAL,dll_remove_last>]]]
[2025-03-16 17:42:55,187 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0
[2025-03-16 17:42:55,187 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
[2025-03-16 17:42:55,187 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
[2025-03-16 17:42:55,187 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
[2025-03-16 17:42:55,187 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base
[2025-03-16 17:42:55,187 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]
[2025-03-16 17:42:55,187 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
[2025-03-16 17:42:55,188 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,188 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,188 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]]
[2025-03-16 17:42:55,188 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid
[2025-03-16 17:42:55,188 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL]
[2025-03-16 17:42:55,188 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
[2025-03-16 17:42:55,188 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
[2025-03-16 17:42:55,188 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]]
[2025-03-16 17:42:55,188 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
[2025-03-16 17:42:55,188 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]]
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]]
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,189 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]]
[2025-03-16 17:42:55,190 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
[2025-03-16 17:42:55,190 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
[2025-03-16 17:42:55,190 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]],[IntegerLiteral[4]]]]]
[2025-03-16 17:42:55,190 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
[2025-03-16 17:42:55,190 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
[2025-03-16 17:42:55,190 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]],[IntegerLiteral[4]]]]]
[2025-03-16 17:42:55,190 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset
[2025-03-16 17:42:55,190 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset
[2025-03-16 17:42:55,192 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:42:55 BoogieIcfgContainer
[2025-03-16 17:42:55,192 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-16 17:42:55,192 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-16 17:42:55,192 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-16 17:42:55,192 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-16 17:42:55,193 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:42:44" (3/4) ...
[2025-03-16 17:42:55,194 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-16 17:42:55,198 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure myexit
[2025-03-16 17:42:55,204 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-03-16 17:42:55,204 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2025-03-16 17:42:55,204 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-16 17:42:55,204 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-16 17:42:55,264 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-16 17:42:55,264 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-16 17:42:55,264 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-16 17:42:55,265 INFO  L158              Benchmark]: Toolchain (without parser) took 11206.57ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 113.5MB in the beginning and 208.5MB in the end (delta: -95.0MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB.
[2025-03-16 17:42:55,265 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-16 17:42:55,265 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 325.78ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 95.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-16 17:42:55,265 INFO  L158              Benchmark]: Boogie Procedure Inliner took 31.47ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-16 17:42:55,265 INFO  L158              Benchmark]: Boogie Preprocessor took 32.82ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-16 17:42:55,265 INFO  L158              Benchmark]: IcfgBuilder took 257.65ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 76.5MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-16 17:42:55,265 INFO  L158              Benchmark]: TraceAbstraction took 10482.17ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 76.0MB in the beginning and 216.9MB in the end (delta: -140.8MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB.
[2025-03-16 17:42:55,266 INFO  L158              Benchmark]: Witness Printer took 71.77ms. Allocated memory is still 352.3MB. Free memory was 216.9MB in the beginning and 208.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-16 17:42:55,266 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.13ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 325.78ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 95.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 31.47ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 32.82ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 257.65ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 76.5MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 10482.17ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 76.0MB in the beginning and 216.9MB in the end (delta: -140.8MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB.
 * Witness Printer took 71.77ms. Allocated memory is still 352.3MB. Free memory was 216.9MB in the beginning and 208.5MB 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.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~#s~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~#s~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~i~0
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~last~0!base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~last~0!base,<LOCAL,dll_remove_last>]]],[IntegerLiteral[4]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~#s~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~last~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~last~0!base,<LOCAL,dll_remove_last>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~last~0!base,<LOCAL,dll_remove_last>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~i~0
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~#s~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~last~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]],[IntegerLiteral[0]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~last~0!base,<LOCAL,dll_remove_last>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~i~0
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #valid
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~#s~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~head~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~#s~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~head~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~head~0!base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]],[IntegerLiteral[4]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,<LOCAL,dll_create>]]],[IntegerLiteral[4]]]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~#s~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~head~0!offset
 * 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: 630]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 22 locations, 30 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 608 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 457 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 901 IncrementalHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 151 mSDtfsCounter, 901 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 212 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=9, InterpolantAutomatonStates: 73, 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, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 380 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 451 ConstructedInterpolants, 7 QuantifiedInterpolants, 5106 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1797 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 281/346 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
    1 specifications checked. All of them hold
  - InvariantResult [Line: 587]: Location Invariant
    Derived location invariant: ((((len == 2) && (len == 1)) || ((2 == len) && (len == 2))) || ((len <= 0) && (len == 2)))
RESULT: Ultimate proved your program to be correct!
[2025-03-16 17:42:55,287 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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