./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_prepend_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.graphml --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 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 14:34:16,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 14:34:16,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 14:34:16,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 14:34:16,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 14:34:16,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 14:34:16,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 14:34:16,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 14:34:16,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 14:34:16,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 14:34:16,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 14:34:16,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 14:34:16,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 14:34:16,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 14:34:16,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 14:34:16,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 14:34:16,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 14:34:16,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 14:34:16,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 14:34:16,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 14:34:16,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 14:34:16,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 14:34:16,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 14:34:16,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 14:34:16,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 14:34:16,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 14:34:16,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 14:34:16,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 14:34:16,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 14:34:16,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 14:34:16,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 14:34:16,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 14:34:16,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 14:34:16,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 14:34:16,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 14:34:16,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 14:34:16,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 14:34:16,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 14:34:16,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 14:34:16,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 14:34:16,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 14:34:16,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 14:34:16,221 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 14:34:16,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 14:34:16,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 14:34:16,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 14:34:16,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 14:34:16,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 14:34:16,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 14:34:16,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 14:34:16,223 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 14:34:16,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 14:34:16,224 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 14:34:16,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 14:34:16,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 14:34:16,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 14:34:16,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 14:34:16,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 14:34:16,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 14:34:16,225 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 14:34:16,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 14:34:16,226 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 14:34:16,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 14:34:16,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 14:34:16,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 14:34:16,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 14:34:16,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 14:34:16,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 14:34:16,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 14:34:16,227 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 14:34:16,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 14:34:16,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 14:34:16,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 14:34:16,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 14:34:16,228 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 14:34:16,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 14:34:16,228 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 14:34:16,228 INFO L138 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.graphml 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 -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2023-02-18 14:34:16,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 14:34:16,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 14:34:16,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 14:34:16,450 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 14:34:16,450 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 14:34:16,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2023-02-18 14:34:17,455 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 14:34:17,605 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 14:34:17,606 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2023-02-18 14:34:17,612 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a8d99cc/dd2f460593364353be447496d952b196/FLAG612869d66 [2023-02-18 14:34:17,623 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a8d99cc/dd2f460593364353be447496d952b196 [2023-02-18 14:34:17,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 14:34:17,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 14:34:17,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 14:34:17,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 14:34:17,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 14:34:17,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:17,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2115efff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17, skipping insertion in model container [2023-02-18 14:34:17,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:17,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 14:34:17,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 14:34:17,874 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i[24729,24742] [2023-02-18 14:34:17,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 14:34:17,885 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 14:34:17,933 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i[24729,24742] [2023-02-18 14:34:17,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 14:34:17,954 INFO L208 MainTranslator]: Completed translation [2023-02-18 14:34:17,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17 WrapperNode [2023-02-18 14:34:17,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 14:34:17,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 14:34:17,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 14:34:17,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 14:34:17,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:17,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:18,000 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2023-02-18 14:34:18,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 14:34:18,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 14:34:18,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 14:34:18,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 14:34:18,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:18,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:18,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:18,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:18,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:18,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:18,020 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:18,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:18,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 14:34:18,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 14:34:18,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 14:34:18,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 14:34:18,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (1/1) ... [2023-02-18 14:34:18,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 14:34:18,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 14:34:18,050 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-02-18 14:34:18,052 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-02-18 14:34:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-18 14:34:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-18 14:34:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-18 14:34:18,078 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-18 14:34:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 14:34:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 14:34:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-18 14:34:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 14:34:18,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 14:34:18,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 14:34:18,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-18 14:34:18,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 14:34:18,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 14:34:18,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 14:34:18,181 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 14:34:18,182 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 14:34:18,459 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 14:34:18,466 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 14:34:18,472 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-18 14:34:18,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:34:18 BoogieIcfgContainer [2023-02-18 14:34:18,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 14:34:18,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 14:34:18,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 14:34:18,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 14:34:18,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 02:34:17" (1/3) ... [2023-02-18 14:34:18,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b576e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:34:18, skipping insertion in model container [2023-02-18 14:34:18,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:34:17" (2/3) ... [2023-02-18 14:34:18,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b576e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:34:18, skipping insertion in model container [2023-02-18 14:34:18,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:34:18" (3/3) ... [2023-02-18 14:34:18,482 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2023-02-18 14:34:18,493 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 14:34:18,493 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 14:34:18,530 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 14:34:18,534 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=LoopsAndPotentialCycles, 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;@2c4fc9f2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 14:34:18,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 14:34:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-02-18 14:34:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 14:34:18,543 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:34:18,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:34:18,544 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 14:34:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:34:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1640936773, now seen corresponding path program 1 times [2023-02-18 14:34:18,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:34:18,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709592525] [2023-02-18 14:34:18,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:34:18,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:34:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 14:34:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:18,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 14:34:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 14:34:18,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:34:18,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709592525] [2023-02-18 14:34:18,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709592525] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:34:18,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:34:18,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:34:18,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459954297] [2023-02-18 14:34:18,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:34:18,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:34:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:34:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:34:18,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:34:18,777 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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-02-18 14:34:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:34:18,846 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2023-02-18 14:34:18,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:34:18,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 23 [2023-02-18 14:34:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:34:18,852 INFO L225 Difference]: With dead ends: 63 [2023-02-18 14:34:18,852 INFO L226 Difference]: Without dead ends: 28 [2023-02-18 14:34:18,854 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-02-18 14:34:18,856 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:34:18,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:34:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-18 14:34:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-18 14:34:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-02-18 14:34:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-02-18 14:34:18,878 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2023-02-18 14:34:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:34:18,879 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-02-18 14:34:18,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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-02-18 14:34:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-02-18 14:34:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 14:34:18,880 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:34:18,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:34:18,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 14:34:18,881 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 14:34:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:34:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash -376735694, now seen corresponding path program 1 times [2023-02-18 14:34:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:34:18,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219166180] [2023-02-18 14:34:18,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:34:18,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:34:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:18,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 14:34:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 14:34:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 14:34:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:34:18,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219166180] [2023-02-18 14:34:18,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219166180] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:34:18,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:34:18,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:34:18,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146257121] [2023-02-18 14:34:18,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:34:18,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:34:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:34:18,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:34:18,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:34:18,995 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-02-18 14:34:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:34:19,050 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2023-02-18 14:34:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 14:34:19,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2023-02-18 14:34:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:34:19,052 INFO L225 Difference]: With dead ends: 52 [2023-02-18 14:34:19,052 INFO L226 Difference]: Without dead ends: 33 [2023-02-18 14:34:19,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-02-18 14:34:19,056 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 14:34:19,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 76 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 14:34:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-18 14:34:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2023-02-18 14:34:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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-02-18 14:34:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-18 14:34:19,072 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2023-02-18 14:34:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:34:19,073 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-18 14:34:19,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-02-18 14:34:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-02-18 14:34:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 14:34:19,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:34:19,075 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:34:19,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 14:34:19,075 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 14:34:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:34:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash 900211966, now seen corresponding path program 1 times [2023-02-18 14:34:19,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:34:19,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497845982] [2023-02-18 14:34:19,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:34:19,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:34:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 14:34:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:19,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 14:34:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:19,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 14:34:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-18 14:34:19,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:34:19,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497845982] [2023-02-18 14:34:19,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497845982] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 14:34:19,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801711131] [2023-02-18 14:34:19,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:34:19,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 14:34:19,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 14:34:19,560 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-02-18 14:34:19,578 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-02-18 14:34:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:19,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-18 14:34:19,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:34:19,886 INFO L350 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 8 treesize of output 4 [2023-02-18 14:34:19,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:34:19,943 INFO L350 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 15 treesize of output 17 [2023-02-18 14:34:19,964 INFO L350 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-02-18 14:34:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 14:34:19,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 14:34:20,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801711131] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 14:34:20,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 14:34:20,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2023-02-18 14:34:20,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090141879] [2023-02-18 14:34:20,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 14:34:20,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 14:34:20,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:34:20,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 14:34:20,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=610, Unknown=9, NotChecked=0, Total=702 [2023-02-18 14:34:20,070 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 25 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 14:34:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:34:20,620 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2023-02-18 14:34:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 14:34:20,620 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2023-02-18 14:34:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:34:20,621 INFO L225 Difference]: With dead ends: 57 [2023-02-18 14:34:20,621 INFO L226 Difference]: Without dead ends: 33 [2023-02-18 14:34:20,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1000, Unknown=9, NotChecked=0, Total=1190 [2023-02-18 14:34:20,622 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 108 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 14:34:20,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 228 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 14:34:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-18 14:34:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-02-18 14:34:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-02-18 14:34:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-02-18 14:34:20,627 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 33 [2023-02-18 14:34:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:34:20,627 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-02-18 14:34:20,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 14:34:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-02-18 14:34:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 14:34:20,628 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:34:20,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:34:20,647 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-02-18 14:34:20,836 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-02-18 14:34:20,836 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 14:34:20,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:34:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash 900271548, now seen corresponding path program 1 times [2023-02-18 14:34:20,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:34:20,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735695493] [2023-02-18 14:34:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:34:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:34:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 14:34:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:23,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 14:34:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 14:34:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-18 14:34:24,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:34:24,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735695493] [2023-02-18 14:34:24,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735695493] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 14:34:24,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366924959] [2023-02-18 14:34:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:34:24,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 14:34:24,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 14:34:24,183 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-02-18 14:34:24,184 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-02-18 14:34:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:34:24,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 134 conjunts are in the unsatisfiable core [2023-02-18 14:34:24,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:34:24,365 INFO L350 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-02-18 14:34:24,451 INFO L350 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-02-18 14:34:24,513 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 1) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse0 (select |c_#valid| .cse0)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))))) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (- 1))) (<= 0 .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 0) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (- 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-18 14:34:24,514 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 1) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse0 (select |c_#valid| .cse0)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))))) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (- 1))) (<= 0 .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 0) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (- 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-18 14:34:24,520 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (<= 0 .cse0) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (- 1))) (or (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse1 (select |c_#valid| .cse1)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= .cse0 0) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (- 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-18 14:34:24,522 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (<= 0 .cse0) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (- 1))) (or (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse1 (select |c_#valid| .cse1)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= .cse0 0) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (- 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-18 14:34:24,529 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= (store |v_#valid_BEFORE_CALL_2| .cse0 (select |c_#valid| .cse0)) |c_#valid|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))))) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (- 1))) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (- 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= 0 .cse1) (<= .cse1 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-18 14:34:24,531 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= (store |v_#valid_BEFORE_CALL_2| .cse0 (select |c_#valid| .cse0)) |c_#valid|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))))) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (- 1))) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (- 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= 0 .cse1) (<= .cse1 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-18 14:34:24,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:34:24,545 INFO L350 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 40 treesize of output 108 [2023-02-18 14:34:24,552 INFO L350 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 26 treesize of output 22 [2023-02-18 14:34:24,564 INFO L350 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 50 treesize of output 40 [2023-02-18 14:34:24,573 INFO L350 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 116 treesize of output 49 [2023-02-18 14:34:24,578 INFO L350 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 9 [2023-02-18 14:34:24,642 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (<= .cse0 0) (<= 0 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (- 1))) (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse7 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse5 (select .cse6 .cse7))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_3 .cse7))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2)) (.cse4 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse2))) (and (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse1 (select |c_#valid| .cse1)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse2) 1)))) (= .cse3 .cse4) (= .cse5 .cse2) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2) (= .cse4 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse2) (- 1))) (= .cse3 .cse6) (= v_DerPreprocessor_2 .cse4))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_3 .cse7))) (let ((.cse10 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse9))) (and (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse8 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse8 (select |c_#valid| .cse8)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse9) 1)))) (= (select |c_#memory_$Pointer$.base| .cse9) .cse10) (= .cse5 .cse9) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse9) (= .cse10 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse9) (- 1))) (not (= .cse9 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= v_DerPreprocessor_2 .cse10))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_3 .cse7))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse13)) (.cse12 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse13))) (and (= .cse11 .cse12) (= .cse5 .cse13) (= (select |c_#valid| .cse13) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse13) (= .cse12 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse13) (- 1))) (= .cse11 .cse6) (= v_DerPreprocessor_2 .cse12))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse14 (select v_DerPreprocessor_3 .cse7))) (let ((.cse15 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse14 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse14))) (and (= .cse14 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= .cse5 .cse14) (= (select |c_#valid| .cse14) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse14) (= .cse15 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse14) (- 1))) (= (select |c_#memory_$Pointer$.base| .cse14) .cse6) (= v_DerPreprocessor_2 .cse15))))) (and (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse5) (- 1))) (or (= (select |c_#memory_$Pointer$.base| .cse5) .cse6) (not (= .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse5)) (or (= (select |c_#valid| .cse5) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse16 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (select |v_#valid_BEFORE_CALL_2| .cse5) 1) (= (store |v_#valid_BEFORE_CALL_2| .cse16 (select |c_#valid| .cse16)) |c_#valid|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse17 (select v_DerPreprocessor_3 .cse7))) (let ((.cse18 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse17 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse17 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse17))) (and (= (select |c_#memory_$Pointer$.base| .cse17) .cse18) (= .cse5 .cse17) (= (select |c_#valid| .cse17) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse17) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse17) (- 1))) (not (= .cse17 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= v_DerPreprocessor_2 .cse18))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse20 (select v_DerPreprocessor_3 .cse7))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse20)) (.cse22 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse20 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse20 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse20))) (and (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse19 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse19 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse19 (select |c_#valid| .cse19)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse20) 1)))) (= .cse21 .cse22) (= .cse5 .cse20) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse20) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse20) (- 1))) (not (= .cse20 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= .cse21 .cse6) (= v_DerPreprocessor_2 .cse22))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse25 (select v_DerPreprocessor_3 .cse7))) (let ((.cse23 (select |c_#memory_$Pointer$.base| .cse25)) (.cse24 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse25 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse25 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse25))) (and (= .cse23 .cse24) (= .cse5 .cse25) (= (select |c_#valid| .cse25) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse25) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse25) (- 1))) (not (= .cse25 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= .cse23 .cse6) (= v_DerPreprocessor_2 .cse24))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse27 (select v_DerPreprocessor_3 .cse7))) (let ((.cse28 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse27 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse27 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse27))) (and (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse26 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse26 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse26 (select |c_#valid| .cse26)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse27) 1)))) (= (select |c_#memory_$Pointer$.base| .cse27) .cse28) (= .cse5 .cse27) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse27) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse27) (- 1))) (not (= .cse27 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= v_DerPreprocessor_2 .cse28))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse29 (select v_DerPreprocessor_3 .cse7))) (let ((.cse31 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse29 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse29 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse29))) (and (= .cse29 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse30 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse30 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse30 (select |c_#valid| .cse30)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse29) 1)))) (= .cse5 .cse29) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse29) (= .cse31 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse29) (- 1))) (= (select |c_#memory_$Pointer$.base| .cse29) .cse6) (= v_DerPreprocessor_2 .cse31))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse32 (select v_DerPreprocessor_3 .cse7))) (let ((.cse33 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse32 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse32 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse32))) (and (= (select |c_#memory_$Pointer$.base| .cse32) .cse33) (= .cse5 .cse32) (= (select |c_#valid| .cse32) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse32) (= .cse33 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse32) (- 1))) (not (= .cse32 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= v_DerPreprocessor_2 .cse33)))))))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-18 14:34:24,649 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (<= .cse0 0) (<= 0 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (- 1))) (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse7 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse5 (select .cse6 .cse7))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_3 .cse7))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2)) (.cse4 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse2))) (and (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse1 (select |c_#valid| .cse1)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse2) 1)))) (= .cse3 .cse4) (= .cse5 .cse2) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2) (= .cse4 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse2) (- 1))) (= .cse3 .cse6) (= v_DerPreprocessor_2 .cse4))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_3 .cse7))) (let ((.cse10 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse9))) (and (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse8 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse8 (select |c_#valid| .cse8)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse9) 1)))) (= (select |c_#memory_$Pointer$.base| .cse9) .cse10) (= .cse5 .cse9) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse9) (= .cse10 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse9) (- 1))) (not (= .cse9 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= v_DerPreprocessor_2 .cse10))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_3 .cse7))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse13)) (.cse12 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse13))) (and (= .cse11 .cse12) (= .cse5 .cse13) (= (select |c_#valid| .cse13) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse13) (= .cse12 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse13) (- 1))) (= .cse11 .cse6) (= v_DerPreprocessor_2 .cse12))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse14 (select v_DerPreprocessor_3 .cse7))) (let ((.cse15 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse14 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse14))) (and (= .cse14 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= .cse5 .cse14) (= (select |c_#valid| .cse14) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse14) (= .cse15 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse14) (- 1))) (= (select |c_#memory_$Pointer$.base| .cse14) .cse6) (= v_DerPreprocessor_2 .cse15))))) (and (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse5) (- 1))) (or (= (select |c_#memory_$Pointer$.base| .cse5) .cse6) (not (= .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse5)) (or (= (select |c_#valid| .cse5) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse16 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (select |v_#valid_BEFORE_CALL_2| .cse5) 1) (= (store |v_#valid_BEFORE_CALL_2| .cse16 (select |c_#valid| .cse16)) |c_#valid|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse17 (select v_DerPreprocessor_3 .cse7))) (let ((.cse18 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse17 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse17 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse17))) (and (= (select |c_#memory_$Pointer$.base| .cse17) .cse18) (= .cse5 .cse17) (= (select |c_#valid| .cse17) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse17) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse17) (- 1))) (not (= .cse17 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= v_DerPreprocessor_2 .cse18))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse20 (select v_DerPreprocessor_3 .cse7))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse20)) (.cse22 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse20 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse20 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse20))) (and (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse19 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse19 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse19 (select |c_#valid| .cse19)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse20) 1)))) (= .cse21 .cse22) (= .cse5 .cse20) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse20) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse20) (- 1))) (not (= .cse20 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= .cse21 .cse6) (= v_DerPreprocessor_2 .cse22))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse25 (select v_DerPreprocessor_3 .cse7))) (let ((.cse23 (select |c_#memory_$Pointer$.base| .cse25)) (.cse24 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse25 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse25 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse25))) (and (= .cse23 .cse24) (= .cse5 .cse25) (= (select |c_#valid| .cse25) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse25) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse25) (- 1))) (not (= .cse25 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= .cse23 .cse6) (= v_DerPreprocessor_2 .cse24))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse27 (select v_DerPreprocessor_3 .cse7))) (let ((.cse28 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse27 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse27 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse27))) (and (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse26 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse26 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse26 (select |c_#valid| .cse26)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse27) 1)))) (= (select |c_#memory_$Pointer$.base| .cse27) .cse28) (= .cse5 .cse27) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse27) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse27) (- 1))) (not (= .cse27 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= v_DerPreprocessor_2 .cse28))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse29 (select v_DerPreprocessor_3 .cse7))) (let ((.cse31 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse29 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse29 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse29))) (and (= .cse29 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse30 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse30 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (store |v_#valid_BEFORE_CALL_2| .cse30 (select |c_#valid| .cse30)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse29) 1)))) (= .cse5 .cse29) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse29) (= .cse31 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse29) (- 1))) (= (select |c_#memory_$Pointer$.base| .cse29) .cse6) (= v_DerPreprocessor_2 .cse31))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse32 (select v_DerPreprocessor_3 .cse7))) (let ((.cse33 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse32 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse32 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_3) .cse32))) (and (= (select |c_#memory_$Pointer$.base| .cse32) .cse33) (= .cse5 .cse32) (= (select |c_#valid| .cse32) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse32) (= .cse33 v_DerPreprocessor_3) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse32) (- 1))) (not (= .cse32 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= v_DerPreprocessor_2 .cse33)))))))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-18 14:34:24,722 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse35 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (* (- 1) .cse35)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse0) (- 1))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 0) (<= 0 .cse1) (= |c_ULTIMATE.start_dll_circular_prepend_~data#1| |c_ULTIMATE.start_main_~uneq~0#1|) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse8 (+ 4 .cse35))) (let ((.cse4 (select .cse3 .cse8))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select v_DerPreprocessor_3 .cse8))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse5)) (.cse6 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse5 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse5))) (and (= .cse2 .cse3) (= .cse4 .cse5) (= .cse2 .cse6) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse7 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse7 (select |c_#valid| .cse7)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse5) 1)))) (not (= .cse5 .cse0)) (= v_DerPreprocessor_2 .cse6) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse5) (- 1))) (= .cse0 .cse5))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_3 .cse8))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse9))) (and (= (select |c_#memory_$Pointer$.base| .cse9) .cse3) (= .cse4 .cse9) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse10 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse10 (select |c_#valid| .cse10)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse9) 1)))) (= .cse11 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse11) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse9) (- 1))) (= .cse9 .cse0) (= .cse0 .cse9))))) (and (not (= .cse0 .cse4)) (or (= (select |c_#memory_$Pointer$.base| .cse4) .cse3) (not (= .cse4 .cse0))) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse4) (- 1))) (or (= (select |c_#valid| .cse4) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_2| .cse4) 1) (= .cse12 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse12 (select |c_#valid| .cse12)) |c_#valid|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse14 (select v_DerPreprocessor_3 .cse8))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse14)) (.cse15 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse14 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse14))) (and (= .cse13 .cse3) (= .cse4 .cse14) (= .cse13 .cse15) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse16 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse16 (select |c_#valid| .cse16)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse14) 1)))) (= .cse15 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse15) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse14) (- 1))) (= .cse0 .cse14))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse17 (select v_DerPreprocessor_3 .cse8))) (let ((.cse18 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse17 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse17 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse17))) (and (= .cse4 .cse17) (= (select |c_#memory_$Pointer$.base| .cse17) .cse18) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse19 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse19 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse19 (select |c_#valid| .cse19)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse17) 1)))) (not (= .cse17 .cse0)) (= .cse18 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse18) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse17) (- 1))) (= .cse0 .cse17))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse21 (select v_DerPreprocessor_3 .cse8))) (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse21)) (.cse22 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse21 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse21 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse21))) (and (= .cse20 .cse3) (= .cse4 .cse21) (= .cse20 .cse22) (not (= .cse21 .cse0)) (= v_DerPreprocessor_2 .cse22) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse21) (- 1))) (= .cse0 .cse21) (= (select |c_#valid| .cse21) 1))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse23 (select v_DerPreprocessor_3 .cse8))) (let ((.cse24 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse23 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse23 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse23))) (and (= .cse4 .cse23) (= (select |c_#memory_$Pointer$.base| .cse23) .cse24) (not (= .cse23 .cse0)) (= .cse24 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse24) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse23) (- 1))) (= .cse0 .cse23) (= (select |c_#valid| .cse23) 1))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse26 (select v_DerPreprocessor_3 .cse8))) (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse26)) (.cse27 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse26 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse26 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse26))) (and (= .cse25 .cse3) (= .cse4 .cse26) (= .cse25 .cse27) (= .cse27 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse27) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse26) (- 1))) (= .cse0 .cse26) (= (select |c_#valid| .cse26) 1))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse28 (select v_DerPreprocessor_3 .cse8))) (let ((.cse29 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse28 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse28 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse28))) (and (= (select |c_#memory_$Pointer$.base| .cse28) .cse3) (= .cse4 .cse28) (= .cse29 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse29) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse28) (- 1))) (= .cse28 .cse0) (= .cse0 .cse28) (= (select |c_#valid| .cse28) 1))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse30 (select v_DerPreprocessor_3 .cse8))) (let ((.cse31 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse30 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse30 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse30))) (and (= .cse4 .cse30) (= (select |c_#memory_$Pointer$.base| .cse30) .cse31) (not (= .cse30 .cse0)) (= v_DerPreprocessor_2 .cse31) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse30) (- 1))) (= .cse0 .cse30) (= (select |c_#valid| .cse30) 1))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse32 (select v_DerPreprocessor_3 .cse8))) (let ((.cse33 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse32 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse32 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse32))) (and (= .cse4 .cse32) (= (select |c_#memory_$Pointer$.base| .cse32) .cse33) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse34 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse34 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse34 (select |c_#valid| .cse34)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse32) 1)))) (not (= .cse32 .cse0)) (= v_DerPreprocessor_2 .cse33) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse32) (- 1))) (= .cse0 .cse32)))))))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-18 14:34:24,728 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse35 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (* (- 1) .cse35)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse0) (- 1))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 0) (<= 0 .cse1) (= |c_ULTIMATE.start_dll_circular_prepend_~data#1| |c_ULTIMATE.start_main_~uneq~0#1|) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse8 (+ 4 .cse35))) (let ((.cse4 (select .cse3 .cse8))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select v_DerPreprocessor_3 .cse8))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse5)) (.cse6 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse5 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse5))) (and (= .cse2 .cse3) (= .cse4 .cse5) (= .cse2 .cse6) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse7 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse7 (select |c_#valid| .cse7)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse5) 1)))) (not (= .cse5 .cse0)) (= v_DerPreprocessor_2 .cse6) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse5) (- 1))) (= .cse0 .cse5))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_3 .cse8))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse9))) (and (= (select |c_#memory_$Pointer$.base| .cse9) .cse3) (= .cse4 .cse9) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse10 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse10 (select |c_#valid| .cse10)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse9) 1)))) (= .cse11 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse11) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse9) (- 1))) (= .cse9 .cse0) (= .cse0 .cse9))))) (and (not (= .cse0 .cse4)) (or (= (select |c_#memory_$Pointer$.base| .cse4) .cse3) (not (= .cse4 .cse0))) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse4) (- 1))) (or (= (select |c_#valid| .cse4) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_2| .cse4) 1) (= .cse12 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse12 (select |c_#valid| .cse12)) |c_#valid|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse14 (select v_DerPreprocessor_3 .cse8))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse14)) (.cse15 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse14 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse14))) (and (= .cse13 .cse3) (= .cse4 .cse14) (= .cse13 .cse15) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse16 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse16 (select |c_#valid| .cse16)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse14) 1)))) (= .cse15 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse15) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse14) (- 1))) (= .cse0 .cse14))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse17 (select v_DerPreprocessor_3 .cse8))) (let ((.cse18 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse17 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse17 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse17))) (and (= .cse4 .cse17) (= (select |c_#memory_$Pointer$.base| .cse17) .cse18) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse19 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse19 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse19 (select |c_#valid| .cse19)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse17) 1)))) (not (= .cse17 .cse0)) (= .cse18 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse18) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse17) (- 1))) (= .cse0 .cse17))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse21 (select v_DerPreprocessor_3 .cse8))) (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse21)) (.cse22 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse21 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse21 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse21))) (and (= .cse20 .cse3) (= .cse4 .cse21) (= .cse20 .cse22) (not (= .cse21 .cse0)) (= v_DerPreprocessor_2 .cse22) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse21) (- 1))) (= .cse0 .cse21) (= (select |c_#valid| .cse21) 1))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse23 (select v_DerPreprocessor_3 .cse8))) (let ((.cse24 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse23 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse23 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse23))) (and (= .cse4 .cse23) (= (select |c_#memory_$Pointer$.base| .cse23) .cse24) (not (= .cse23 .cse0)) (= .cse24 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse24) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse23) (- 1))) (= .cse0 .cse23) (= (select |c_#valid| .cse23) 1))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse26 (select v_DerPreprocessor_3 .cse8))) (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse26)) (.cse27 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse26 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse26 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse26))) (and (= .cse25 .cse3) (= .cse4 .cse26) (= .cse25 .cse27) (= .cse27 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse27) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse26) (- 1))) (= .cse0 .cse26) (= (select |c_#valid| .cse26) 1))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse28 (select v_DerPreprocessor_3 .cse8))) (let ((.cse29 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse28 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse28 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse28))) (and (= (select |c_#memory_$Pointer$.base| .cse28) .cse3) (= .cse4 .cse28) (= .cse29 v_DerPreprocessor_3) (= v_DerPreprocessor_2 .cse29) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse28) (- 1))) (= .cse28 .cse0) (= .cse0 .cse28) (= (select |c_#valid| .cse28) 1))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse30 (select v_DerPreprocessor_3 .cse8))) (let ((.cse31 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse30 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse30 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse30))) (and (= .cse4 .cse30) (= (select |c_#memory_$Pointer$.base| .cse30) .cse31) (not (= .cse30 .cse0)) (= v_DerPreprocessor_2 .cse31) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse30) (- 1))) (= .cse0 .cse30) (= (select |c_#valid| .cse30) 1))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse32 (select v_DerPreprocessor_3 .cse8))) (let ((.cse33 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse32 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse32 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_3) .cse32))) (and (= .cse4 .cse32) (= (select |c_#memory_$Pointer$.base| .cse32) .cse33) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse34 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (and (= .cse34 .cse0) (= (store |v_#valid_BEFORE_CALL_2| .cse34 (select |c_#valid| .cse34)) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_2| .cse32) 1)))) (not (= .cse32 .cse0)) (= v_DerPreprocessor_2 .cse33) (<= 0 (+ |c_#StackHeapBarrier| (* (- 1) .cse32) (- 1))) (= .cse0 .cse32)))))))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-18 14:34:24,790 INFO L350 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 2475 treesize of output 1867 [2023-02-18 14:34:24,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:34:24,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 78 case distinctions, treesize of input 1742 treesize of output 2430 [2023-02-18 14:34:32,326 INFO L350 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 163 treesize of output 119 [2023-02-18 14:34:32,668 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:32,679 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:32,690 INFO L350 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 163 treesize of output 119 [2023-02-18 14:34:32,917 INFO L350 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 163 treesize of output 119 [2023-02-18 14:34:33,152 INFO L350 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 163 treesize of output 119 [2023-02-18 14:34:33,421 INFO L350 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 163 treesize of output 119 [2023-02-18 14:34:33,645 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:33,660 INFO L350 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 214 treesize of output 150 [2023-02-18 14:34:33,670 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:33,681 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:33,711 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:33,725 INFO L350 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 155 treesize of output 111 [2023-02-18 14:34:33,798 INFO L350 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 155 treesize of output 111 [2023-02-18 14:34:33,858 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:33,869 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:33,881 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:33,892 INFO L350 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 155 treesize of output 111 [2023-02-18 14:34:33,953 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:33,963 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:33,978 INFO L350 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 206 treesize of output 142 [2023-02-18 14:34:33,993 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,018 INFO L350 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 153 treesize of output 109 [2023-02-18 14:34:34,061 INFO L350 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 153 treesize of output 109 [2023-02-18 14:34:34,099 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,111 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,124 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,136 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,149 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,166 INFO L350 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 204 treesize of output 140 [2023-02-18 14:34:34,181 INFO L350 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 153 treesize of output 109 [2023-02-18 14:34:34,224 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,236 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,262 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,271 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,281 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,294 INFO L350 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 172 treesize of output 116 [2023-02-18 14:34:34,305 INFO L350 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 131 treesize of output 91 [2023-02-18 14:34:34,326 INFO L350 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 131 treesize of output 91 [2023-02-18 14:34:34,344 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,357 INFO L350 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 131 treesize of output 91 [2023-02-18 14:34:34,376 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,386 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,397 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,418 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,434 INFO L350 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 184 treesize of output 124 [2023-02-18 14:34:34,448 INFO L350 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 143 treesize of output 99 [2023-02-18 14:34:34,470 INFO L350 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 143 treesize of output 99 [2023-02-18 14:34:34,491 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,507 INFO L350 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 143 treesize of output 99 [2023-02-18 14:34:34,528 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,540 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,554 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,567 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,582 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,604 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,619 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,634 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,655 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,672 INFO L350 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 139 treesize of output 95 [2023-02-18 14:34:34,694 INFO L350 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 139 treesize of output 95 [2023-02-18 14:34:34,713 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,733 INFO L350 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 180 treesize of output 120 [2023-02-18 14:34:34,750 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,769 INFO L350 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 139 treesize of output 95 [2023-02-18 14:34:34,790 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,820 INFO L350 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 172 treesize of output 112 [2023-02-18 14:34:34,840 INFO L350 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 131 treesize of output 87 [2023-02-18 14:34:34,858 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,875 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,895 INFO L350 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 131 treesize of output 87 [2023-02-18 14:34:34,916 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,935 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,955 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,973 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:34,994 INFO L350 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 131 treesize of output 87 [2023-02-18 14:34:35,019 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,041 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,062 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,087 INFO L350 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 168 treesize of output 108 [2023-02-18 14:34:35,109 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,133 INFO L350 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 127 treesize of output 83 [2023-02-18 14:34:35,157 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,178 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,202 INFO L350 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 127 treesize of output 83 [2023-02-18 14:34:35,227 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,252 INFO L350 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 127 treesize of output 83 [2023-02-18 14:34:35,274 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,306 INFO L350 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 1368 treesize of output 1300 [2023-02-18 14:34:35,382 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,392 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,402 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,414 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,428 INFO L350 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 180 treesize of output 120 [2023-02-18 14:34:35,439 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,452 INFO L350 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 139 treesize of output 95 [2023-02-18 14:34:35,465 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,479 INFO L350 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 139 treesize of output 95 [2023-02-18 14:34:35,496 INFO L350 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 139 treesize of output 95 [2023-02-18 14:34:35,513 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,528 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,541 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,560 INFO L350 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 159 treesize of output 115 [2023-02-18 14:34:35,695 INFO L350 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 159 treesize of output 115 [2023-02-18 14:34:35,789 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,804 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,821 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,835 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,851 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:35,876 INFO L350 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 210 treesize of output 146 [2023-02-18 14:34:35,888 INFO L350 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 159 treesize of output 115 [2023-02-18 14:34:36,037 INFO L350 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 214 treesize of output 150 [2023-02-18 14:34:36,055 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:36,074 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:36,106 INFO L350 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 163 treesize of output 119 [2023-02-18 14:34:36,286 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:36,299 INFO L350 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 163 treesize of output 119 [2023-02-18 14:34:36,458 INFO L350 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 163 treesize of output 119 [2023-02-18 14:34:36,623 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:36,633 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:36,646 INFO L350 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 163 treesize of output 119 [2023-02-18 14:34:36,802 INFO L350 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 163 treesize of output 119 [2023-02-18 14:34:36,961 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:36,975 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:36,996 INFO L350 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 994 treesize of output 902 [2023-02-18 14:34:37,011 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:37,027 INFO L350 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 943 treesize of output 871 [2023-02-18 14:34:40,395 INFO L350 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 943 treesize of output 871 [2023-02-18 14:34:45,470 INFO L350 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 943 treesize of output 871 [2023-02-18 14:34:51,191 INFO L350 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 1081 treesize of output 1005 [2023-02-18 14:34:56,777 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:34:56,803 INFO L350 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 943 treesize of output 871 [2023-02-18 14:35:01,785 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:01,864 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:01,893 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:01,919 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:01,938 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:01,968 INFO L350 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 941 treesize of output 873 [2023-02-18 14:35:03,887 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:03,906 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:03,934 INFO L350 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 992 treesize of output 904 [2023-02-18 14:35:03,982 INFO L350 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 941 treesize of output 873 [2023-02-18 14:35:08,532 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:08,564 INFO L350 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 1090 treesize of output 1014 [2023-02-18 14:35:10,956 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:10,976 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:10,994 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,025 INFO L350 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 210 treesize of output 146 [2023-02-18 14:35:11,050 INFO L350 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 159 treesize of output 115 [2023-02-18 14:35:11,158 INFO L350 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 159 treesize of output 115 [2023-02-18 14:35:11,272 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,290 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,312 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,362 INFO L350 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 159 treesize of output 115 [2023-02-18 14:35:11,511 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,628 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,643 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,680 INFO L350 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 151 treesize of output 107 [2023-02-18 14:35:11,747 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,773 INFO L350 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 202 treesize of output 138 [2023-02-18 14:35:11,809 INFO L350 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 151 treesize of output 107 [2023-02-18 14:35:11,878 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,897 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,918 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,940 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:11,966 INFO L350 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 151 treesize of output 107 [2023-02-18 14:35:12,035 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:12,063 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:12,091 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:12,117 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:12,155 INFO L350 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 984 treesize of output 896 [2023-02-18 14:35:12,191 INFO L350 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 933 treesize of output 865 [2023-02-18 14:35:13,305 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:13,330 INFO L350 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 933 treesize of output 865 [2023-02-18 14:35:14,463 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:14,490 INFO L350 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 1082 treesize of output 1006 [2023-02-18 14:35:14,859 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:14,916 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:14,944 INFO L350 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 931 treesize of output 863 [2023-02-18 14:35:15,647 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:15,673 INFO L350 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 1064 treesize of output 992 [2023-02-18 14:35:16,315 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:16,357 INFO L350 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 931 treesize of output 863 [2023-02-18 14:35:16,718 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:16,743 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:16,763 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:16,793 INFO L350 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 982 treesize of output 894 [2023-02-18 14:35:16,815 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:16,844 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:16,867 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:16,892 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:16,915 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:16,949 INFO L350 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 149 treesize of output 105 [2023-02-18 14:35:16,995 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:17,020 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:17,049 INFO L350 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 200 treesize of output 136 [2023-02-18 14:35:17,079 INFO L350 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 149 treesize of output 105 [2023-02-18 14:35:17,142 INFO L350 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 149 treesize of output 105 [2023-02-18 14:35:17,185 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:17,247 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:17,279 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:17,315 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:17,359 INFO L350 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 966 treesize of output 882 [2023-02-18 14:35:17,422 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:17,456 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:17,494 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:17,528 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:17,582 INFO L350 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 925 treesize of output 857 [2023-02-18 14:35:17,989 INFO L350 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 925 treesize of output 857 [2023-02-18 14:35:18,183 INFO L350 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 1074 treesize of output 998 [2023-02-18 14:35:18,610 INFO L350 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 143 treesize of output 99 [2023-02-18 14:35:18,643 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:18,668 INFO L350 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 184 treesize of output 124 [2023-02-18 14:35:18,698 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:18,723 INFO L350 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 143 treesize of output 99 [2023-02-18 14:35:18,762 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:18,785 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:18,805 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:18,837 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:18,864 INFO L350 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 143 treesize of output 99 [2023-02-18 14:35:18,894 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:18,954 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:18,984 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,015 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,044 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,079 INFO L350 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 180 treesize of output 120 [2023-02-18 14:35:19,109 INFO L350 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 139 treesize of output 95 [2023-02-18 14:35:19,152 INFO L350 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 139 treesize of output 95 [2023-02-18 14:35:19,184 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,219 INFO L350 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 139 treesize of output 95 [2023-02-18 14:35:19,252 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,285 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,323 INFO L350 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 143 treesize of output 95 [2023-02-18 14:35:19,359 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,397 INFO L350 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 143 treesize of output 95 [2023-02-18 14:35:19,433 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,469 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,513 INFO L350 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 143 treesize of output 95 [2023-02-18 14:35:19,548 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,583 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,622 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,660 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,706 INFO L350 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 180 treesize of output 116 [2023-02-18 14:35:19,752 INFO L350 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 168 treesize of output 108 [2023-02-18 14:35:19,798 INFO L350 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 172 treesize of output 112 [2023-02-18 14:35:19,843 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,884 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:19,933 INFO L350 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 139 treesize of output 95 [2023-02-18 14:35:19,990 INFO L350 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 139 treesize of output 95 [2023-02-18 14:35:20,042 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:20,088 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:20,140 INFO L350 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 180 treesize of output 120 [2023-02-18 14:35:20,181 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:20,230 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:20,276 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:20,344 INFO L350 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 139 treesize of output 95 [2023-02-18 14:35:20,419 INFO L350 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 2647 treesize of output 2363 [2023-02-18 14:35:20,743 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:20,771 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:20,797 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:20,838 INFO L350 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 968 treesize of output 880 [2023-02-18 14:35:20,873 INFO L350 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 954 treesize of output 870 [2023-02-18 14:35:20,908 INFO L350 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 168 treesize of output 108 [2023-02-18 14:35:20,946 INFO L350 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 180 treesize of output 116 [2023-02-18 14:35:20,986 INFO L350 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 406 treesize of output 342 [2023-02-18 14:35:21,018 INFO L350 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 168 treesize of output 108 [2023-02-18 14:35:21,045 INFO L350 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 180 treesize of output 116 [2023-02-18 14:35:21,075 INFO L350 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 168 treesize of output 108 [2023-02-18 14:35:21,107 INFO L350 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 180 treesize of output 116 [2023-02-18 14:35:21,141 INFO L350 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 180 treesize of output 116 [2023-02-18 14:35:21,172 INFO L350 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 168 treesize of output 108 [2023-02-18 14:35:21,216 INFO L350 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 974 treesize of output 886 [2023-02-18 14:35:21,277 INFO L350 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 3290 treesize of output 3138 [2023-02-18 14:35:21,688 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:21,717 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:21,746 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:21,779 INFO L350 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 3290 treesize of output 3138 [2023-02-18 14:35:22,161 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:22,204 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:22,235 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:22,268 INFO L350 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 139 treesize of output 99 [2023-02-18 14:35:22,314 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:22,341 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:22,370 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:22,406 INFO L350 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 139 treesize of output 99 [2023-02-18 14:35:22,459 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:22,490 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:22,529 INFO L350 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 190 treesize of output 130 [2023-02-18 14:35:22,581 INFO L350 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 139 treesize of output 99 [2023-02-18 14:35:22,669 INFO L350 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 1102 treesize of output 1022 [2023-02-18 14:35:25,867 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:25,891 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:25,920 INFO L350 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 953 treesize of output 881 [2023-02-18 14:35:27,746 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:27,775 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:27,801 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:27,838 INFO L350 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 1004 treesize of output 912 [2023-02-18 14:35:27,879 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:27,911 INFO L350 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 953 treesize of output 881 [2023-02-18 14:35:30,419 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:30,466 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:30,487 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:30,515 INFO L350 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 949 treesize of output 881 [2023-02-18 14:35:42,410 INFO L350 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 1000 treesize of output 912 [2023-02-18 14:35:42,433 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:42,456 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:42,478 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:42,501 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:35:42,531 INFO L350 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 949 treesize of output 881 [2023-02-18 14:36:06,774 INFO L350 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 1098 treesize of output 1022 [2023-02-18 14:36:19,679 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:19,726 INFO L350 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 167 treesize of output 123 [2023-02-18 14:36:20,084 INFO L350 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 167 treesize of output 123 [2023-02-18 14:36:20,443 INFO L350 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 218 treesize of output 154 [2023-02-18 14:36:20,468 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:20,489 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:20,520 INFO L350 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 167 treesize of output 123 [2023-02-18 14:36:20,864 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:20,889 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:20,918 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:20,943 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:20,971 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:21,016 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:21,050 INFO L350 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 167 treesize of output 123 [2023-02-18 14:36:21,338 INFO L350 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 167 treesize of output 123 [2023-02-18 14:36:21,710 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:21,742 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:21,768 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:21,794 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:21,815 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:21,837 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:21,870 INFO L350 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 167 treesize of output 123 [2023-02-18 14:36:22,251 INFO L350 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 218 treesize of output 154 [2023-02-18 14:36:22,321 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:22,353 INFO L350 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 171 treesize of output 127 [2023-02-18 14:36:22,972 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:22,996 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:23,026 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:23,049 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:23,079 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:23,112 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:23,150 INFO L350 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 171 treesize of output 127 [2023-02-18 14:36:23,723 INFO L350 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 171 treesize of output 127 [2023-02-18 14:36:24,446 INFO L350 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 222 treesize of output 158 [2023-02-18 14:36:24,479 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:24,505 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:24,534 INFO L350 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 171 treesize of output 127 [2023-02-18 14:36:25,317 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:25,346 INFO L350 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 171 treesize of output 127 [2023-02-18 14:36:25,906 INFO L350 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 171 treesize of output 127 [2023-02-18 14:36:26,435 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:26,463 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:26,483 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:26,503 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:26,542 INFO L350 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 222 treesize of output 158 [2023-02-18 14:36:26,585 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:36:26,622 INFO L350 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 1102 treesize of output 1026 [2023-02-18 14:37:08,971 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:37:09,004 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:37:09,039 INFO L350 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 953 treesize of output 885 [2023-02-18 14:38:12,974 INFO L350 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 953 treesize of output 885 [2023-02-18 14:38:29,625 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:38:29,666 INFO L350 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 1004 treesize of output 916 [2023-02-18 14:38:29,734 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:38:29,768 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:38:29,800 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:38:30,482 INFO L350 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 665 treesize of output 625 [2023-02-18 14:38:31,361 INFO L350 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 139 treesize of output 103 [2023-02-18 14:38:31,539 INFO L350 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 1284523 treesize of output 1284479