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


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


Checking for ERROR reachability
Using default analysis
Version 3061b6dc
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-18 13:11:11,328 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-18 13:11:11,393 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-18 13:11:11,398 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-18 13:11:11,400 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-18 13:11:11,425 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-18 13:11:11,426 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-18 13:11:11,426 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-18 13:11:11,426 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-18 13:11:11,427 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-18 13:11:11,427 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-18 13:11:11,428 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-18 13:11:11,428 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-18 13:11:11,430 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-18 13:11:11,430 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-18 13:11:11,430 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-18 13:11:11,431 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-18 13:11:11,431 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-18 13:11:11,431 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-18 13:11:11,431 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-18 13:11:11,431 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-18 13:11:11,432 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-18 13:11:11,435 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-18 13:11:11,435 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-18 13:11:11,435 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-18 13:11:11,435 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-18 13:11:11,435 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-18 13:11:11,436 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-18 13:11:11,436 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-18 13:11:11,436 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-18 13:11:11,436 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-18 13:11:11,436 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-18 13:11:11,436 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 13:11:11,437 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-18 13:11:11,437 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-18 13:11:11,437 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-18 13:11:11,437 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-18 13:11:11,437 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-18 13:11:11,437 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-18 13:11:11,437 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-18 13:11:11,438 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-18 13:11:11,438 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-18 13:11:11,438 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5
[2024-11-18 13:11:11,652 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-18 13:11:11,675 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-18 13:11:11,677 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-18 13:11:11,678 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-18 13:11:11,679 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-18 13:11:11,679 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i
[2024-11-18 13:11:12,992 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-18 13:11:13,227 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-18 13:11:13,229 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i
[2024-11-18 13:11:13,244 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae59b726/73215ad3976b43e1ae4e3f162f2e6447/FLAGed2b07c0e
[2024-11-18 13:11:13,258 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae59b726/73215ad3976b43e1ae4e3f162f2e6447
[2024-11-18 13:11:13,260 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-18 13:11:13,262 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-18 13:11:13,265 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-18 13:11:13,265 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-18 13:11:13,270 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-18 13:11:13,271 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,271 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73cea419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13, skipping insertion in model container
[2024-11-18 13:11:13,271 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,307 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-18 13:11:13,580 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145]
[2024-11-18 13:11:13,586 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 13:11:13,595 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-18 13:11:13,649 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145]
[2024-11-18 13:11:13,653 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 13:11:13,701 INFO  L204         MainTranslator]: Completed translation
[2024-11-18 13:11:13,702 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13 WrapperNode
[2024-11-18 13:11:13,702 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-18 13:11:13,703 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-18 13:11:13,703 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-18 13:11:13,703 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-18 13:11:13,709 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,723 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,749 INFO  L138                Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88
[2024-11-18 13:11:13,749 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-18 13:11:13,750 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-18 13:11:13,750 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-18 13:11:13,750 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-18 13:11:13,759 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,760 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,763 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,779 INFO  L175           MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6].
[2024-11-18 13:11:13,780 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,780 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,789 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,792 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,793 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,794 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,796 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-18 13:11:13,796 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-18 13:11:13,797 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-18 13:11:13,797 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-18 13:11:13,801 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (1/1) ...
[2024-11-18 13:11:13,806 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 13:11:13,816 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:11:13,838 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)
[2024-11-18 13:11:13,842 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
[2024-11-18 13:11:13,886 INFO  L130     BoogieDeclarations]: Found specification of procedure myexit
[2024-11-18 13:11:13,886 INFO  L138     BoogieDeclarations]: Found implementation of procedure myexit
[2024-11-18 13:11:13,886 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-18 13:11:13,886 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-18 13:11:13,886 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-18 13:11:13,886 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-18 13:11:13,887 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-18 13:11:13,887 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-18 13:11:13,888 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2024-11-18 13:11:13,888 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2024-11-18 13:11:13,888 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2024-11-18 13:11:13,888 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2024-11-18 13:11:13,888 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-18 13:11:13,888 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-18 13:11:13,889 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-18 13:11:13,889 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-18 13:11:13,889 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-18 13:11:14,010 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-18 13:11:14,012 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-18 13:11:14,031 INFO  L735   $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true;
[2024-11-18 13:11:14,162 INFO  L?                        ?]: Removed 23 outVars from TransFormulas that were not future-live.
[2024-11-18 13:11:14,162 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-18 13:11:14,176 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-18 13:11:14,176 INFO  L316             CfgBuilder]: Removed 3 assume(true) statements.
[2024-11-18 13:11:14,177 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:11:14 BoogieIcfgContainer
[2024-11-18 13:11:14,177 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-18 13:11:14,178 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-18 13:11:14,178 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-18 13:11:14,181 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-18 13:11:14,181 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:11:13" (1/3) ...
[2024-11-18 13:11:14,182 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f7c486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:11:14, skipping insertion in model container
[2024-11-18 13:11:14,182 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:11:13" (2/3) ...
[2024-11-18 13:11:14,182 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f7c486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:11:14, skipping insertion in model container
[2024-11-18 13:11:14,182 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:11:14" (3/3) ...
[2024-11-18 13:11:14,183 INFO  L112   eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i
[2024-11-18 13:11:14,202 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-18 13:11:14,202 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-18 13:11:14,251 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-18 13:11:14,256 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;@5db9ff7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-18 13:11:14,257 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-18 13:11:14,260 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 28 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:14,265 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-18 13:11:14,266 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:11:14,269 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:11:14,270 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:11:14,274 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:11:14,274 INFO  L85        PathProgramCache]: Analyzing trace with hash 70364755, now seen corresponding path program 1 times
[2024-11-18 13:11:14,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:11:14,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854181393]
[2024-11-18 13:11:14,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:11:14,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:11:14,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:11:14,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:11:14,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:11:14,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854181393]
[2024-11-18 13:11:14,467 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854181393] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 13:11:14,467 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 13:11:14,467 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 13:11:14,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994511005]
[2024-11-18 13:11:14,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 13:11:14,473 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-18 13:11:14,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:11:14,494 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-18 13:11:14,495 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-18 13:11:14,496 INFO  L87              Difference]: Start difference. First operand  has 28 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:14,508 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:11:14,509 INFO  L93              Difference]: Finished difference Result 45 states and 61 transitions.
[2024-11-18 13:11:14,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-18 13:11:14,511 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2024-11-18 13:11:14,511 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:11:14,516 INFO  L225             Difference]: With dead ends: 45
[2024-11-18 13:11:14,516 INFO  L226             Difference]: Without dead ends: 20
[2024-11-18 13:11:14,519 INFO  L431           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
[2024-11-18 13:11:14,523 INFO  L432           NwaCegarLoop]: 34 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, 34 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
[2024-11-18 13:11:14,525 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-18 13:11:14,562 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2024-11-18 13:11:14,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2024-11-18 13:11:14,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:14,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions.
[2024-11-18 13:11:14,615 INFO  L78                 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10
[2024-11-18 13:11:14,615 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:11:14,616 INFO  L471      AbstractCegarLoop]: Abstraction has 20 states and 24 transitions.
[2024-11-18 13:11:14,616 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:14,616 INFO  L276                IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions.
[2024-11-18 13:11:14,616 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-18 13:11:14,620 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:11:14,620 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:11:14,621 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-18 13:11:14,621 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:11:14,621 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:11:14,622 INFO  L85        PathProgramCache]: Analyzing trace with hash -273185057, now seen corresponding path program 1 times
[2024-11-18 13:11:14,622 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:11:14,622 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785685612]
[2024-11-18 13:11:14,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:11:14,622 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:11:14,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:11:14,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:11:14,755 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:11:14,755 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785685612]
[2024-11-18 13:11:14,756 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785685612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 13:11:14,756 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 13:11:14,756 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 13:11:14,756 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800462088]
[2024-11-18 13:11:14,756 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 13:11:14,757 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 13:11:14,757 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:11:14,757 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 13:11:14,757 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 13:11:14,758 INFO  L87              Difference]: Start difference. First operand 20 states and 24 transitions. Second operand  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:14,778 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:11:14,778 INFO  L93              Difference]: Finished difference Result 36 states and 44 transitions.
[2024-11-18 13:11:14,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 13:11:14,779 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2024-11-18 13:11:14,779 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:11:14,780 INFO  L225             Difference]: With dead ends: 36
[2024-11-18 13:11:14,780 INFO  L226             Difference]: Without dead ends: 23
[2024-11-18 13:11:14,780 INFO  L431           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
[2024-11-18 13:11:14,781 INFO  L432           NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 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
[2024-11-18 13:11:14,781 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-18 13:11:14,782 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2024-11-18 13:11:14,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21.
[2024-11-18 13:11:14,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:14,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions.
[2024-11-18 13:11:14,785 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10
[2024-11-18 13:11:14,785 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:11:14,785 INFO  L471      AbstractCegarLoop]: Abstraction has 21 states and 25 transitions.
[2024-11-18 13:11:14,785 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:14,785 INFO  L276                IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions.
[2024-11-18 13:11:14,786 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-11-18 13:11:14,786 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:11:14,786 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:11:14,786 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-18 13:11:14,786 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:11:14,786 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:11:14,787 INFO  L85        PathProgramCache]: Analyzing trace with hash 2002783247, now seen corresponding path program 1 times
[2024-11-18 13:11:14,787 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:11:14,787 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293315310]
[2024-11-18 13:11:14,787 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:11:14,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:11:14,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:11:14,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:11:14,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:11:14,920 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293315310]
[2024-11-18 13:11:14,920 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293315310] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-18 13:11:14,920 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393607524]
[2024-11-18 13:11:14,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:11:14,920 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:11:14,920 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:11:14,923 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)
[2024-11-18 13:11:14,929 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-18 13:11:15,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:11:15,008 INFO  L255         TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-18 13:11:15,013 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:11:15,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:11:15,058 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-18 13:11:15,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:11:15,092 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393607524] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-18 13:11:15,093 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-18 13:11:15,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7
[2024-11-18 13:11:15,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327956894]
[2024-11-18 13:11:15,093 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-18 13:11:15,093 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-18 13:11:15,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:11:15,094 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-18 13:11:15,094 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2024-11-18 13:11:15,095 INFO  L87              Difference]: Start difference. First operand 21 states and 25 transitions. Second operand  has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:15,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:11:15,126 INFO  L93              Difference]: Finished difference Result 43 states and 53 transitions.
[2024-11-18 13:11:15,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-18 13:11:15,127 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2024-11-18 13:11:15,127 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:11:15,128 INFO  L225             Difference]: With dead ends: 43
[2024-11-18 13:11:15,128 INFO  L226             Difference]: Without dead ends: 30
[2024-11-18 13:11:15,128 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2024-11-18 13:11:15,129 INFO  L432           NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-18 13:11:15,130 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-18 13:11:15,131 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2024-11-18 13:11:15,133 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2024-11-18 13:11:15,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:15,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions.
[2024-11-18 13:11:15,136 INFO  L78                 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13
[2024-11-18 13:11:15,136 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:11:15,136 INFO  L471      AbstractCegarLoop]: Abstraction has 30 states and 34 transitions.
[2024-11-18 13:11:15,136 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:15,136 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions.
[2024-11-18 13:11:15,137 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2024-11-18 13:11:15,137 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:11:15,137 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:11:15,153 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-18 13:11:15,342 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:11:15,343 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:11:15,344 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:11:15,344 INFO  L85        PathProgramCache]: Analyzing trace with hash 1740729055, now seen corresponding path program 2 times
[2024-11-18 13:11:15,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:11:15,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126378324]
[2024-11-18 13:11:15,344 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-18 13:11:15,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:11:15,412 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-18 13:11:15,412 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-18 13:11:16,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-18 13:11:16,038 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:11:16,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126378324]
[2024-11-18 13:11:16,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126378324] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-18 13:11:16,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499729144]
[2024-11-18 13:11:16,038 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-18 13:11:16,038 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:11:16,038 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:11:16,043 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)
[2024-11-18 13:11:16,044 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-18 13:11:16,146 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-18 13:11:16,146 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-18 13:11:16,148 INFO  L255         TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core
[2024-11-18 13:11:16,150 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:11:16,312 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 13 treesize of output 9
[2024-11-18 13:11:16,352 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-11-18 13:11:16,353 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 25 treesize of output 13
[2024-11-18 13:11:16,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-18 13:11:16,429 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-18 13:11:16,486 WARN  L851   $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_231 (Array Int Int))) (or (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_231 (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_231 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) is different from false
[2024-11-18 13:11:16,533 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-18 13:11:16,533 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 44 treesize of output 34
[2024-11-18 13:11:16,553 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-18 13:11:16,553 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 47 treesize of output 49
[2024-11-18 13:11:16,603 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 41 treesize of output 29
[2024-11-18 13:11:16,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 4 not checked.
[2024-11-18 13:11:16,702 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499729144] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-18 13:11:16,702 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-18 13:11:16,702 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22
[2024-11-18 13:11:16,702 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781487169]
[2024-11-18 13:11:16,702 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-18 13:11:16,703 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2024-11-18 13:11:16,703 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:11:16,704 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-11-18 13:11:16,705 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462
[2024-11-18 13:11:16,705 INFO  L87              Difference]: Start difference. First operand 30 states and 34 transitions. Second operand  has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:17,027 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:11:17,027 INFO  L93              Difference]: Finished difference Result 34 states and 38 transitions.
[2024-11-18 13:11:17,028 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-18 13:11:17,028 INFO  L78                 Accepts]: Start accepts. Automaton has  has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22
[2024-11-18 13:11:17,028 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:11:17,029 INFO  L225             Difference]: With dead ends: 34
[2024-11-18 13:11:17,029 INFO  L226             Difference]: Without dead ends: 32
[2024-11-18 13:11:17,029 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=681, Unknown=1, NotChecked=54, Total=870
[2024-11-18 13:11:17,030 INFO  L432           NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-18 13:11:17,030 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 15 Unchecked, 0.1s Time]
[2024-11-18 13:11:17,031 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2024-11-18 13:11:17,037 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2024-11-18 13:11:17,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:17,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions.
[2024-11-18 13:11:17,039 INFO  L78                 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22
[2024-11-18 13:11:17,039 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:11:17,039 INFO  L471      AbstractCegarLoop]: Abstraction has 32 states and 36 transitions.
[2024-11-18 13:11:17,040 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:17,040 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions.
[2024-11-18 13:11:17,041 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-18 13:11:17,041 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:11:17,041 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:11:17,055 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-18 13:11:17,245 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3
[2024-11-18 13:11:17,246 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:11:17,247 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:11:17,247 INFO  L85        PathProgramCache]: Analyzing trace with hash 625081173, now seen corresponding path program 1 times
[2024-11-18 13:11:17,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:11:17,247 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147445356]
[2024-11-18 13:11:17,247 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:11:17,247 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:11:17,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:11:18,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-18 13:11:18,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:11:18,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147445356]
[2024-11-18 13:11:18,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147445356] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-18 13:11:18,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358819836]
[2024-11-18 13:11:18,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:11:18,319 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:11:18,320 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:11:18,347 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)
[2024-11-18 13:11:18,348 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-18 13:11:18,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:11:18,445 INFO  L255         TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 67 conjuncts are in the unsatisfiable core
[2024-11-18 13:11:18,448 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:11:18,502 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
[2024-11-18 13:11:18,557 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 18 treesize of output 7
[2024-11-18 13:11:18,563 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 22 treesize of output 1
[2024-11-18 13:11:18,576 INFO  L349             Elim1Store]: treesize reduction 21, result has 44.7 percent of original size
[2024-11-18 13:11:18,576 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
[2024-11-18 13:11:18,646 INFO  L349             Elim1Store]: treesize reduction 13, result has 45.8 percent of original size
[2024-11-18 13:11:18,647 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 31 treesize of output 30
[2024-11-18 13:11:18,659 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15
[2024-11-18 13:11:18,672 INFO  L349             Elim1Store]: treesize reduction 17, result has 29.2 percent of original size
[2024-11-18 13:11:18,672 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 19 treesize of output 18
[2024-11-18 13:11:18,841 INFO  L349             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-11-18 13:11:18,842 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 1 case distinctions, treesize of input 50 treesize of output 37
[2024-11-18 13:11:18,851 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-18 13:11:18,851 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 42 treesize of output 34
[2024-11-18 13:11:18,865 INFO  L349             Elim1Store]: treesize reduction 13, result has 40.9 percent of original size
[2024-11-18 13:11:18,865 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 31 treesize of output 30
[2024-11-18 13:11:18,874 INFO  L349             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-11-18 13:11:18,874 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 1 case distinctions, treesize of input 43 treesize of output 34
[2024-11-18 13:11:18,894 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-18 13:11:18,895 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 28 treesize of output 28
[2024-11-18 13:11:19,009 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-18 13:11:19,009 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-18 13:11:19,179 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_388) .cse0) .cse1)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_385 (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_388) .cse0) .cse1)) (not (= v_ArrVal_385 (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) is different from false
[2024-11-18 13:11:19,222 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-18 13:11:19,223 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 166 treesize of output 170
[2024-11-18 13:11:19,239 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-18 13:11:19,239 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 169 treesize of output 173
[2024-11-18 13:11:19,337 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or (forall ((v_ArrVal_381 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (not (= v_ArrVal_385 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_381) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse1) (or (and (forall ((v_prenex_10 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int#1| v_prenex_10 v_prenex_11) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_12) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_10) (not (= v_prenex_11 (store (select |c_#memory_int#1| v_prenex_10) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_prenex_10 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int#1| v_prenex_10 v_prenex_11) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_12) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_381) v_prenex_10) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_11)))) .cse1)) .cse2) (or (forall ((v_prenex_12 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_12) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse2 .cse1) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_385 (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (forall ((v_ArrVal_388 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) .cse1))) is different from false
[2024-11-18 13:11:19,465 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_prenex_10 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int#1| v_prenex_10 v_prenex_11) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_12) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_10) (not (= v_prenex_11 (store (select |c_#memory_int#1| v_prenex_10) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_prenex_10 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int#1| v_prenex_10 v_prenex_11) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_12) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_381) v_prenex_10) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_11)))) .cse2))) (or (forall ((v_prenex_12 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_12) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse2 .cse0) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_385 (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (forall ((v_ArrVal_381 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (not (= v_ArrVal_385 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_381) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (or .cse2 (forall ((v_ArrVal_388 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))))))) is different from false
[2024-11-18 13:11:19,491 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-18 13:11:19,492 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 37
[2024-11-18 13:11:19,500 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-11-18 13:11:19,505 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-18 13:11:19,506 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49
[2024-11-18 13:11:19,531 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 41 treesize of output 29
[2024-11-18 13:11:19,542 INFO  L349             Elim1Store]: treesize reduction 9, result has 10.0 percent of original size
[2024-11-18 13:11:19,542 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1
[2024-11-18 13:11:19,550 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-18 13:11:19,550 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 22 treesize of output 23
[2024-11-18 13:11:19,553 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 36 treesize of output 24
[2024-11-18 13:11:19,556 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 7 treesize of output 3
[2024-11-18 13:11:19,564 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-18 13:11:19,565 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 47 treesize of output 37
[2024-11-18 13:11:19,580 INFO  L349             Elim1Store]: treesize reduction 5, result has 37.5 percent of original size
[2024-11-18 13:11:19,580 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 81 treesize of output 78
[2024-11-18 13:11:19,585 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 11 treesize of output 7
[2024-11-18 13:11:19,590 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 21 treesize of output 13
[2024-11-18 13:11:19,602 INFO  L349             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-11-18 13:11:19,602 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 1
[2024-11-18 13:11:19,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 13 not checked.
[2024-11-18 13:11:19,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358819836] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-18 13:11:19,687 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-18 13:11:19,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29
[2024-11-18 13:11:19,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153110742]
[2024-11-18 13:11:19,687 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-18 13:11:19,688 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-11-18 13:11:19,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:11:19,688 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-11-18 13:11:19,689 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=576, Unknown=3, NotChecked=150, Total=812
[2024-11-18 13:11:19,689 INFO  L87              Difference]: Start difference. First operand 32 states and 36 transitions. Second operand  has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:20,061 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:11:20,061 INFO  L93              Difference]: Finished difference Result 48 states and 55 transitions.
[2024-11-18 13:11:20,062 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-11-18 13:11:20,063 INFO  L78                 Accepts]: Start accepts. Automaton has  has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25
[2024-11-18 13:11:20,063 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:11:20,064 INFO  L225             Difference]: With dead ends: 48
[2024-11-18 13:11:20,064 INFO  L226             Difference]: Without dead ends: 46
[2024-11-18 13:11:20,065 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=862, Unknown=3, NotChecked=186, Total=1190
[2024-11-18 13:11:20,065 INFO  L432           NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-18 13:11:20,066 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 147 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 281 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time]
[2024-11-18 13:11:20,066 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2024-11-18 13:11:20,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35.
[2024-11-18 13:11:20,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:20,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions.
[2024-11-18 13:11:20,070 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25
[2024-11-18 13:11:20,071 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:11:20,071 INFO  L471      AbstractCegarLoop]: Abstraction has 35 states and 40 transitions.
[2024-11-18 13:11:20,071 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:20,071 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions.
[2024-11-18 13:11:20,071 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-18 13:11:20,072 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:11:20,072 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:11:20,085 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-18 13:11:20,275 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:11:20,276 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:11:20,277 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:11:20,277 INFO  L85        PathProgramCache]: Analyzing trace with hash -2098705484, now seen corresponding path program 1 times
[2024-11-18 13:11:20,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:11:20,277 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994115732]
[2024-11-18 13:11:20,277 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:11:20,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:11:20,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:11:20,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-18 13:11:20,613 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:11:20,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994115732]
[2024-11-18 13:11:20,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994115732] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-18 13:11:20,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245821536]
[2024-11-18 13:11:20,613 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:11:20,613 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:11:20,613 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:11:20,615 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-18 13:11:20,616 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-18 13:11:20,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:11:20,729 INFO  L255         TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 43 conjuncts are in the unsatisfiable core
[2024-11-18 13:11:20,732 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:11:20,735 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
[2024-11-18 13:11:20,758 INFO  L349             Elim1Store]: treesize reduction 20, result has 33.3 percent of original size
[2024-11-18 13:11:20,759 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 19 treesize of output 16
[2024-11-18 13:11:20,778 INFO  L349             Elim1Store]: treesize reduction 20, result has 33.3 percent of original size
[2024-11-18 13:11:20,779 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 19 treesize of output 16
[2024-11-18 13:11:20,795 INFO  L349             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-11-18 13:11:20,795 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14
[2024-11-18 13:11:20,813 INFO  L349             Elim1Store]: treesize reduction 16, result has 36.0 percent of original size
[2024-11-18 13:11:20,814 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18
[2024-11-18 13:11:20,838 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1
[2024-11-18 13:11:20,858 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 17 treesize of output 12
[2024-11-18 13:11:20,896 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
[2024-11-18 13:11:20,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-18 13:11:20,898 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-18 13:11:20,931 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 41 treesize of output 39
[2024-11-18 13:11:20,939 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 22 treesize of output 20
[2024-11-18 13:11:21,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-18 13:11:21,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245821536] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-18 13:11:21,079 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-18 13:11:21,079 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19
[2024-11-18 13:11:21,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206281898]
[2024-11-18 13:11:21,080 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-18 13:11:21,080 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-11-18 13:11:21,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:11:21,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-11-18 13:11:21,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=286, Unknown=4, NotChecked=0, Total=342
[2024-11-18 13:11:21,081 INFO  L87              Difference]: Start difference. First operand 35 states and 40 transitions. Second operand  has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:21,227 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:11:21,228 INFO  L93              Difference]: Finished difference Result 43 states and 49 transitions.
[2024-11-18 13:11:21,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-18 13:11:21,228 INFO  L78                 Accepts]: Start accepts. Automaton has  has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26
[2024-11-18 13:11:21,228 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:11:21,229 INFO  L225             Difference]: With dead ends: 43
[2024-11-18 13:11:21,229 INFO  L226             Difference]: Without dead ends: 35
[2024-11-18 13:11:21,229 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=370, Unknown=4, NotChecked=0, Total=462
[2024-11-18 13:11:21,230 INFO  L432           NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-18 13:11:21,230 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 111 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-18 13:11:21,231 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2024-11-18 13:11:21,233 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35.
[2024-11-18 13:11:21,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:21,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions.
[2024-11-18 13:11:21,234 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26
[2024-11-18 13:11:21,234 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:11:21,234 INFO  L471      AbstractCegarLoop]: Abstraction has 35 states and 39 transitions.
[2024-11-18 13:11:21,234 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:11:21,234 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions.
[2024-11-18 13:11:21,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2024-11-18 13:11:21,235 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:11:21,235 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:11:21,251 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-18 13:11:21,435 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:11:21,436 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:11:21,436 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:11:21,436 INFO  L85        PathProgramCache]: Analyzing trace with hash -1184035041, now seen corresponding path program 2 times
[2024-11-18 13:11:21,436 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:11:21,436 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107366160]
[2024-11-18 13:11:21,436 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-18 13:11:21,437 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:11:21,488 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-18 13:11:21,489 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-18 13:11:23,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-18 13:11:23,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:11:23,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107366160]
[2024-11-18 13:11:23,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107366160] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-18 13:11:23,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553185123]
[2024-11-18 13:11:23,040 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-18 13:11:23,040 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:11:23,040 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:11:23,042 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-18 13:11:23,043 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-18 13:11:23,152 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-18 13:11:23,153 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-18 13:11:23,155 INFO  L255         TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 109 conjuncts are in the unsatisfiable core
[2024-11-18 13:11:23,164 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:11:23,169 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9
[2024-11-18 13:11:23,204 INFO  L349             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-11-18 13:11:23,205 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14
[2024-11-18 13:11:23,242 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-11-18 13:11:23,243 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
[2024-11-18 13:11:23,296 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
[2024-11-18 13:11:23,358 INFO  L349             Elim1Store]: treesize reduction 8, result has 52.9 percent of original size
[2024-11-18 13:11:23,359 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 16 treesize of output 18
[2024-11-18 13:11:23,415 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7
[2024-11-18 13:11:23,423 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15
[2024-11-18 13:11:23,432 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1
[2024-11-18 13:11:23,543 INFO  L349             Elim1Store]: treesize reduction 25, result has 43.2 percent of original size
[2024-11-18 13:11:23,544 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 1 case distinctions, treesize of input 66 treesize of output 39
[2024-11-18 13:11:23,563 INFO  L349             Elim1Store]: treesize reduction 13, result has 40.9 percent of original size
[2024-11-18 13:11:23,563 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 1 case distinctions, treesize of input 16 treesize of output 15
[2024-11-18 13:11:23,600 INFO  L349             Elim1Store]: treesize reduction 29, result has 27.5 percent of original size
[2024-11-18 13:11:23,600 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 1 case distinctions, treesize of input 30 treesize of output 22
[2024-11-18 13:11:23,748 INFO  L349             Elim1Store]: treesize reduction 36, result has 34.5 percent of original size
[2024-11-18 13:11:23,748 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 88
[2024-11-18 13:11:23,772 INFO  L349             Elim1Store]: treesize reduction 52, result has 26.8 percent of original size
[2024-11-18 13:11:23,772 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 3 case distinctions, treesize of input 73 treesize of output 75
[2024-11-18 13:11:23,789 INFO  L349             Elim1Store]: treesize reduction 25, result has 21.9 percent of original size
[2024-11-18 13:11:23,789 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 2 case distinctions, treesize of input 26 treesize of output 28
[2024-11-18 13:11:24,347 INFO  L349             Elim1Store]: treesize reduction 120, result has 0.8 percent of original size
[2024-11-18 13:11:24,347 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 230 treesize of output 172
[2024-11-18 13:11:24,397 INFO  L349             Elim1Store]: treesize reduction 60, result has 62.5 percent of original size
[2024-11-18 13:11:24,397 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 296
[2024-11-18 13:11:24,411 INFO  L349             Elim1Store]: treesize reduction 140, result has 0.7 percent of original size
[2024-11-18 13:11:24,411 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 219 treesize of output 214