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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7
[2025-02-05 14:40:36,091 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 14:40:36,100 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 14:40:36,102 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 14:40:36,103 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 14:40:36,104 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 14:40:36,105 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i
[2025-02-05 14:40:37,455 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ebd757e6a/6f10d88ba00e43bd913cbad9b705c881/FLAG508d3a159
[2025-02-05 14:40:37,812 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 14:40:37,813 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i
[2025-02-05 14:40:37,832 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ebd757e6a/6f10d88ba00e43bd913cbad9b705c881/FLAG508d3a159
[2025-02-05 14:40:38,042 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ebd757e6a/6f10d88ba00e43bd913cbad9b705c881
[2025-02-05 14:40:38,045 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 14:40:38,047 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 14:40:38,048 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 14:40:38,048 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 14:40:38,056 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 14:40:38,057 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,058 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63056e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38, skipping insertion in model container
[2025-02-05 14:40:38,058 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,095 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 14:40:38,426 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885]
[2025-02-05 14:40:38,431 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 14:40:38,444 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 14:40:38,497 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885]
[2025-02-05 14:40:38,499 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 14:40:38,529 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 14:40:38,530 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38 WrapperNode
[2025-02-05 14:40:38,531 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 14:40:38,533 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 14:40:38,533 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 14:40:38,533 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 14:40:38,539 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,554 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,581 INFO  L138                Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 163
[2025-02-05 14:40:38,582 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 14:40:38,582 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 14:40:38,582 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 14:40:38,582 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 14:40:38,591 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,591 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,594 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,613 INFO  L175           MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 10, 18]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9].
[2025-02-05 14:40:38,614 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,614 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,622 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,623 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,627 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,628 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,631 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 14:40:38,632 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 14:40:38,632 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 14:40:38,632 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 14:40:38,633 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (1/1) ...
[2025-02-05 14:40:38,639 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 14:40:38,650 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 14:40:38,665 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 14:40:38,669 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 14:40:38,693 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-02-05 14:40:38,693 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-02-05 14:40:38,693 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-02-05 14:40:38,693 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-02-05 14:40:38,693 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-02-05 14:40:38,693 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-02-05 14:40:38,693 INFO  L130     BoogieDeclarations]: Found specification of procedure node_create
[2025-02-05 14:40:38,694 INFO  L138     BoogieDeclarations]: Found implementation of procedure node_create
[2025-02-05 14:40:38,694 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-02-05 14:40:38,694 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 14:40:38,694 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-02-05 14:40:38,694 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2025-02-05 14:40:38,694 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2025-02-05 14:40:38,694 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#2
[2025-02-05 14:40:38,695 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2025-02-05 14:40:38,695 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2025-02-05 14:40:38,695 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#2
[2025-02-05 14:40:38,695 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-02-05 14:40:38,695 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0
[2025-02-05 14:40:38,695 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1
[2025-02-05 14:40:38,695 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2
[2025-02-05 14:40:38,695 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 14:40:38,695 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-02-05 14:40:38,695 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2025-02-05 14:40:38,695 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 14:40:38,695 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 14:40:38,821 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 14:40:38,823 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 14:40:39,081 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L631: 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-02-05 14:40:39,107 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true;
[2025-02-05 14:40:39,129 INFO  L?                        ?]: Removed 55 outVars from TransFormulas that were not future-live.
[2025-02-05 14:40:39,129 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 14:40:39,138 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 14:40:39,138 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 14:40:39,139 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:40:39 BoogieIcfgContainer
[2025-02-05 14:40:39,139 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 14:40:39,141 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 14:40:39,141 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 14:40:39,145 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 14:40:39,146 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:40:38" (1/3) ...
[2025-02-05 14:40:39,146 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d808e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:40:39, skipping insertion in model container
[2025-02-05 14:40:39,147 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:38" (2/3) ...
[2025-02-05 14:40:39,147 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d808e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:40:39, skipping insertion in model container
[2025-02-05 14:40:39,147 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:40:39" (3/3) ...
[2025-02-05 14:40:39,148 INFO  L128   eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i
[2025-02-05 14:40:39,163 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 14:40:39,165 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_unequal.i that has 2 procedures, 38 locations, 1 initial locations, 5 loop locations, and 1 error locations.
[2025-02-05 14:40:39,224 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 14:40:39,236 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;@2d721b13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 14:40:39,237 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 14:40:39,242 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-05 14:40:39,248 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-02-05 14:40:39,248 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 14:40:39,249 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 14:40:39,249 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 14:40:39,254 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 14:40:39,254 INFO  L85        PathProgramCache]: Analyzing trace with hash 167541747, now seen corresponding path program 1 times
[2025-02-05 14:40:39,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 14:40:39,262 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124042214]
[2025-02-05 14:40:39,262 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:40:39,265 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 14:40:39,371 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-02-05 14:40:39,413 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-02-05 14:40:39,415 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:40:39,415 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:40:39,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-02-05 14:40:39,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 14:40:39,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124042214]
[2025-02-05 14:40:39,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124042214] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 14:40:39,714 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 14:40:39,714 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 14:40:39,715 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438015374]
[2025-02-05 14:40:39,716 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 14:40:39,719 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 14:40:39,720 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 14:40:39,739 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 14:40:39,740 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 14:40:39,742 INFO  L87              Difference]: Start difference. First operand  has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-02-05 14:40:39,780 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 14:40:39,781 INFO  L93              Difference]: Finished difference Result 72 states and 103 transitions.
[2025-02-05 14:40:39,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 14:40:39,785 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24
[2025-02-05 14:40:39,785 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 14:40:39,791 INFO  L225             Difference]: With dead ends: 72
[2025-02-05 14:40:39,791 INFO  L226             Difference]: Without dead ends: 34
[2025-02-05 14:40:39,795 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 14:40:39,800 INFO  L435           NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 14:40:39,803 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 14:40:39,818 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2025-02-05 14:40:39,833 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32.
[2025-02-05 14:40:39,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-05 14:40:39,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions.
[2025-02-05 14:40:39,845 INFO  L78                 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 24
[2025-02-05 14:40:39,846 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 14:40:39,848 INFO  L471      AbstractCegarLoop]: Abstraction has 32 states and 42 transitions.
[2025-02-05 14:40:39,849 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-02-05 14:40:39,849 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions.
[2025-02-05 14:40:39,850 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-02-05 14:40:39,850 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 14:40:39,850 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 14:40:39,851 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 14:40:39,851 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 14:40:39,851 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 14:40:39,851 INFO  L85        PathProgramCache]: Analyzing trace with hash 1424128241, now seen corresponding path program 1 times
[2025-02-05 14:40:39,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 14:40:39,851 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756186499]
[2025-02-05 14:40:39,851 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:40:39,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 14:40:39,893 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-05 14:40:39,941 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-05 14:40:39,942 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:40:39,942 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:40:40,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-02-05 14:40:40,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 14:40:40,024 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756186499]
[2025-02-05 14:40:40,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756186499] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 14:40:40,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 14:40:40,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 14:40:40,025 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676493472]
[2025-02-05 14:40:40,025 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 14:40:40,026 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 14:40:40,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 14:40:40,027 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 14:40:40,028 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 14:40:40,028 INFO  L87              Difference]: Start difference. First operand 32 states and 42 transitions. Second operand  has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-05 14:40:40,047 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 14:40:40,047 INFO  L93              Difference]: Finished difference Result 46 states and 62 transitions.
[2025-02-05 14:40:40,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 14:40:40,049 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32
[2025-02-05 14:40:40,050 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 14:40:40,050 INFO  L225             Difference]: With dead ends: 46
[2025-02-05 14:40:40,050 INFO  L226             Difference]: Without dead ends: 34
[2025-02-05 14:40:40,051 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 14:40:40,051 INFO  L435           NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 14:40:40,052 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 14:40:40,052 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2025-02-05 14:40:40,058 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2025-02-05 14:40:40,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-05 14:40:40,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions.
[2025-02-05 14:40:40,060 INFO  L78                 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32
[2025-02-05 14:40:40,060 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 14:40:40,060 INFO  L471      AbstractCegarLoop]: Abstraction has 34 states and 45 transitions.
[2025-02-05 14:40:40,061 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-05 14:40:40,061 INFO  L276                IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions.
[2025-02-05 14:40:40,061 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-02-05 14:40:40,061 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 14:40:40,061 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 14:40:40,062 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 14:40:40,062 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 14:40:40,062 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 14:40:40,062 INFO  L85        PathProgramCache]: Analyzing trace with hash 483560687, now seen corresponding path program 1 times
[2025-02-05 14:40:40,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 14:40:40,062 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551584759]
[2025-02-05 14:40:40,063 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:40:40,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 14:40:40,093 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-02-05 14:40:40,140 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-02-05 14:40:40,140 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:40:40,140 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:40:42,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 14:40:42,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 14:40:42,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551584759]
[2025-02-05 14:40:42,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551584759] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 14:40:42,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605516927]
[2025-02-05 14:40:42,108 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:40:42,108 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 14:40:42,108 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 14:40:42,113 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 14:40:42,115 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 14:40:42,228 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-02-05 14:40:42,514 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-02-05 14:40:42,514 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:40:42,514 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:40:42,520 INFO  L256         TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 95 conjuncts are in the unsatisfiable core
[2025-02-05 14:40:42,530 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 14:40:42,631 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-02-05 14:40:42,913 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 11 treesize of output 7
[2025-02-05 14:40:43,032 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2025-02-05 14:40:43,033 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2025-02-05 14:40:43,131 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 23 treesize of output 11
[2025-02-05 14:40:43,231 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 16 treesize of output 11
[2025-02-05 14:40:43,502 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 15 treesize of output 7
[2025-02-05 14:40:43,510 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 11 treesize of output 3
[2025-02-05 14:40:43,752 INFO  L349             Elim1Store]: treesize reduction 21, result has 44.7 percent of original size
[2025-02-05 14:40:43,752 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23
[2025-02-05 14:40:43,787 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2025-02-05 14:40:43,788 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 20 treesize of output 22
[2025-02-05 14:40:44,093 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23
[2025-02-05 14:40:44,111 INFO  L349             Elim1Store]: treesize reduction 49, result has 2.0 percent of original size
[2025-02-05 14:40:44,112 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 1
[2025-02-05 14:40:44,187 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 19 treesize of output 11
[2025-02-05 14:40:44,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 14:40:44,278 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 14:40:44,389 WARN  L851   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_241 (Array Int Int)) (v_ArrVal_240 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_241) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_240 (store (select |c_#memory_int#2| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_240 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false
[2025-02-05 14:40:44,413 WARN  L851   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_241 (Array Int Int)) (v_ArrVal_240 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_241) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_240 (store (select |c_#memory_int#2| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_240 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))) is different from false
[2025-02-05 14:40:44,427 WARN  L851   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_241 (Array Int Int)) (v_ArrVal_240 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int)) (or (not (= v_ArrVal_240 (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store (select |c_#memory_int#2| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_240 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_241) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false
[2025-02-05 14:40:44,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605516927] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 14:40:44,569 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-02-05 14:40:44,569 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43
[2025-02-05 14:40:44,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313494109]
[2025-02-05 14:40:44,569 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-02-05 14:40:44,569 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 43 states
[2025-02-05 14:40:44,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 14:40:44,570 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2025-02-05 14:40:44,574 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1925, Unknown=3, NotChecked=270, Total=2352
[2025-02-05 14:40:44,575 INFO  L87              Difference]: Start difference. First operand 34 states and 45 transitions. Second operand  has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-05 14:40:45,960 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 14:40:45,960 INFO  L93              Difference]: Finished difference Result 61 states and 79 transitions.
[2025-02-05 14:40:45,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-02-05 14:40:45,961 INFO  L78                 Accepts]: Start accepts. Automaton has  has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33
[2025-02-05 14:40:45,961 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 14:40:45,962 INFO  L225             Difference]: With dead ends: 61
[2025-02-05 14:40:45,962 INFO  L226             Difference]: Without dead ends: 59
[2025-02-05 14:40:45,964 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=287, Invalid=3382, Unknown=3, NotChecked=360, Total=4032
[2025-02-05 14:40:45,969 INFO  L435           NwaCegarLoop]: 23 mSDtfsCounter, 64 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 14:40:45,969 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 418 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 14:40:45,970 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2025-02-05 14:40:45,978 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44.
[2025-02-05 14:40:45,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-05 14:40:45,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions.
[2025-02-05 14:40:45,983 INFO  L78                 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 33
[2025-02-05 14:40:45,983 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 14:40:45,983 INFO  L471      AbstractCegarLoop]: Abstraction has 44 states and 56 transitions.
[2025-02-05 14:40:45,983 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-05 14:40:45,983 INFO  L276                IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions.
[2025-02-05 14:40:45,984 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2025-02-05 14:40:45,984 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 14:40:45,984 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 14:40:45,997 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 14:40:46,185 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 14:40:46,186 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 14:40:46,186 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 14:40:46,186 INFO  L85        PathProgramCache]: Analyzing trace with hash 1390737585, now seen corresponding path program 2 times
[2025-02-05 14:40:46,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 14:40:46,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373717285]
[2025-02-05 14:40:46,187 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-05 14:40:46,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 14:40:46,206 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes.
[2025-02-05 14:40:46,218 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements.
[2025-02-05 14:40:46,219 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-05 14:40:46,219 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:40:46,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-02-05 14:40:46,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 14:40:46,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373717285]
[2025-02-05 14:40:46,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373717285] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 14:40:46,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 14:40:46,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 14:40:46,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958159587]
[2025-02-05 14:40:46,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 14:40:46,366 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 14:40:46,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 14:40:46,366 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 14:40:46,367 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 14:40:46,367 INFO  L87              Difference]: Start difference. First operand 44 states and 56 transitions. Second operand  has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-02-05 14:40:46,399 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 14:40:46,400 INFO  L93              Difference]: Finished difference Result 60 states and 76 transitions.
[2025-02-05 14:40:46,400 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 14:40:46,400 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34
[2025-02-05 14:40:46,401 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 14:40:46,401 INFO  L225             Difference]: With dead ends: 60
[2025-02-05 14:40:46,401 INFO  L226             Difference]: Without dead ends: 44
[2025-02-05 14:40:46,402 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 14:40:46,402 INFO  L435           NwaCegarLoop]: 37 mSDtfsCounter, 24 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 14:40:46,403 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 115 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 14:40:46,403 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2025-02-05 14:40:46,408 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42.
[2025-02-05 14:40:46,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-05 14:40:46,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions.
[2025-02-05 14:40:46,409 INFO  L78                 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 34
[2025-02-05 14:40:46,410 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 14:40:46,410 INFO  L471      AbstractCegarLoop]: Abstraction has 42 states and 51 transitions.
[2025-02-05 14:40:46,410 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-02-05 14:40:46,410 INFO  L276                IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions.
[2025-02-05 14:40:46,411 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2025-02-05 14:40:46,411 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 14:40:46,411 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 14:40:46,411 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 14:40:46,411 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 14:40:46,412 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 14:40:46,412 INFO  L85        PathProgramCache]: Analyzing trace with hash 2132451156, now seen corresponding path program 1 times
[2025-02-05 14:40:46,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 14:40:46,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522685801]
[2025-02-05 14:40:46,412 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:40:46,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 14:40:46,431 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.
[2025-02-05 14:40:46,439 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements.
[2025-02-05 14:40:46,439 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:40:46,439 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:40:46,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-02-05 14:40:46,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 14:40:46,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522685801]
[2025-02-05 14:40:46,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522685801] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 14:40:46,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272988199]
[2025-02-05 14:40:46,566 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:40:46,566 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 14:40:46,566 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 14:40:46,569 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 14:40:46,571 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 14:40:46,666 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.
[2025-02-05 14:40:46,708 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements.
[2025-02-05 14:40:46,708 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:40:46,708 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:40:46,710 INFO  L256         TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 14:40:46,713 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 14:40:46,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-02-05 14:40:46,742 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 14:40:46,742 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [272988199] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 14:40:46,742 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 14:40:46,742 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5
[2025-02-05 14:40:46,742 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941775003]
[2025-02-05 14:40:46,743 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 14:40:46,743 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 14:40:46,743 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 14:40:46,743 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 14:40:46,743 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 14:40:46,743 INFO  L87              Difference]: Start difference. First operand 42 states and 51 transitions. Second operand  has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-02-05 14:40:46,765 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 14:40:46,766 INFO  L93              Difference]: Finished difference Result 58 states and 71 transitions.
[2025-02-05 14:40:46,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 14:40:46,766 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34
[2025-02-05 14:40:46,767 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 14:40:46,767 INFO  L225             Difference]: With dead ends: 58
[2025-02-05 14:40:46,767 INFO  L226             Difference]: Without dead ends: 43
[2025-02-05 14:40:46,768 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 14:40:46,768 INFO  L435           NwaCegarLoop]: 38 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 14:40:46,768 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 14:40:46,769 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2025-02-05 14:40:46,775 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41.
[2025-02-05 14:40:46,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-05 14:40:46,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions.
[2025-02-05 14:40:46,776 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 34
[2025-02-05 14:40:46,776 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 14:40:46,776 INFO  L471      AbstractCegarLoop]: Abstraction has 41 states and 49 transitions.
[2025-02-05 14:40:46,776 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-02-05 14:40:46,777 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions.
[2025-02-05 14:40:46,777 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-02-05 14:40:46,777 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 14:40:46,777 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 14:40:46,786 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 14:40:46,978 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 14:40:46,978 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 14:40:46,978 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 14:40:46,978 INFO  L85        PathProgramCache]: Analyzing trace with hash 190163922, now seen corresponding path program 1 times
[2025-02-05 14:40:46,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 14:40:46,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761672375]
[2025-02-05 14:40:46,979 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:40:46,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 14:40:46,996 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-02-05 14:40:47,004 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-02-05 14:40:47,004 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:40:47,005 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:40:47,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-02-05 14:40:47,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 14:40:47,111 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761672375]
[2025-02-05 14:40:47,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761672375] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 14:40:47,111 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079173871]
[2025-02-05 14:40:47,111 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:40:47,111 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 14:40:47,111 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 14:40:47,113 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 14:40:47,116 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 14:40:47,225 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-02-05 14:40:47,271 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-02-05 14:40:47,272 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:40:47,272 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:40:47,278 INFO  L256         TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-02-05 14:40:47,280 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 14:40:47,303 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-02-05 14:40:47,303 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 14:40:47,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-02-05 14:40:47,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079173871] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 14:40:47,380 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 14:40:47,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7
[2025-02-05 14:40:47,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95733398]
[2025-02-05 14:40:47,380 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 14:40:47,381 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 14:40:47,381 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 14:40:47,381 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 14:40:47,381 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-05 14:40:47,381 INFO  L87              Difference]: Start difference. First operand 41 states and 49 transitions. Second operand  has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-05 14:40:47,463 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 14:40:47,464 INFO  L93              Difference]: Finished difference Result 54 states and 66 transitions.
[2025-02-05 14:40:47,465 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 14:40:47,466 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35
[2025-02-05 14:40:47,466 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 14:40:47,466 INFO  L225             Difference]: With dead ends: 54
[2025-02-05 14:40:47,467 INFO  L226             Difference]: Without dead ends: 41
[2025-02-05 14:40:47,467 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2025-02-05 14:40:47,467 INFO  L435           NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 14:40:47,468 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 156 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 14:40:47,468 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2025-02-05 14:40:47,476 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2025-02-05 14:40:47,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-05 14:40:47,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions.
[2025-02-05 14:40:47,481 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 35
[2025-02-05 14:40:47,481 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 14:40:47,481 INFO  L471      AbstractCegarLoop]: Abstraction has 41 states and 48 transitions.
[2025-02-05 14:40:47,481 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-05 14:40:47,482 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions.
[2025-02-05 14:40:47,482 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-02-05 14:40:47,483 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 14:40:47,484 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 14:40:47,492 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-05 14:40:47,684 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 14:40:47,684 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 14:40:47,685 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 14:40:47,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 218793073, now seen corresponding path program 1 times
[2025-02-05 14:40:47,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 14:40:47,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487429056]
[2025-02-05 14:40:47,685 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:40:47,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 14:40:47,702 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-02-05 14:40:47,712 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-02-05 14:40:47,712 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:40:47,713 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:40:47,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-02-05 14:40:47,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 14:40:47,920 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487429056]
[2025-02-05 14:40:47,920 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487429056] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 14:40:47,920 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942287094]
[2025-02-05 14:40:47,920 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:40:47,920 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 14:40:47,921 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 14:40:47,924 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 14:40:47,926 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-05 14:40:48,028 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-02-05 14:40:48,074 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-02-05 14:40:48,074 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:40:48,074 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:40:48,082 INFO  L256         TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-02-05 14:40:48,087 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 14:40:48,177 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 16 treesize of output 8
[2025-02-05 14:40:48,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-02-05 14:40:48,221 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 14:40:48,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-02-05 14:40:48,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942287094] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 14:40:48,262 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 14:40:48,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 14
[2025-02-05 14:40:48,262 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633229198]
[2025-02-05 14:40:48,262 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 14:40:48,263 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-02-05 14:40:48,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 14:40:48,263 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-02-05 14:40:48,264 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182
[2025-02-05 14:40:48,264 INFO  L87              Difference]: Start difference. First operand 41 states and 48 transitions. Second operand  has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5)
[2025-02-05 14:40:52,282 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2025-02-05 14:40:56,301 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2025-02-05 14:41:00,313 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2025-02-05 14:41:04,454 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2025-02-05 14:41:04,460 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 14:41:04,460 INFO  L93              Difference]: Finished difference Result 54 states and 66 transitions.
[2025-02-05 14:41:04,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-02-05 14:41:04,461 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35
[2025-02-05 14:41:04,461 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 14:41:04,462 INFO  L225             Difference]: With dead ends: 54
[2025-02-05 14:41:04,462 INFO  L226             Difference]: Without dead ends: 40
[2025-02-05 14:41:04,462 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342
[2025-02-05 14:41:04,463 INFO  L435           NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time
[2025-02-05 14:41:04,463 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 283 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time]
[2025-02-05 14:41:04,464 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2025-02-05 14:41:04,469 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38.
[2025-02-05 14:41:04,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-05 14:41:04,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions.
[2025-02-05 14:41:04,471 INFO  L78                 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 35
[2025-02-05 14:41:04,472 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 14:41:04,473 INFO  L471      AbstractCegarLoop]: Abstraction has 38 states and 44 transitions.
[2025-02-05 14:41:04,473 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5)
[2025-02-05 14:41:04,473 INFO  L276                IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions.
[2025-02-05 14:41:04,474 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2025-02-05 14:41:04,474 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 14:41:04,475 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 14:41:04,485 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-02-05 14:41:04,676 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2025-02-05 14:41:04,676 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 14:41:04,676 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 14:41:04,677 INFO  L85        PathProgramCache]: Analyzing trace with hash 438826494, now seen corresponding path program 1 times
[2025-02-05 14:41:04,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 14:41:04,677 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289367110]
[2025-02-05 14:41:04,677 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:41:04,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 14:41:04,693 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-02-05 14:41:04,719 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-02-05 14:41:04,719 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:41:04,720 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:41:05,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-02-05 14:41:05,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 14:41:05,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289367110]
[2025-02-05 14:41:05,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289367110] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 14:41:05,630 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373681506]
[2025-02-05 14:41:05,630 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 14:41:05,630 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 14:41:05,630 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 14:41:05,633 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 14:41:05,635 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-02-05 14:41:05,760 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-02-05 14:41:05,965 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-02-05 14:41:05,965 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 14:41:05,965 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 14:41:05,968 INFO  L256         TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 118 conjuncts are in the unsatisfiable core
[2025-02-05 14:41:05,973 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 14:41:06,001 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-02-05 14:41:06,193 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2025-02-05 14:41:06,193 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2025-02-05 14:41:06,249 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 11 treesize of output 7
[2025-02-05 14:41:06,316 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2025-02-05 14:41:06,316 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2025-02-05 14:41:06,447 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 14
[2025-02-05 14:41:06,453 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 15 treesize of output 7
[2025-02-05 14:41:06,589 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 11 treesize of output 7
[2025-02-05 14:41:06,685 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-02-05 14:41:06,686 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 38 treesize of output 27
[2025-02-05 14:41:06,704 INFO  L349             Elim1Store]: treesize reduction 8, result has 72.4 percent of original size
[2025-02-05 14:41:06,704 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 28 treesize of output 30
[2025-02-05 14:41:07,026 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-02-05 14:41:07,031 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 27
[2025-02-05 14:41:07,040 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 32
[2025-02-05 14:41:07,056 INFO  L349             Elim1Store]: treesize reduction 31, result has 22.5 percent of original size
[2025-02-05 14:41:07,056 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 78
[2025-02-05 14:41:07,063 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 19
[2025-02-05 14:41:07,073 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36
[2025-02-05 14:41:07,078 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 36 treesize of output 15
[2025-02-05 14:41:07,140 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 50 treesize of output 30
[2025-02-05 14:41:07,234 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 27 treesize of output 15
[2025-02-05 14:41:07,238 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3
[2025-02-05 14:41:07,246 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 15 treesize of output 7
[2025-02-05 14:41:07,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 14:41:07,248 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 14:41:07,388 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-05 14:41:07,388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62
[2025-02-05 14:41:07,404 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-05 14:41:07,405 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 120 treesize of output 123
[2025-02-05 14:41:07,417 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 52 treesize of output 46
[2025-02-05 14:41:07,649 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse1 (or (forall ((v_ArrVal_837 (Array Int Int)) (v_arrayElimCell_37 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_841))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse0) .cse3)) (+ 4 v_arrayElimCell_37))) (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_840))))) .cse6)) (.cse5 (forall ((v_arrayElimCell_37 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_841))) (or (not (= (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_840)) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int))) (let ((.cse13 (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse0) .cse3)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 4 v_arrayElimCell_39))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 4 v_arrayElimCell_37)))))))))) (.cse4 (not .cse6)) (.cse8 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (and (or (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse0) (and .cse1 (or (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse0) .cse3)) (+ 4 v_arrayElimCell_39))) (not (= v_ArrVal_840 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))) .cse4) .cse5)) (or (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) (and .cse1 .cse5)) (or .cse6 (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_841))) (or (not (= (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_840)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse0) .cse3)) .cse8)))))) (or (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_841))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse0) .cse3)) (+ 4 v_arrayElimCell_39))) (not (= (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_840))))) .cse4) (forall ((v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_841))) (or (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int))) (let ((.cse10 (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse0) .cse3)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ 4 v_arrayElimCell_39))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 .cse8))))) (not (= (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_840))))))))) is different from false
[2025-02-05 14:41:07,935 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse4 (not .cse7)) (.cse9 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse5 (forall ((v_arrayElimCell_37 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_841))) (or (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int))) (let ((.cse13 (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse2) .cse3)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 4 v_arrayElimCell_39))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 4 v_arrayElimCell_37)))))) (not (= v_ArrVal_840 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) (.cse6 (or (forall ((v_ArrVal_837 (Array Int Int)) (v_arrayElimCell_37 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_841))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse2) .cse3)) (+ 4 v_arrayElimCell_37))) (not (= v_ArrVal_840 (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) .cse7))) (and (or (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_841))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse2) .cse3)) (+ 4 v_arrayElimCell_39))) (not (= v_ArrVal_840 (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) .cse4) (or (and (or (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_841) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse2) .cse3)) (+ 4 v_arrayElimCell_39))) (not (= v_ArrVal_840 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))) .cse4) .cse5 .cse6) (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (or .cse7 (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_841))) (or (not (= v_ArrVal_840 (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse2) .cse3)) .cse9) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_841))) (or (not (= v_ArrVal_840 (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int))) (let ((.cse11 (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_840) (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_837) .cse2) .cse3)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 4 v_arrayElimCell_39))) (= (select .cse11 .cse9) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (or (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (and .cse5 .cse6)))))) is different from false
[2025-02-05 14:41:08,085 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (.cse3 (store |c_#memory_$Pointer$#2.base| .cse1 (store (select |c_#memory_$Pointer$#2.base| .cse1) .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (forall ((v_arrayElimCell_37 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#2| .cse1 v_ArrVal_841))) (or (not (= v_ArrVal_840 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int))) (let ((.cse16 (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_840) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_837) .cse0) .cse4)))) (or (= (select .cse16 (+ 4 v_arrayElimCell_39)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 4 v_arrayElimCell_37)))))))))) (.cse6 (or (forall ((v_ArrVal_837 (Array Int Int)) (v_arrayElimCell_37 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| .cse1 v_ArrVal_841))) (or (not (= v_ArrVal_840 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_840) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_837) .cse0) .cse4)) (+ 4 v_arrayElimCell_37)))))) .cse10)) (.cse5 (not .cse10)) (.cse9 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4))) (and (or (= .cse0 .cse1) (and .cse2 (or (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#2| .cse1 v_ArrVal_841) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_840) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_837) .cse0) .cse4)) (+ 4 v_arrayElimCell_39)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_840 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))))) .cse5) .cse6)) (or (and .cse2 .cse6) (= .cse4 .cse7)) (or (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#2| .cse1 v_ArrVal_841))) (or (not (= v_ArrVal_840 (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_840) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_837) .cse0) .cse4)) .cse9))))) .cse10) (or .cse5 (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#2| .cse1 v_ArrVal_841))) (or (not (= v_ArrVal_840 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_840) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_837) .cse0) .cse4)) (+ 4 v_arrayElimCell_39)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#2| .cse1 v_ArrVal_841))) (or (not (= v_ArrVal_840 (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_837 (Array Int Int))) (let ((.cse13 (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_840) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_837) .cse0) .cse4)))) (or (= (select .cse13 (+ 4 v_arrayElimCell_39)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 .cse9)))))))))))) is different from false
[2025-02-05 14:41:09,114 INFO  L349             Elim1Store]: treesize reduction 3064, result has 26.0 percent of original size
[2025-02-05 14:41:09,115 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 46 case distinctions, treesize of input 6087 treesize of output 6463
[2025-02-05 14:41:09,188 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 3457 treesize of output 3453
[2025-02-05 14:41:09,801 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-05 14:41:09,802 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 4299 treesize of output 6683
[2025-02-05 14:41:10,007 INFO  L349             Elim1Store]: treesize reduction 32, result has 59.5 percent of original size
[2025-02-05 14:41:10,008 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3600 treesize of output 3634
[2025-02-05 14:41:10,167 INFO  L349             Elim1Store]: treesize reduction 16, result has 60.0 percent of original size
[2025-02-05 14:41:10,168 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3587 treesize of output 3602
[2025-02-05 14:41:10,321 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-05 14:41:10,322 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3578 treesize of output 3586
[2025-02-05 14:41:10,581 INFO  L349             Elim1Store]: treesize reduction 24, result has 55.6 percent of original size
[2025-02-05 14:41:10,582 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3573 treesize of output 3592
[2025-02-05 14:41:10,934 INFO  L349             Elim1Store]: treesize reduction 32, result has 59.5 percent of original size
[2025-02-05 14:41:10,935 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3564 treesize of output 3598
[2025-02-05 14:41:11,175 INFO  L349             Elim1Store]: treesize reduction 16, result has 60.0 percent of original size
[2025-02-05 14:41:11,175 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3551 treesize of output 3566
[2025-02-05 14:41:11,387 INFO  L349             Elim1Store]: treesize reduction 16, result has 60.0 percent of original size
[2025-02-05 14:41:11,387 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3542 treesize of output 3557