./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array7_pattern.c --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85b55cdd1f26353e63ecc189ba28ba899672edc569fe3ef3f04470f2b5e667fa
[2025-03-03 09:30:48,961 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:30:48,965 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:30:48,969 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:30:48,969 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:30:48,970 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:30:48,971 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array7_pattern.c
[2025-03-03 09:30:50,075 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04689c2b/7a865810ea944f3297faa8a4c1627334/FLAGa43c46ddd
[2025-03-03 09:30:50,298 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:30:50,299 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array7_pattern.c
[2025-03-03 09:30:50,306 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04689c2b/7a865810ea944f3297faa8a4c1627334/FLAGa43c46ddd
[2025-03-03 09:30:50,318 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04689c2b/7a865810ea944f3297faa8a4c1627334
[2025-03-03 09:30:50,320 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:30:50,321 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:30:50,322 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:30:50,323 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:30:50,326 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:30:50,327 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,327 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c774eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50, skipping insertion in model container
[2025-03-03 09:30:50,327 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,340 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:30:50,433 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array7_pattern.c[1375,1388]
[2025-03-03 09:30:50,450 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:30:50,457 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:30:50,464 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array7_pattern.c[1375,1388]
[2025-03-03 09:30:50,473 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:30:50,486 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:30:50,487 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50 WrapperNode
[2025-03-03 09:30:50,487 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:30:50,488 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:30:50,489 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:30:50,489 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:30:50,493 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,498 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,512 INFO  L138                Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83
[2025-03-03 09:30:50,514 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:30:50,514 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:30:50,515 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:30:50,515 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:30:50,520 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,520 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,523 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,539 INFO  L175           MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2].
[2025-03-03 09:30:50,542 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,542 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,545 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,549 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,550 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,550 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,551 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:30:50,556 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:30:50,556 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:30:50,556 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:30:50,557 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (1/1) ...
[2025-03-03 09:30:50,564 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:30:50,573 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:30:50,585 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 09:30:50,588 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 09:30:50,606 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:30:50,606 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 09:30:50,606 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 09:30:50,606 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:30:50,606 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-03-03 09:30:50,606 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2025-03-03 09:30:50,606 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-03-03 09:30:50,606 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-03-03 09:30:50,607 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-03-03 09:30:50,607 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-03-03 09:30:50,607 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:30:50,607 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:30:50,608 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-03-03 09:30:50,608 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-03-03 09:30:50,608 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-03-03 09:30:50,608 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-03-03 09:30:50,662 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:30:50,664 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:30:50,791 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L45: call ULTIMATE.dealloc(main_~#array1~0#1.base, main_~#array1~0#1.offset);havoc main_~#array1~0#1.base, main_~#array1~0#1.offset;call ULTIMATE.dealloc(main_~#array2~0#1.base, main_~#array2~0#1.offset);havoc main_~#array2~0#1.base, main_~#array2~0#1.offset;
[2025-03-03 09:30:50,797 INFO  L?                        ?]: Removed 13 outVars from TransFormulas that were not future-live.
[2025-03-03 09:30:50,797 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:30:50,802 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:30:50,803 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:30:50,803 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:30:50 BoogieIcfgContainer
[2025-03-03 09:30:50,803 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:30:50,805 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:30:50,805 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:30:50,808 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:30:50,808 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:30:50" (1/3) ...
[2025-03-03 09:30:50,808 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cf82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:30:50, skipping insertion in model container
[2025-03-03 09:30:50,808 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:50" (2/3) ...
[2025-03-03 09:30:50,809 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cf82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:30:50, skipping insertion in model container
[2025-03-03 09:30:50,809 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:30:50" (3/3) ...
[2025-03-03 09:30:50,809 INFO  L128   eAbstractionObserver]: Analyzing ICFG array7_pattern.c
[2025-03-03 09:30:50,819 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:30:50,820 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG array7_pattern.c that has 2 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations.
[2025-03-03 09:30:50,859 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:30:50,869 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;@7ddb600, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:30:50,869 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:30:50,873 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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-03-03 09:30:50,878 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2025-03-03 09:30:50,878 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:30:50,879 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:30:50,879 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:30:50,883 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:30:50,884 INFO  L85        PathProgramCache]: Analyzing trace with hash 871812597, now seen corresponding path program 1 times
[2025-03-03 09:30:50,889 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:30:50,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60395768]
[2025-03-03 09:30:50,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:30:50,892 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:30:50,942 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes.
[2025-03-03 09:30:50,951 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements.
[2025-03-03 09:30:50,952 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:30:50,952 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:30:50,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:30:50,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:30:50,981 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60395768]
[2025-03-03 09:30:50,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60395768] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:30:50,981 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:30:50,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:30:50,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738572500]
[2025-03-03 09:30:50,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:30:50,985 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 09:30:50,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:30:50,997 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 09:30:50,997 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 09:30:50,998 INFO  L87              Difference]: Start difference. First operand  has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2025-03-03 09:30:51,009 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:30:51,010 INFO  L93              Difference]: Finished difference Result 43 states and 59 transitions.
[2025-03-03 09:30:51,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 09:30:51,011 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14
[2025-03-03 09:30:51,012 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:30:51,015 INFO  L225             Difference]: With dead ends: 43
[2025-03-03 09:30:51,015 INFO  L226             Difference]: Without dead ends: 19
[2025-03-03 09:30:51,019 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 09:30:51,020 INFO  L435           NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:30:51,021 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:30:51,029 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2025-03-03 09:30:51,036 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2025-03-03 09:30:51,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-03-03 09:30:51,039 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions.
[2025-03-03 09:30:51,040 INFO  L78                 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 14
[2025-03-03 09:30:51,040 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:30:51,041 INFO  L471      AbstractCegarLoop]: Abstraction has 19 states and 23 transitions.
[2025-03-03 09:30:51,041 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2025-03-03 09:30:51,041 INFO  L276                IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions.
[2025-03-03 09:30:51,042 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2025-03-03 09:30:51,042 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:30:51,042 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:30:51,042 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:30:51,042 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:30:51,043 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:30:51,043 INFO  L85        PathProgramCache]: Analyzing trace with hash 572178061, now seen corresponding path program 1 times
[2025-03-03 09:30:51,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:30:51,043 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250073139]
[2025-03-03 09:30:51,043 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:30:51,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:30:51,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-03-03 09:30:51,084 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-03-03 09:30:51,085 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:30:51,085 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:30:51,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 09:30:51,271 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:30:51,271 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250073139]
[2025-03-03 09:30:51,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250073139] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:30:51,271 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:30:51,271 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:30:51,271 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040526465]
[2025-03-03 09:30:51,271 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:30:51,272 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:30:51,272 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:30:51,273 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:30:51,273 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:30:51,273 INFO  L87              Difference]: Start difference. First operand 19 states and 23 transitions. Second operand  has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03-03 09:30:51,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:30:51,295 INFO  L93              Difference]: Finished difference Result 23 states and 27 transitions.
[2025-03-03 09:30:51,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:30:51,296 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 26
[2025-03-03 09:30:51,296 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:30:51,297 INFO  L225             Difference]: With dead ends: 23
[2025-03-03 09:30:51,297 INFO  L226             Difference]: Without dead ends: 20
[2025-03-03 09:30:51,298 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:30:51,298 INFO  L435           NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:30:51,299 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:30:51,300 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2025-03-03 09:30:51,305 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2025-03-03 09:30:51,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-03-03 09:30:51,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions.
[2025-03-03 09:30:51,305 INFO  L78                 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 26
[2025-03-03 09:30:51,306 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:30:51,306 INFO  L471      AbstractCegarLoop]: Abstraction has 20 states and 24 transitions.
[2025-03-03 09:30:51,306 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03-03 09:30:51,306 INFO  L276                IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions.
[2025-03-03 09:30:51,309 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-03-03 09:30:51,310 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:30:51,310 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:30:51,310 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:30:51,310 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:30:51,311 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:30:51,311 INFO  L85        PathProgramCache]: Analyzing trace with hash 557682460, now seen corresponding path program 1 times
[2025-03-03 09:30:51,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:30:51,311 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214845968]
[2025-03-03 09:30:51,311 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:30:51,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:30:51,331 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-03-03 09:30:51,349 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-03 09:30:51,349 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:30:51,349 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:30:51,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 09:30:51,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:30:51,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214845968]
[2025-03-03 09:30:51,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214845968] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:30:51,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:30:51,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 09:30:51,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139532428]
[2025-03-03 09:30:51,466 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:30:51,466 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:30:51,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:30:51,466 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:30:51,466 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:30:51,466 INFO  L87              Difference]: Start difference. First operand 20 states and 24 transitions. Second operand  has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-03 09:30:51,502 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:30:51,503 INFO  L93              Difference]: Finished difference Result 36 states and 43 transitions.
[2025-03-03 09:30:51,503 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 09:30:51,503 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 27
[2025-03-03 09:30:51,504 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:30:51,504 INFO  L225             Difference]: With dead ends: 36
[2025-03-03 09:30:51,504 INFO  L226             Difference]: Without dead ends: 21
[2025-03-03 09:30:51,504 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:30:51,505 INFO  L435           NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:30:51,505 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:30:51,505 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2025-03-03 09:30:51,510 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2025-03-03 09:30:51,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-03-03 09:30:51,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions.
[2025-03-03 09:30:51,513 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 27
[2025-03-03 09:30:51,513 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:30:51,513 INFO  L471      AbstractCegarLoop]: Abstraction has 21 states and 25 transitions.
[2025-03-03 09:30:51,513 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-03 09:30:51,513 INFO  L276                IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions.
[2025-03-03 09:30:51,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-03-03 09:30:51,514 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:30:51,514 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:30:51,514 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 09:30:51,515 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:30:51,515 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:30:51,517 INFO  L85        PathProgramCache]: Analyzing trace with hash 652545624, now seen corresponding path program 1 times
[2025-03-03 09:30:51,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:30:51,517 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500377682]
[2025-03-03 09:30:51,517 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:30:51,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:30:51,532 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-03-03 09:30:51,593 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-03-03 09:30:51,593 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:30:51,594 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:30:51,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-03 09:30:51,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:30:51,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500377682]
[2025-03-03 09:30:51,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500377682] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:30:51,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944005479]
[2025-03-03 09:30:51,737 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:30:51,737 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:30:51,737 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:30:51,740 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:30:51,741 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 09:30:51,784 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-03-03 09:30:51,802 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-03-03 09:30:51,802 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:30:51,802 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:30:51,804 INFO  L256         TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-03-03 09:30:51,807 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:30:51,926 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-03-03 09:30:51,926 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:30:52,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-03 09:30:52,129 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944005479] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:30:52,129 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:30:52,129 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 18
[2025-03-03 09:30:52,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866840965]
[2025-03-03 09:30:52,129 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:30:52,129 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-03-03 09:30:52,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:30:52,130 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-03-03 09:30:52,130 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306
[2025-03-03 09:30:52,131 INFO  L87              Difference]: Start difference. First operand 21 states and 25 transitions. Second operand  has 18 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7)
[2025-03-03 09:30:52,270 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:30:52,271 INFO  L93              Difference]: Finished difference Result 60 states and 70 transitions.
[2025-03-03 09:30:52,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 09:30:52,271 INFO  L78                 Accepts]: Start accepts. Automaton has  has 18 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 28
[2025-03-03 09:30:52,271 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:30:52,272 INFO  L225             Difference]: With dead ends: 60
[2025-03-03 09:30:52,272 INFO  L226             Difference]: Without dead ends: 31
[2025-03-03 09:30:52,273 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420
[2025-03-03 09:30:52,273 INFO  L435           NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:30:52,273 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 100 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:30:52,274 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2025-03-03 09:30:52,278 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23.
[2025-03-03 09:30:52,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-03-03 09:30:52,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions.
[2025-03-03 09:30:52,279 INFO  L78                 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 28
[2025-03-03 09:30:52,279 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:30:52,279 INFO  L471      AbstractCegarLoop]: Abstraction has 23 states and 27 transitions.
[2025-03-03 09:30:52,280 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7)
[2025-03-03 09:30:52,280 INFO  L276                IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions.
[2025-03-03 09:30:52,280 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2025-03-03 09:30:52,280 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:30:52,281 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]
[2025-03-03 09:30:52,287 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 09:30:52,485 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:30:52,485 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:30:52,485 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:30:52,486 INFO  L85        PathProgramCache]: Analyzing trace with hash 267523800, now seen corresponding path program 2 times
[2025-03-03 09:30:52,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:30:52,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254022485]
[2025-03-03 09:30:52,486 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-03 09:30:52,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:30:52,503 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes.
[2025-03-03 09:30:52,519 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements.
[2025-03-03 09:30:52,519 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-03 09:30:52,519 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:30:52,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 09:30:52,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:30:52,618 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254022485]
[2025-03-03 09:30:52,618 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254022485] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:30:52,618 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644003078]
[2025-03-03 09:30:52,618 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-03 09:30:52,618 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:30:52,618 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:30:52,621 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:30:52,622 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 09:30:52,666 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes.
[2025-03-03 09:30:52,701 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements.
[2025-03-03 09:30:52,701 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-03 09:30:52,701 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:30:52,702 INFO  L256         TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-03 09:30:52,703 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:30:52,761 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-03 09:30:52,761 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:30:52,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 09:30:52,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [644003078] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:30:52,828 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:30:52,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14
[2025-03-03 09:30:52,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766270484]
[2025-03-03 09:30:52,828 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:30:52,828 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-03 09:30:52,828 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:30:52,829 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-03 09:30:52,829 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182
[2025-03-03 09:30:52,829 INFO  L87              Difference]: Start difference. First operand 23 states and 27 transitions. Second operand  has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2025-03-03 09:30:52,915 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:30:52,915 INFO  L93              Difference]: Finished difference Result 32 states and 36 transitions.
[2025-03-03 09:30:52,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 09:30:52,915 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 30
[2025-03-03 09:30:52,915 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:30:52,916 INFO  L225             Difference]: With dead ends: 32
[2025-03-03 09:30:52,916 INFO  L226             Difference]: Without dead ends: 29
[2025-03-03 09:30:52,916 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306
[2025-03-03 09:30:52,916 INFO  L435           NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:30:52,917 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 123 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:30:52,917 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2025-03-03 09:30:52,919 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2025-03-03 09:30:52,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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-03-03 09:30:52,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions.
[2025-03-03 09:30:52,920 INFO  L78                 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 30
[2025-03-03 09:30:52,920 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:30:52,920 INFO  L471      AbstractCegarLoop]: Abstraction has 29 states and 32 transitions.
[2025-03-03 09:30:52,920 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2025-03-03 09:30:52,920 INFO  L276                IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions.
[2025-03-03 09:30:52,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-03-03 09:30:52,921 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:30:52,921 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:30:52,926 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-03 09:30:53,121 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:30:53,121 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:30:53,122 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:30:53,122 INFO  L85        PathProgramCache]: Analyzing trace with hash -606649864, now seen corresponding path program 3 times
[2025-03-03 09:30:53,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:30:53,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889170807]
[2025-03-03 09:30:53,122 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-03 09:30:53,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:30:53,131 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes.
[2025-03-03 09:30:53,250 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 32 of 32 statements.
[2025-03-03 09:30:53,250 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-03-03 09:30:53,251 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-03 09:30:53,254 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323147513]
[2025-03-03 09:30:53,254 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-03 09:30:53,254 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:30:53,254 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:30:53,256 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:30:53,257 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 09:30:53,295 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes.
[2025-03-03 09:30:53,370 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 32 of 32 statements.
[2025-03-03 09:30:53,370 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-03-03 09:30:53,370 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:30:53,375 INFO  L256         TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 72 conjuncts are in the unsatisfiable core
[2025-03-03 09:30:53,383 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:30:53,432 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-03-03 09:30:53,444 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-03-03 09:30:53,477 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 19 treesize of output 20
[2025-03-03 09:30:53,489 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 19 treesize of output 18
[2025-03-03 09:30:53,543 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-03 09:30:53,543 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28
[2025-03-03 09:30:53,555 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-03 09:30:53,555 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32
[2025-03-03 09:30:55,020 INFO  L349             Elim1Store]: treesize reduction 12, result has 60.0 percent of original size
[2025-03-03 09:30:55,020 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 269 treesize of output 246
[2025-03-03 09:30:55,430 INFO  L349             Elim1Store]: treesize reduction 12, result has 60.0 percent of original size
[2025-03-03 09:30:55,431 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 518 treesize of output 467
[2025-03-03 09:30:55,561 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:55,562 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:55,564 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:55,565 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:55,569 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:55,573 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:55,785 INFO  L349             Elim1Store]: treesize reduction 80, result has 22.3 percent of original size
[2025-03-03 09:30:55,786 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 78
[2025-03-03 09:30:56,100 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,101 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,102 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,103 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,107 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,111 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,338 INFO  L349             Elim1Store]: treesize reduction 80, result has 22.3 percent of original size
[2025-03-03 09:30:56,338 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 78
[2025-03-03 09:30:56,494 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,496 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,500 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,501 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,503 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,505 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,510 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,514 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,516 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:30:56,588 INFO  L349             Elim1Store]: treesize reduction 254, result has 0.4 percent of original size
[2025-03-03 09:30:56,589 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 7 select indices, 7 select index equivalence classes, 30 disjoint index pairs (out of 21 index pairs), introduced 15 new quantified variables, introduced 12 case distinctions, treesize of input 431 treesize of output 1521
[2025-03-03 09:31:25,920 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,921 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,923 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,927 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,931 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,936 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,938 INFO  L173   IndexEqualityManager]: detected equality via solver
[2025-03-03 09:31:25,944 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,948 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,951 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,952 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,953 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,955 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,963 INFO  L173   IndexEqualityManager]: detected equality via solver
[2025-03-03 09:31:25,966 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,967 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,973 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,979 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,980 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,981 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,982 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,983 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,985 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,986 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,991 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,992 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,993 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:25,996 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:26,001 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:26,003 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:26,005 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:26,006 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:26,007 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:26,008 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:26,042 INFO  L349             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2025-03-03 09:31:26,043 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 10 select indices, 10 select index equivalence classes, 35 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 2 case distinctions, treesize of input 953 treesize of output 1089
[2025-03-03 09:31:27,559 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:27,560 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:27,561 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:27,563 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:27,566 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:27,567 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:27,570 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:27,573 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:27,578 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:27,580 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-03 09:31:27,600 INFO  L349             Elim1Store]: treesize reduction 45, result has 26.2 percent of original size
[2025-03-03 09:31:27,601 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 130
[2025-03-03 09:31:36,574 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 792 treesize of output 716
[2025-03-03 09:31:46,007 WARN  L286               SmtUtils]: Spent 9.42s on a formula simplification that was a NOOP. DAG size: 399 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1)
[2025-03-03 09:31:46,007 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-03 09:31:46,008 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 3 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 723 treesize of output 1802
[2025-03-03 09:31:46,461 INFO  L224             Elim1Store]: Index analysis took 337 ms
[2025-03-03 09:32:24,557 WARN  L286               SmtUtils]: Spent 38.09s on a formula simplification. DAG size of input: 890 DAG size of output: 171 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1)
[2025-03-03 09:32:24,558 INFO  L349             Elim1Store]: treesize reduction 4133, result has 9.1 percent of original size
[2025-03-03 09:32:24,559 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 17 select indices, 17 select index equivalence classes, 13 disjoint index pairs (out of 136 index pairs), introduced 21 new quantified variables, introduced 171 case distinctions, treesize of input 1151 treesize of output 1448