./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 18:20:19,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:20:19,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 18:20:19,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:20:19,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:20:19,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:20:19,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:20:19,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:20:19,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:20:19,913 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:20:19,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:20:19,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:20:19,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:20:19,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:20:19,915 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:20:19,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:20:19,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:20:19,916 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:20:19,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 18:20:19,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:20:19,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:20:19,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:20:19,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:20:19,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:20:19,918 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:20:19,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:20:19,919 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:20:19,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:20:19,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:20:19,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:20:19,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:20:19,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:20:19,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:20:19,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:20:19,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:20:19,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 18:20:19,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 18:20:19,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:20:19,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:20:19,922 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:20:19,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:20:19,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:20:19,922 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 18:20:20,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:20:20,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:20:20,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:20:20,152 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:20:20,153 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:20:20,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2023-11-22 18:20:21,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:20:21,355 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:20:21,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2023-11-22 18:20:21,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c76a159/b90f1b6c02a44833984205d41354d4b8/FLAG537b9a434 [2023-11-22 18:20:21,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c76a159/b90f1b6c02a44833984205d41354d4b8 [2023-11-22 18:20:21,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:20:21,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:20:21,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:20:21,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:20:21,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:20:21,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69297ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21, skipping insertion in model container [2023-11-22 18:20:21,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,421 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:20:21,657 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i[24672,24685] [2023-11-22 18:20:21,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:20:21,670 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:20:21,702 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i[24672,24685] [2023-11-22 18:20:21,703 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:20:21,721 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:20:21,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21 WrapperNode [2023-11-22 18:20:21,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:20:21,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:20:21,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:20:21,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:20:21,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,762 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-11-22 18:20:21,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:20:21,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:20:21,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:20:21,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:20:21,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,777 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,793 INFO L189 HeapSplitter]: Split 31 memory accesses to 3 slices as follows [2, 20, 9] [2023-11-22 18:20:21,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:20:21,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:20:21,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:20:21,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:20:21,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (1/1) ... [2023-11-22 18:20:21,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:20:21,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:20:21,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 18:20:21,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 18:20:21,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 18:20:21,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 18:20:21,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-22 18:20:21,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 18:20:21,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 18:20:21,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-22 18:20:21,906 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-22 18:20:21,907 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-22 18:20:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 18:20:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:20:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 18:20:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 18:20:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 18:20:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-22 18:20:21,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 18:20:21,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 18:20:21,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-22 18:20:21,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 18:20:21,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-22 18:20:21,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-22 18:20:21,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-22 18:20:21,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 18:20:21,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 18:20:21,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-22 18:20:21,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:20:21,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:20:22,054 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:20:22,056 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:20:22,211 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:20:22,253 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:20:22,254 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-22 18:20:22,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:20:22 BoogieIcfgContainer [2023-11-22 18:20:22,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:20:22,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:20:22,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:20:22,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:20:22,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:20:21" (1/3) ... [2023-11-22 18:20:22,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb489e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:20:22, skipping insertion in model container [2023-11-22 18:20:22,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:20:21" (2/3) ... [2023-11-22 18:20:22,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb489e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:20:22, skipping insertion in model container [2023-11-22 18:20:22,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:20:22" (3/3) ... [2023-11-22 18:20:22,263 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2023-11-22 18:20:22,276 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:20:22,276 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:20:22,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:20:22,335 INFO L357 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, mHoare=true, 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;@197a4840, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:20:22,335 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:20:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 18:20:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 18:20:22,359 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:20:22,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:20:22,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:20:22,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:20:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash -977421440, now seen corresponding path program 1 times [2023-11-22 18:20:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:20:22,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215894078] [2023-11-22 18:20:22,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:20:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:22,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:20:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:22,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 18:20:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 18:20:22,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:20:22,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215894078] [2023-11-22 18:20:22,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215894078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:20:22,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:20:22,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 18:20:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814250904] [2023-11-22 18:20:22,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:20:22,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 18:20:22,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:20:22,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 18:20:22,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:20:22,720 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 18:20:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:20:22,787 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2023-11-22 18:20:22,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 18:20:22,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-22 18:20:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:20:22,793 INFO L225 Difference]: With dead ends: 54 [2023-11-22 18:20:22,794 INFO L226 Difference]: Without dead ends: 24 [2023-11-22 18:20:22,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:20:22,801 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:20:22,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:20:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-22 18:20:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-22 18:20:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 18:20:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-22 18:20:22,828 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2023-11-22 18:20:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:20:22,829 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-22 18:20:22,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 18:20:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-22 18:20:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 18:20:22,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:20:22,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:20:22,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 18:20:22,831 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:20:22,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:20:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1639470509, now seen corresponding path program 1 times [2023-11-22 18:20:22,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:20:22,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377460826] [2023-11-22 18:20:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:22,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:20:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:20:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:22,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 18:20:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 18:20:23,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:20:23,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377460826] [2023-11-22 18:20:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377460826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:20:23,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:20:23,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 18:20:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675808587] [2023-11-22 18:20:23,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:20:23,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:20:23,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:20:23,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:20:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 18:20:23,007 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 18:20:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:20:23,120 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-11-22 18:20:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 18:20:23,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-22 18:20:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:20:23,122 INFO L225 Difference]: With dead ends: 45 [2023-11-22 18:20:23,122 INFO L226 Difference]: Without dead ends: 29 [2023-11-22 18:20:23,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 18:20:23,124 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:20:23,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 58 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:20:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-22 18:20:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2023-11-22 18:20:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 18:20:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-22 18:20:23,134 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 18 [2023-11-22 18:20:23,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:20:23,135 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-22 18:20:23,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 18:20:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-22 18:20:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 18:20:23,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:20:23,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:20:23,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 18:20:23,139 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:20:23,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:20:23,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2143999192, now seen corresponding path program 1 times [2023-11-22 18:20:23,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:20:23,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411230821] [2023-11-22 18:20:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:20:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:23,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:20:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:23,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:20:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 18:20:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 18:20:23,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:20:23,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411230821] [2023-11-22 18:20:23,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411230821] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:20:23,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894585036] [2023-11-22 18:20:23,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:23,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:20:23,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:20:23,701 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) [2023-11-22 18:20:23,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 18:20:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:23,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-22 18:20:23,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:20:23,962 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 [2023-11-22 18:20:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:20:23,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:20:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:20:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894585036] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:20:24,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:20:24,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2023-11-22 18:20:24,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375073653] [2023-11-22 18:20:24,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:20:24,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 18:20:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:20:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 18:20:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-22 18:20:24,065 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-22 18:20:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:20:24,284 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2023-11-22 18:20:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 18:20:24,286 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 26 [2023-11-22 18:20:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:20:24,287 INFO L225 Difference]: With dead ends: 50 [2023-11-22 18:20:24,287 INFO L226 Difference]: Without dead ends: 29 [2023-11-22 18:20:24,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2023-11-22 18:20:24,289 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:20:24,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 222 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 18:20:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-22 18:20:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-11-22 18:20:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 18:20:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-11-22 18:20:24,296 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 26 [2023-11-22 18:20:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:20:24,296 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-11-22 18:20:24,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-22 18:20:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-11-22 18:20:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 18:20:24,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:20:24,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:20:24,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 18:20:24,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:20:24,510 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:20:24,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:20:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2142152150, now seen corresponding path program 1 times [2023-11-22 18:20:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:20:24,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138087857] [2023-11-22 18:20:24,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:24,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:20:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:25,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:20:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:25,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:20:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:26,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 18:20:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 18:20:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:20:26,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138087857] [2023-11-22 18:20:26,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138087857] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:20:26,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400135610] [2023-11-22 18:20:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:26,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:20:26,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:20:26,210 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) [2023-11-22 18:20:26,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 18:20:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:26,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-22 18:20:26,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:20:26,696 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 [2023-11-22 18:20:26,834 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 [2023-11-22 18:20:26,897 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 18:20:26,897 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 [2023-11-22 18:20:26,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-22 18:20:27,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:20:27,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:27,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-11-22 18:20:27,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-11-22 18:20:27,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:27,166 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 50 treesize of output 39 [2023-11-22 18:20:27,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-22 18:20:27,402 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-22 18:20:27,403 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 [2023-11-22 18:20:27,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:27,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-11-22 18:20:27,441 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-22 18:20:27,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-22 18:20:27,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 52 [2023-11-22 18:20:27,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:27,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:27,584 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 45 treesize of output 36 [2023-11-22 18:20:27,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-22 18:20:27,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-22 18:20:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:20:27,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:20:27,732 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_677) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_675))) (or (not (= v_ArrVal_674 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_674 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_674) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-11-22 18:20:27,750 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_677) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_675))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_674) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_674 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_674 .cse2)))))))) is different from false [2023-11-22 18:20:27,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400135610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:20:27,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:20:27,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2023-11-22 18:20:27,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223728321] [2023-11-22 18:20:27,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:20:27,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-22 18:20:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:20:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-22 18:20:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1673, Unknown=2, NotChecked=166, Total=1980 [2023-11-22 18:20:27,931 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 18:20:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:20:28,769 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2023-11-22 18:20:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-22 18:20:28,771 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-22 18:20:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:20:28,771 INFO L225 Difference]: With dead ends: 33 [2023-11-22 18:20:28,771 INFO L226 Difference]: Without dead ends: 31 [2023-11-22 18:20:28,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=247, Invalid=2729, Unknown=2, NotChecked=214, Total=3192 [2023-11-22 18:20:28,773 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 50 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 18:20:28,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 299 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 18:20:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-22 18:20:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-11-22 18:20:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 18:20:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-11-22 18:20:28,777 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 26 [2023-11-22 18:20:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:20:28,778 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-11-22 18:20:28,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 18:20:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-11-22 18:20:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 18:20:28,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:20:28,779 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:20:28,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 18:20:28,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-22 18:20:28,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:20:28,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:20:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2125151189, now seen corresponding path program 1 times [2023-11-22 18:20:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:20:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819980595] [2023-11-22 18:20:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:20:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:30,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:20:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:30,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:20:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 18:20:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 18:20:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:20:30,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819980595] [2023-11-22 18:20:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819980595] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:20:30,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252272851] [2023-11-22 18:20:30,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:30,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:20:30,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:20:30,880 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) [2023-11-22 18:20:30,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 18:20:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:31,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-22 18:20:31,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:20:31,577 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 [2023-11-22 18:20:31,772 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2023-11-22 18:20:31,773 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2023-11-22 18:20:31,783 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 [2023-11-22 18:20:31,799 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2023-11-22 18:20:31,801 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2023-11-22 18:20:31,819 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 18:20:31,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-22 18:20:31,831 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2023-11-22 18:20:31,832 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2023-11-22 18:20:31,850 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from false [2023-11-22 18:20:31,853 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from true [2023-11-22 18:20:31,902 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-11-22 18:20:31,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 104 [2023-11-22 18:20:31,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94 [2023-11-22 18:20:31,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 38 [2023-11-22 18:20:31,958 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))))))) is different from false [2023-11-22 18:20:31,960 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))))))) is different from true [2023-11-22 18:20:32,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:32,104 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 41 treesize of output 24 [2023-11-22 18:20:32,127 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))))) is different from false [2023-11-22 18:20:32,128 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))))) is different from true [2023-11-22 18:20:32,156 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from false [2023-11-22 18:20:32,158 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from true [2023-11-22 18:20:32,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:32,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:32,193 INFO L349 Elim1Store]: treesize reduction 138, result has 7.4 percent of original size [2023-11-22 18:20:32,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 159 treesize of output 170 [2023-11-22 18:20:32,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 134 [2023-11-22 18:20:32,246 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse6 4)) (.cse3 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) .cse1 (store .cse5 4 .cse0)))) (and (= (select .cse4 .cse3) .cse5) (= (select |c_#memory_$Pointer$#1.base| .cse0) (select .cse4 .cse0)))))))))) is different from false [2023-11-22 18:20:32,248 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse6 4)) (.cse3 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) .cse1 (store .cse5 4 .cse0)))) (and (= (select .cse4 .cse3) .cse5) (= (select |c_#memory_$Pointer$#1.base| .cse0) (select .cse4 .cse0)))))))))) is different from true [2023-11-22 18:20:32,272 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse6 4)) (.cse3 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) .cse1 (store .cse5 4 .cse0)))) (and (= (select .cse4 .cse3) .cse5) (= (select |c_#memory_$Pointer$#1.base| .cse0) (select .cse4 .cse0)))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))))) is different from false [2023-11-22 18:20:32,274 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse6 4)) (.cse3 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) .cse1 (store .cse5 4 .cse0)))) (and (= (select .cse4 .cse3) .cse5) (= (select |c_#memory_$Pointer$#1.base| .cse0) (select .cse4 .cse0)))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))))) is different from true [2023-11-22 18:20:32,307 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 213 treesize of output 133 [2023-11-22 18:20:32,314 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 18:20:32,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 126 [2023-11-22 18:20:32,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 82 [2023-11-22 18:20:32,342 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 0))) is different from false [2023-11-22 18:20:32,344 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 0))) is different from true [2023-11-22 18:20:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-22 18:20:32,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:20:32,428 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) v_ArrVal_936) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_939))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))) is different from false [2023-11-22 18:20:32,440 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) v_ArrVal_936) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_939))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))) is different from false [2023-11-22 18:20:32,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252272851] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:20:32,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:20:32,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2023-11-22 18:20:32,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430824884] [2023-11-22 18:20:32,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:20:32,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-22 18:20:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:20:32,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-22 18:20:32,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1174, Unknown=22, NotChecked=948, Total=2256 [2023-11-22 18:20:32,558 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 42 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 18:20:32,729 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2023-11-22 18:20:32,731 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2023-11-22 18:20:32,734 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2023-11-22 18:20:32,735 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2023-11-22 18:20:32,745 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2023-11-22 18:20:32,748 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2023-11-22 18:20:32,751 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from false [2023-11-22 18:20:32,752 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from true [2023-11-22 18:20:32,757 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse6 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse3 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (= .cse2 (select .cse3 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse4) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0)))))))) is different from false [2023-11-22 18:20:32,759 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse6 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse3 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (= .cse2 (select .cse3 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse4) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0)))))))) is different from true [2023-11-22 18:20:32,792 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse6 (select .cse7 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= .cse6 .cse1)) (.cse2 (select .cse3 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= .cse2 (select .cse3 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0))) (or (not .cse4) (and (not .cse5) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) .cse5))) (or (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse7 0))) .cse4) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse9 (select |v_old(#valid)_AFTER_CALL_9| .cse9))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))))) is different from false [2023-11-22 18:20:32,794 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse6 (select .cse7 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= .cse6 .cse1)) (.cse2 (select .cse3 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= .cse2 (select .cse3 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0))) (or (not .cse4) (and (not .cse5) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) .cse5))) (or (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse7 0))) .cse4) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse9 (select |v_old(#valid)_AFTER_CALL_9| .cse9))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))))) is different from true [2023-11-22 18:20:32,823 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse11 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse5 (select .cse11 4)) (.cse8 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select .cse8 4)) (.cse2 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (= .cse5 .cse6))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4))) (or (not .cse1) (and .cse2 .cse3 (= .cse4 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) (and .cse2 (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (store (select |c_#memory_$Pointer$#1.base| .cse5) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) .cse3))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse7 (select .cse8 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse2 (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_old(#valid)_AFTER_CALL_9| .cse10))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (or (and (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse11 0))) .cse2 .cse3) .cse1)))))) is different from false [2023-11-22 18:20:32,825 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse11 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse5 (select .cse11 4)) (.cse8 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select .cse8 4)) (.cse2 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (= .cse5 .cse6))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4))) (or (not .cse1) (and .cse2 .cse3 (= .cse4 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) (and .cse2 (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (store (select |c_#memory_$Pointer$#1.base| .cse5) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) .cse3))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse7 (select .cse8 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse2 (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_old(#valid)_AFTER_CALL_9| .cse10))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (or (and (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse11 0))) .cse2 .cse3) .cse1)))))) is different from true [2023-11-22 18:20:32,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse4 0))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select .cse11 4)) (.cse8 (select .cse11 0))) (and (= (select .cse0 0) 0) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse3 0))) (or (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)) (not (= .cse1 (select .cse3 4))))))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#1.base| .cse8 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse6 (store .cse10 4 .cse5)))) (and (= (select .cse9 .cse8) .cse10) (= (select |c_#memory_$Pointer$#1.base| .cse5) (select .cse9 .cse5))))))))))) is different from false [2023-11-22 18:20:32,844 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse4 0))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select .cse11 4)) (.cse8 (select .cse11 0))) (and (= (select .cse0 0) 0) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse3 0))) (or (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)) (not (= .cse1 (select .cse3 4))))))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#1.base| .cse8 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse6 (store .cse10 4 .cse5)))) (and (= (select .cse9 .cse8) .cse10) (= (select |c_#memory_$Pointer$#1.base| .cse5) (select .cse9 .cse5))))))))))) is different from true [2023-11-22 18:20:32,904 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse2 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select .cse9 4)) (.cse6 (select .cse9 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (or (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#1.base| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) .cse1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) .cse4 (store .cse8 4 .cse3)))) (and (= (select .cse7 .cse6) .cse8) (= (select |c_#memory_$Pointer$#1.base| .cse3) (select .cse7 .cse3)))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)))))) is different from false [2023-11-22 18:20:32,906 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse2 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select .cse9 4)) (.cse6 (select .cse9 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (or (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#1.base| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) .cse1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) .cse4 (store .cse8 4 .cse3)))) (and (= (select .cse7 .cse6) .cse8) (= (select |c_#memory_$Pointer$#1.base| .cse3) (select .cse7 .cse3)))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)))))) is different from true [2023-11-22 18:20:32,921 WARN L854 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 0)))) is different from false [2023-11-22 18:20:32,923 WARN L876 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 0)))) is different from true [2023-11-22 18:20:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:20:32,961 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2023-11-22 18:20:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-22 18:20:32,962 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-11-22 18:20:32,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:20:32,962 INFO L225 Difference]: With dead ends: 45 [2023-11-22 18:20:32,962 INFO L226 Difference]: Without dead ends: 40 [2023-11-22 18:20:32,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=1303, Unknown=42, NotChecked=2046, Total=3540 [2023-11-22 18:20:32,964 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 910 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:20:32,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 304 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 910 Unchecked, 0.2s Time] [2023-11-22 18:20:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-22 18:20:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-11-22 18:20:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 18:20:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2023-11-22 18:20:32,969 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 29 [2023-11-22 18:20:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:20:32,969 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-11-22 18:20:32,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 18:20:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2023-11-22 18:20:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 18:20:32,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:20:32,970 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:20:32,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 18:20:33,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:20:33,185 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:20:33,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:20:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2125194899, now seen corresponding path program 1 times [2023-11-22 18:20:33,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:20:33,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594287635] [2023-11-22 18:20:33,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:20:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:35,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:20:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:35,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:20:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:35,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 18:20:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 18:20:36,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:20:36,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594287635] [2023-11-22 18:20:36,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594287635] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:20:36,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061932593] [2023-11-22 18:20:36,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:36,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:20:36,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:20:36,067 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) [2023-11-22 18:20:36,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 18:20:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:36,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 174 conjunts are in the unsatisfiable core [2023-11-22 18:20:36,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:20:36,479 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 [2023-11-22 18:20:36,485 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 [2023-11-22 18:20:36,663 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 18:20:36,663 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 16 treesize of output 15 [2023-11-22 18:20:36,684 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 18:20:36,684 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 [2023-11-22 18:20:36,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:20:36,770 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 [2023-11-22 18:20:36,781 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 [2023-11-22 18:20:36,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:20:36,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-22 18:20:36,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:20:37,085 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-11-22 18:20:37,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 256 treesize of output 194 [2023-11-22 18:20:37,096 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2023-11-22 18:20:37,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2023-11-22 18:20:37,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2023-11-22 18:20:37,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2023-11-22 18:20:37,118 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 32 treesize of output 19 [2023-11-22 18:20:37,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:37,343 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 87 treesize of output 52 [2023-11-22 18:20:37,357 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-22 18:20:37,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-22 18:20:37,364 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 24 treesize of output 19 [2023-11-22 18:20:37,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2023-11-22 18:20:37,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:37,614 INFO L349 Elim1Store]: treesize reduction 138, result has 7.4 percent of original size [2023-11-22 18:20:37,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 314 treesize of output 277 [2023-11-22 18:20:37,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:37,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:37,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 48 [2023-11-22 18:20:37,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 128 [2023-11-22 18:20:37,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 51 [2023-11-22 18:20:37,642 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 55 treesize of output 19 [2023-11-22 18:20:37,645 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 53 treesize of output 19 [2023-11-22 18:20:37,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2023-11-22 18:20:37,878 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 112 treesize of output 68 [2023-11-22 18:20:37,882 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 0 case distinctions, treesize of input 54 treesize of output 26 [2023-11-22 18:20:37,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 18:20:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:20:38,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:20:38,202 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse3)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (+ .cse5 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_int#1| .cse0)) (.cse11 (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse3))) (and (forall ((v_ArrVal_1218 (Array Int Int))) (or (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1212 (Array Int Int))) (let ((.cse7 (select (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1212) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1214))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse4))) (let ((.cse6 (select .cse7 .cse5))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1217) .cse1 v_ArrVal_1216) (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1219) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1215))) (store .cse2 .cse1 (store (select .cse2 .cse1) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse4) .cse5)) (+ .cse6 8))) (= .cse6 (select .cse7 .cse8)))))) (not (= (store .cse10 .cse11 (select v_ArrVal_1218 .cse11)) v_ArrVal_1218)))) (forall ((v_ArrVal_1218 (Array Int Int))) (or (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1212 (Array Int Int))) (let ((.cse14 (select (let ((.cse15 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1219) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1215))) (store .cse15 .cse1 (store (select .cse15 .cse1) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse4))) (let ((.cse12 (select .cse14 .cse5))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1217) .cse1 v_ArrVal_1216) .cse12) (+ (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1212) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1214))) (store .cse13 .cse1 (store (select .cse13 .cse1) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse4) .cse5) 8))) (= .cse12 (select .cse14 .cse8)))))) (not (= (store .cse10 .cse11 (select v_ArrVal_1218 .cse11)) v_ArrVal_1218)))))))) is different from false [2023-11-22 18:20:38,241 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse6)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ .cse8 4)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_int#1| .cse3)) (.cse11 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse6))) (and (forall ((v_ArrVal_1218 (Array Int Int))) (or (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1212 (Array Int Int))) (let ((.cse0 (select (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1219) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1215))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) .cse7))) (let ((.cse2 (select .cse0 .cse8))) (or (= (select .cse0 .cse1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse3 v_ArrVal_1218) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1217) .cse4 v_ArrVal_1216) .cse2) (+ (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1212) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1214))) (store .cse5 .cse4 (store (select .cse5 .cse4) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) .cse7) .cse8) 8))))))) (not (= (store .cse10 .cse11 (select v_ArrVal_1218 .cse11)) v_ArrVal_1218)))) (forall ((v_ArrVal_1218 (Array Int Int))) (or (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1212 (Array Int Int))) (let ((.cse13 (select (let ((.cse15 (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1212) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1214))) (store .cse15 .cse4 (store (select .cse15 .cse4) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) .cse7))) (let ((.cse12 (select .cse13 .cse8))) (or (= .cse12 (select .cse13 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse3 v_ArrVal_1218) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1217) .cse4 v_ArrVal_1216) (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1219) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1215))) (store .cse14 .cse4 (store (select .cse14 .cse4) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) .cse7) .cse8)) (+ .cse12 8))))))) (not (= (store .cse10 .cse11 (select v_ArrVal_1218 .cse11)) v_ArrVal_1218)))))))) is different from false [2023-11-22 18:20:38,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061932593] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:20:38,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:20:38,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 43 [2023-11-22 18:20:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377675627] [2023-11-22 18:20:38,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:20:38,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-22 18:20:38,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:20:38,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-22 18:20:38,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1940, Unknown=2, NotChecked=178, Total=2256 [2023-11-22 18:20:38,647 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 18:20:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:20:40,373 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2023-11-22 18:20:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-22 18:20:40,374 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-11-22 18:20:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:20:40,374 INFO L225 Difference]: With dead ends: 67 [2023-11-22 18:20:40,374 INFO L226 Difference]: Without dead ends: 62 [2023-11-22 18:20:40,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=253, Invalid=3293, Unknown=2, NotChecked=234, Total=3782 [2023-11-22 18:20:40,376 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:20:40,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 263 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-22 18:20:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-22 18:20:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2023-11-22 18:20:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 18:20:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2023-11-22 18:20:40,381 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 29 [2023-11-22 18:20:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:20:40,381 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-11-22 18:20:40,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 18:20:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2023-11-22 18:20:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-22 18:20:40,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:20:40,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:20:40,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 18:20:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:20:40,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:20:40,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:20:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash -370873652, now seen corresponding path program 1 times [2023-11-22 18:20:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:20:40,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761377815] [2023-11-22 18:20:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:20:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:42,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:20:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:20:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:42,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 18:20:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 18:20:42,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:20:42,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761377815] [2023-11-22 18:20:42,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761377815] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:20:42,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307048599] [2023-11-22 18:20:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:20:42,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:20:42,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:20:42,587 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) [2023-11-22 18:20:42,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 18:20:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:20:42,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 172 conjunts are in the unsatisfiable core [2023-11-22 18:20:42,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:20:42,845 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 [2023-11-22 18:20:42,985 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2023-11-22 18:20:42,986 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2023-11-22 18:20:42,999 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 [2023-11-22 18:20:43,008 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 [2023-11-22 18:20:43,016 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2023-11-22 18:20:43,017 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2023-11-22 18:20:43,031 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 18:20:43,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-22 18:20:43,051 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-22 18:20:43,051 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 24 treesize of output 19 [2023-11-22 18:20:43,062 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2023-11-22 18:20:43,063 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2023-11-22 18:20:43,083 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2023-11-22 18:20:43,085 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from true [2023-11-22 18:20:43,133 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-22 18:20:43,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 96 [2023-11-22 18:20:43,146 INFO L349 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2023-11-22 18:20:43,146 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 1 case distinctions, treesize of input 95 treesize of output 73 [2023-11-22 18:20:43,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select .cse4 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select .cse3 0) 0) (= .cse2 .cse1)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= (select .cse4 0) .cse2) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|) (= (select .cse3 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) .cse1))))) is different from false [2023-11-22 18:20:43,172 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select .cse4 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select .cse3 0) 0) (= .cse2 .cse1)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= (select .cse4 0) .cse2) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|) (= (select .cse3 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) .cse1))))) is different from true [2023-11-22 18:20:43,250 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 [2023-11-22 18:20:45,626 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse8 (select .cse19 4))) (let ((.cse7 (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse20 (select |v_#valid_BEFORE_CALL_16| .cse20)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse8) 1)))) (.cse9 (= (select .cse19 0) .cse8)) (.cse11 (= (select (select |c_#memory_$Pointer$#1.base| .cse8) 0) .cse2))) (or (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse2)) (.cse6 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| |c_#memory_$Pointer$#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse2))) (let ((.cse1 (select .cse5 4)) (.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= 0 (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse1) 0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3)) |c_#memory_$Pointer$#1.base|) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse1) 0) .cse2) (= (select .cse5 0) .cse1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3))))) (= (select .cse0 4) 0) (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6)))) (let ((.cse16 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and (let ((.cse10 (= (select .cse16 0) 0))) (or (and .cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 0) 0) .cse9 .cse10 .cse11) (and .cse10 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse15 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse2))) (let ((.cse12 (select .cse15 4)) (.cse13 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= 0 (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse12) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse13 (select |c_#memory_$Pointer$#1.base| .cse13)) |c_#memory_$Pointer$#1.base|) (= |v_#valid_BEFORE_CALL_16| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse14 (select |v_#valid_BEFORE_CALL_16| .cse14)))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse12) 0) .cse2) (= (select .cse15 0) .cse12) (= (select (select |c_#memory_$Pointer$#1.offset| .cse12) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse13)))))))) (= (select .cse16 4) 0))) (and .cse7 (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| (Array Int (Array Int Int)))) (let ((.cse17 (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse2)) (.cse18 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| |c_#memory_$Pointer$#1.offset|))) (and (= (select .cse17 0) 0) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse8) 0) 0) (= (select .cse17 4) 0) (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse18 (select |c_#memory_$Pointer$#1.offset| .cse18))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse18)))) .cse9 .cse11)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) is different from false [2023-11-22 18:20:47,640 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse8 (select .cse19 4))) (let ((.cse7 (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse20 (select |v_#valid_BEFORE_CALL_16| .cse20)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse8) 1)))) (.cse9 (= (select .cse19 0) .cse8)) (.cse11 (= (select (select |c_#memory_$Pointer$#1.base| .cse8) 0) .cse2))) (or (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse2)) (.cse6 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| |c_#memory_$Pointer$#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse2))) (let ((.cse1 (select .cse5 4)) (.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= 0 (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse1) 0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3)) |c_#memory_$Pointer$#1.base|) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse1) 0) .cse2) (= (select .cse5 0) .cse1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3))))) (= (select .cse0 4) 0) (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6)))) (let ((.cse16 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and (let ((.cse10 (= (select .cse16 0) 0))) (or (and .cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 0) 0) .cse9 .cse10 .cse11) (and .cse10 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse15 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse2))) (let ((.cse12 (select .cse15 4)) (.cse13 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= 0 (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse12) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse13 (select |c_#memory_$Pointer$#1.base| .cse13)) |c_#memory_$Pointer$#1.base|) (= |v_#valid_BEFORE_CALL_16| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse14 (select |v_#valid_BEFORE_CALL_16| .cse14)))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse12) 0) .cse2) (= (select .cse15 0) .cse12) (= (select (select |c_#memory_$Pointer$#1.offset| .cse12) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse13)))))))) (= (select .cse16 4) 0))) (and .cse7 (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| (Array Int (Array Int Int)))) (let ((.cse17 (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse2)) (.cse18 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| |c_#memory_$Pointer$#1.offset|))) (and (= (select .cse17 0) 0) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse8) 0) 0) (= (select .cse17 4) 0) (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse18 (select |c_#memory_$Pointer$#1.offset| .cse18))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse18)))) .cse9 .cse11)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) is different from true [2023-11-22 18:20:49,853 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse0 (select .cse19 4))) (let ((.cse1 (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse6) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse20 (select |v_#valid_BEFORE_CALL_16| .cse20)))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1)))) (.cse2 (= (select .cse19 0) .cse0)) (.cse4 (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse6))) (or (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| .cse6))) (and (let ((.cse3 (= (select .cse10 0) 0))) (or (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse1 .cse2 .cse3 .cse4) (and .cse3 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse9 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse6))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| |c_#memory_$Pointer$#1.base|)) (.cse7 (select .cse9 4))) (and (= .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_16| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse7) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse5 (select |c_#memory_$Pointer$#1.base| .cse5)) |c_#memory_$Pointer$#1.base|) (= |v_#valid_BEFORE_CALL_16| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_16| .cse8)))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse7) 0) .cse6) (= (select .cse9 0) .cse7) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0)))))))) (= (select .cse10 4) 0))) (and (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse6)) (.cse12 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| |c_#memory_$Pointer$#1.offset|))) (and (= (select .cse11 0) 0) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse0) 0) 0) (= (select .cse11 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse12) (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse12 (select |c_#memory_$Pointer$#1.offset| .cse12)))))) .cse1 .cse2 .cse4) (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| (Array Int (Array Int Int)))) (let ((.cse13 (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse6)) (.cse18 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| |c_#memory_$Pointer$#1.offset|))) (and (= (select .cse13 0) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse17 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse6))) (let ((.cse15 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| |c_#memory_$Pointer$#1.base|)) (.cse14 (select .cse17 4))) (and (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse14) 0) 0) (= .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_16| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse14) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse15 (select |c_#memory_$Pointer$#1.base| .cse15)) |c_#memory_$Pointer$#1.base|) (= |v_#valid_BEFORE_CALL_16| (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse16 (select |v_#valid_BEFORE_CALL_16| .cse16)))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse14) 0) .cse6) (= (select .cse17 0) .cse14) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0))))) (= (select .cse13 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse18) (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse18 (select |c_#memory_$Pointer$#1.offset| .cse18))))))))))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) is different from false [2023-11-22 18:20:51,857 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse0 (select .cse19 4))) (let ((.cse1 (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse6) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse20 (select |v_#valid_BEFORE_CALL_16| .cse20)))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1)))) (.cse2 (= (select .cse19 0) .cse0)) (.cse4 (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse6))) (or (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| .cse6))) (and (let ((.cse3 (= (select .cse10 0) 0))) (or (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) .cse1 .cse2 .cse3 .cse4) (and .cse3 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse9 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse6))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| |c_#memory_$Pointer$#1.base|)) (.cse7 (select .cse9 4))) (and (= .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_16| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse7) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse5 (select |c_#memory_$Pointer$#1.base| .cse5)) |c_#memory_$Pointer$#1.base|) (= |v_#valid_BEFORE_CALL_16| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_16| .cse8)))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse7) 0) .cse6) (= (select .cse9 0) .cse7) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0)))))))) (= (select .cse10 4) 0))) (and (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse6)) (.cse12 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| |c_#memory_$Pointer$#1.offset|))) (and (= (select .cse11 0) 0) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse0) 0) 0) (= (select .cse11 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse12) (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse12 (select |c_#memory_$Pointer$#1.offset| .cse12)))))) .cse1 .cse2 .cse4) (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| (Array Int (Array Int Int)))) (let ((.cse13 (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse6)) (.cse18 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| |c_#memory_$Pointer$#1.offset|))) (and (= (select .cse13 0) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse17 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse6))) (let ((.cse15 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| |c_#memory_$Pointer$#1.base|)) (.cse14 (select .cse17 4))) (and (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse14) 0) 0) (= .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_16| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse14) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse15 (select |c_#memory_$Pointer$#1.base| .cse15)) |c_#memory_$Pointer$#1.base|) (= |v_#valid_BEFORE_CALL_16| (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse16 (select |v_#valid_BEFORE_CALL_16| .cse16)))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_15| .cse14) 0) .cse6) (= (select .cse17 0) .cse14) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0))))) (= (select .cse13 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse18) (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_15| .cse18 (select |c_#memory_$Pointer$#1.offset| .cse18))))))))))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) is different from true [2023-11-22 18:20:51,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:52,038 INFO L349 Elim1Store]: treesize reduction 120, result has 35.8 percent of original size [2023-11-22 18:20:52,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 224 treesize of output 256 [2023-11-22 18:20:52,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 45 treesize of output 69 [2023-11-22 18:20:52,096 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 18:20:52,106 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:52,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 43 [2023-11-22 18:20:52,521 INFO L349 Elim1Store]: treesize reduction 316, result has 32.5 percent of original size [2023-11-22 18:20:52,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 650 treesize of output 675 [2023-11-22 18:20:52,545 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:52,705 INFO L349 Elim1Store]: treesize reduction 352, result has 28.0 percent of original size [2023-11-22 18:20:52,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 719 treesize of output 741 [2023-11-22 18:20:53,229 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 13 treesize of output 5 [2023-11-22 18:20:53,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-22 18:20:53,373 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 621 treesize of output 565 [2023-11-22 18:20:53,845 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 20 [2023-11-22 18:20:53,952 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 618 treesize of output 562 [2023-11-22 18:20:54,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:20:54,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 308 treesize of output 305 [2023-11-22 18:20:54,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:20:54,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 308 treesize of output 305 [2023-11-22 18:20:54,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:20:54,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 597 treesize of output 590 [2023-11-22 18:20:55,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:20:55,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 308 treesize of output 305 [2023-11-22 18:20:55,153 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 16 treesize of output 15 [2023-11-22 18:20:55,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:55,393 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:55,423 INFO L349 Elim1Store]: treesize reduction 166, result has 21.7 percent of original size [2023-11-22 18:20:55,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 335 treesize of output 119 [2023-11-22 18:20:55,521 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:55,573 INFO L349 Elim1Store]: treesize reduction 300, result has 15.0 percent of original size [2023-11-22 18:20:55,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 687 treesize of output 347 [2023-11-22 18:20:55,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:55,861 INFO L349 Elim1Store]: treesize reduction 528, result has 17.4 percent of original size [2023-11-22 18:20:55,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 330 [2023-11-22 18:20:56,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:56,522 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:56,541 INFO L349 Elim1Store]: treesize reduction 83, result has 26.5 percent of original size [2023-11-22 18:20:56,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 319 treesize of output 177 [2023-11-22 18:20:56,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 105 [2023-11-22 18:20:56,561 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 13 treesize of output 11 [2023-11-22 18:20:56,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2023-11-22 18:20:56,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:56,614 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:56,634 INFO L349 Elim1Store]: treesize reduction 83, result has 26.5 percent of original size [2023-11-22 18:20:56,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 358 treesize of output 204 [2023-11-22 18:20:56,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 113 [2023-11-22 18:20:56,670 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 13 treesize of output 11 [2023-11-22 18:20:56,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61 [2023-11-22 18:20:56,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:56,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:56,809 INFO L349 Elim1Store]: treesize reduction 83, result has 26.5 percent of original size [2023-11-22 18:20:56,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 355 treesize of output 191 [2023-11-22 18:20:56,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 124 [2023-11-22 18:20:56,835 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 13 treesize of output 11 [2023-11-22 18:20:56,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2023-11-22 18:20:56,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:56,963 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:56,974 INFO L349 Elim1Store]: treesize reduction 104, result has 8.0 percent of original size [2023-11-22 18:20:56,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 297 treesize of output 135 [2023-11-22 18:20:56,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2023-11-22 18:20:57,013 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 13 treesize of output 11 [2023-11-22 18:20:58,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:58,065 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:58,100 INFO L349 Elim1Store]: treesize reduction 166, result has 21.7 percent of original size [2023-11-22 18:20:58,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 335 treesize of output 119 [2023-11-22 18:20:58,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:58,173 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:58,230 INFO L349 Elim1Store]: treesize reduction 311, result has 19.8 percent of original size [2023-11-22 18:20:58,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 335 treesize of output 139 [2023-11-22 18:20:58,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:58,548 INFO L349 Elim1Store]: treesize reduction 476, result has 16.6 percent of original size [2023-11-22 18:20:58,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 622 treesize of output 315 [2023-11-22 18:20:59,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:59,044 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:59,073 INFO L349 Elim1Store]: treesize reduction 83, result has 26.5 percent of original size [2023-11-22 18:20:59,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 339 treesize of output 191 [2023-11-22 18:20:59,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 105 [2023-11-22 18:20:59,101 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 13 treesize of output 11 [2023-11-22 18:20:59,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2023-11-22 18:20:59,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:59,285 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:59,299 INFO L349 Elim1Store]: treesize reduction 104, result has 8.0 percent of original size [2023-11-22 18:20:59,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 305 treesize of output 143 [2023-11-22 18:20:59,304 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 13 treesize of output 11 [2023-11-22 18:20:59,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2023-11-22 18:20:59,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:59,338 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:59,357 INFO L349 Elim1Store]: treesize reduction 83, result has 26.5 percent of original size [2023-11-22 18:20:59,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 358 treesize of output 204 [2023-11-22 18:20:59,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 105 [2023-11-22 18:20:59,394 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 13 treesize of output 11 [2023-11-22 18:20:59,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 69 [2023-11-22 18:20:59,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:20:59,457 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:20:59,476 INFO L349 Elim1Store]: treesize reduction 83, result has 26.5 percent of original size [2023-11-22 18:20:59,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 339 treesize of output 191 [2023-11-22 18:20:59,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 105 [2023-11-22 18:20:59,511 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 13 treesize of output 11 [2023-11-22 18:20:59,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2023-11-22 18:21:00,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:00,161 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:00,213 INFO L349 Elim1Store]: treesize reduction 311, result has 19.8 percent of original size [2023-11-22 18:21:00,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 335 treesize of output 139 [2023-11-22 18:21:00,440 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:00,492 INFO L349 Elim1Store]: treesize reduction 300, result has 15.0 percent of original size [2023-11-22 18:21:00,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 669 treesize of output 337 [2023-11-22 18:21:01,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:01,270 INFO L349 Elim1Store]: treesize reduction 687, result has 8.0 percent of original size [2023-11-22 18:21:01,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 805 treesize of output 420 [2023-11-22 18:21:01,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:01,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:01,443 INFO L349 Elim1Store]: treesize reduction 65, result has 7.1 percent of original size [2023-11-22 18:21:01,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 97 [2023-11-22 18:21:01,464 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-22 18:21:01,464 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 40 treesize of output 34 [2023-11-22 18:21:01,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:01,649 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:01,676 INFO L349 Elim1Store]: treesize reduction 193, result has 9.0 percent of original size [2023-11-22 18:21:01,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 555 treesize of output 272 [2023-11-22 18:21:01,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:01,774 INFO L349 Elim1Store]: treesize reduction 601, result has 5.9 percent of original size [2023-11-22 18:21:01,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 857 treesize of output 437 [2023-11-22 18:21:01,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:01,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:01,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:01,861 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:01,861 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:01,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:01,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 92 [2023-11-22 18:21:01,874 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 18:21:01,874 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 48 treesize of output 38 [2023-11-22 18:21:02,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:02,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:02,309 INFO L349 Elim1Store]: treesize reduction 193, result has 9.0 percent of original size [2023-11-22 18:21:02,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 555 treesize of output 272 [2023-11-22 18:21:02,506 INFO L349 Elim1Store]: treesize reduction 1259, result has 4.5 percent of original size [2023-11-22 18:21:02,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 1486 treesize of output 711 [2023-11-22 18:21:02,725 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 18:21:02,732 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 18:21:02,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:02,751 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:02,751 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:02,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:02,758 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-11-22 18:21:02,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 573 treesize of output 463 [2023-11-22 18:21:02,767 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-22 18:21:02,767 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 44 treesize of output 38 [2023-11-22 18:21:03,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:03,102 INFO L349 Elim1Store]: treesize reduction 323, result has 8.5 percent of original size [2023-11-22 18:21:03,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 922 treesize of output 511 [2023-11-22 18:21:03,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:03,216 INFO L349 Elim1Store]: treesize reduction 687, result has 8.0 percent of original size [2023-11-22 18:21:03,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 805 treesize of output 420 [2023-11-22 18:21:03,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:03,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:03,381 INFO L349 Elim1Store]: treesize reduction 200, result has 8.3 percent of original size [2023-11-22 18:21:03,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 539 treesize of output 348 [2023-11-22 18:21:03,391 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-22 18:21:03,391 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 283 treesize of output 259 [2023-11-22 18:21:05,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:21:05,176 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:21:05,282 INFO L349 Elim1Store]: treesize reduction 415, result has 20.8 percent of original size [2023-11-22 18:21:05,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 730 treesize of output 454 [2023-11-22 18:21:15,825 INFO L349 Elim1Store]: treesize reduction 1638, result has 36.9 percent of original size [2023-11-22 18:21:15,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 3028 treesize of output 3226 [2023-11-22 18:21:15,916 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 65 treesize of output 47 [2023-11-22 18:21:18,689 INFO L349 Elim1Store]: treesize reduction 400, result has 34.0 percent of original size [2023-11-22 18:21:18,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 866 treesize of output 891 [2023-11-22 18:21:18,872 INFO L224 Elim1Store]: Index analysis took 102 ms [2023-11-22 18:21:22,396 INFO L349 Elim1Store]: treesize reduction 1262, result has 22.7 percent of original size [2023-11-22 18:21:22,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 589 treesize of output 896 [2023-11-22 18:21:30,989 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 18 treesize of output 17 [2023-11-22 18:21:41,544 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 2840 treesize of output 2735 [2023-11-22 18:21:57,089 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 5 treesize of output 3 [2023-11-22 18:21:57,182 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 [2023-11-22 18:21:57,240 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 5 treesize of output 3 [2023-11-22 18:21:57,323 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 [2023-11-22 18:21:57,641 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 13 treesize of output 3 [2023-11-22 18:21:58,410 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 13 treesize of output 3 [2023-11-22 18:21:59,497 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 13 treesize of output 3 [2023-11-22 18:22:00,288 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 13 treesize of output 3 [2023-11-22 18:22:02,001 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 13 treesize of output 3 [2023-11-22 18:22:02,172 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 13 treesize of output 3 [2023-11-22 18:22:05,591 INFO L349 Elim1Store]: treesize reduction 32, result has 44.8 percent of original size [2023-11-22 18:22:05,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2224 treesize of output 2151 [2023-11-22 18:22:13,951 INFO L349 Elim1Store]: treesize reduction 32, result has 44.8 percent of original size [2023-11-22 18:22:13,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2182 treesize of output 2109 [2023-11-22 18:22:39,370 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 55 treesize of output 31 [2023-11-22 18:22:40,673 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 66 treesize of output 34 [2023-11-22 18:22:41,471 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 29 treesize of output 13 [2023-11-22 18:22:43,576 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 32 treesize of output 16 [2023-11-22 18:22:44,184 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 58 treesize of output 34 [2023-11-22 18:22:44,316 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 69 treesize of output 37 [2023-11-22 18:22:46,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2023-11-22 18:22:46,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 47 [2023-11-22 18:22:47,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 966 treesize of output 870 [2023-11-22 18:22:49,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 929 treesize of output 849 [2023-11-22 18:22:51,491 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 42 treesize of output 26 [2023-11-22 18:22:52,770 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 79 treesize of output 47 [2023-11-22 18:22:54,066 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 132 treesize of output 84 [2023-11-22 18:22:56,913 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 966 treesize of output 870 [2023-11-22 18:23:00,753 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 929 treesize of output 849 [2023-11-22 18:23:02,590 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 92 treesize of output 52 [2023-11-22 18:23:03,115 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 73 treesize of output 41 [2023-11-22 18:23:04,827 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 55 treesize of output 31 [2023-11-22 18:23:06,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 755 treesize of output 731 [2023-11-22 18:23:07,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 41 [2023-11-22 18:23:07,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 481 treesize of output 409 [2023-11-22 18:23:08,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2023-11-22 18:23:08,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 31 [2023-11-22 18:23:09,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 36 [2023-11-22 18:23:11,139 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 55 treesize of output 31 [2023-11-22 18:23:12,489 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 73 treesize of output 41 [2023-11-22 18:23:13,160 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 92 treesize of output 52 [2023-11-22 18:23:14,446 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 578 treesize of output 482 [2023-11-22 18:23:18,540 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 145 treesize of output 89 [2023-11-22 18:23:18,971 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 565 treesize of output 477 [2023-11-22 18:23:22,656 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 132 treesize of output 84 [2023-11-22 18:23:22,842 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 558 treesize of output 478 [2023-11-22 18:23:29,596 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 58 treesize of output 34 [2023-11-22 18:23:30,546 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 95 treesize of output 55 [2023-11-22 18:23:32,154 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 55 treesize of output 31 [2023-11-22 18:23:32,674 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 92 treesize of output 52 [2023-11-22 18:23:33,661 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 95 treesize of output 55 [2023-11-22 18:23:34,961 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 58 treesize of output 34 [2023-11-22 18:23:36,379 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 95 treesize of output 55 [2023-11-22 18:23:37,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2023-11-22 18:23:38,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2023-11-22 18:23:39,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 42 [2023-11-22 18:23:39,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 47 [2023-11-22 18:23:39,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 480 treesize of output 416 [2023-11-22 18:23:40,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 42 [2023-11-22 18:23:42,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 545 treesize of output 465 [2023-11-22 18:23:43,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 508 treesize of output 444 [2023-11-22 18:23:43,692 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 558 treesize of output 470 [2023-11-22 18:23:46,282 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 521 treesize of output 449 [2023-11-22 18:23:47,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 532 treesize of output 460 [2023-11-22 18:23:47,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 495 treesize of output 439 [2023-11-22 18:23:50,040 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 545 treesize of output 465 [2023-11-22 18:23:50,406 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 508 treesize of output 444 [2023-11-22 18:23:51,741 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 55 treesize of output 31 [2023-11-22 18:23:52,705 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 92 treesize of output 52 [2023-11-22 18:23:53,503 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 58 treesize of output 34 [2023-11-22 18:23:54,369 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 95 treesize of output 55 [2023-11-22 18:23:55,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 55 [2023-11-22 18:23:56,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2023-11-22 18:23:57,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 528 treesize of output 456 [2023-11-22 18:23:59,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 987 treesize of output 891 [2023-11-22 18:24:07,946 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 1017 treesize of output 913 [2023-11-22 18:24:09,992 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 162 treesize of output 106 [2023-11-22 18:24:10,211 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 558 treesize of output 478 [2023-11-22 18:24:15,615 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 563 treesize of output 483 [2023-11-22 18:24:18,633 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 600 treesize of output 504 [2023-11-22 18:24:19,808 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 146 treesize of output 90 [2023-11-22 18:24:21,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 587 treesize of output 499 [2023-11-22 18:24:23,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 85 [2023-11-22 18:24:24,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 550 treesize of output 478 [2023-11-22 18:24:25,048 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 610 treesize of output 514 [2023-11-22 18:24:29,224 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 573 treesize of output 493 [2023-11-22 18:24:33,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 537 treesize of output 473 [2023-11-22 18:24:35,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 574 treesize of output 494 [2023-11-22 18:24:36,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 80 [2023-11-22 18:24:38,034 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 133 treesize of output 85 [2023-11-22 18:24:39,768 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 587 treesize of output 499 [2023-11-22 18:24:40,257 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 550 treesize of output 478 [2023-11-22 18:24:41,840 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 597 treesize of output 509 [2023-11-22 18:24:45,742 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 560 treesize of output 488 Killed by 15