./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc --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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:11:02,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:11:02,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:11:02,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:11:02,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:11:02,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:11:02,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:11:02,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:11:02,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:11:02,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:11:02,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:11:02,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:11:02,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:11:02,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:11:02,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:11:02,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:11:02,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:11:02,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:11:02,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:11:02,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:11:02,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:11:02,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:11:02,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:11:02,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:11:02,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:11:02,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:11:02,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:11:02,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:11:02,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:11:02,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:11:02,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:11:02,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:11:02,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:11:02,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:11:02,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:11:02,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:11:02,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:11:02,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:11:02,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:11:02,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:11:02,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:11:02,149 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:11:02,184 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:11:02,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:11:02,188 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:11:02,188 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:11:02,189 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:11:02,189 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:11:02,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:11:02,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:11:02,190 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:11:02,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:11:02,192 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:11:02,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:11:02,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:11:02,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:11:02,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:11:02,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:11:02,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:11:02,193 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:11:02,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:11:02,194 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:11:02,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:11:02,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:11:02,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:11:02,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:11:02,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:11:02,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:11:02,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:11:02,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:11:02,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:11:02,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:11:02,196 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:11:02,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:11:02,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:11:02,197 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2022-11-02 21:11:02,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:11:02,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:11:02,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:11:02,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:11:02,537 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:11:02,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-11-02 21:11:02,608 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/data/9691d9c11/5deba7cb2f0c41ea8e8667a95eb227ea/FLAGbafc301cb [2022-11-02 21:11:03,182 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:11:03,188 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-11-02 21:11:03,205 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/data/9691d9c11/5deba7cb2f0c41ea8e8667a95eb227ea/FLAGbafc301cb [2022-11-02 21:11:03,454 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/data/9691d9c11/5deba7cb2f0c41ea8e8667a95eb227ea [2022-11-02 21:11:03,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:11:03,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:11:03,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:03,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:11:03,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:11:03,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:03" (1/1) ... [2022-11-02 21:11:03,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b342cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:03, skipping insertion in model container [2022-11-02 21:11:03,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:03" (1/1) ... [2022-11-02 21:11:03,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:11:03,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:11:03,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-11-02 21:11:03,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:03,987 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:11:04,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-11-02 21:11:04,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:04,076 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:11:04,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04 WrapperNode [2022-11-02 21:11:04,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:04,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:04,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:11:04,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:11:04,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (1/1) ... [2022-11-02 21:11:04,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (1/1) ... [2022-11-02 21:11:04,157 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2022-11-02 21:11:04,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:04,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:11:04,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:11:04,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:11:04,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (1/1) ... [2022-11-02 21:11:04,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (1/1) ... [2022-11-02 21:11:04,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (1/1) ... [2022-11-02 21:11:04,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (1/1) ... [2022-11-02 21:11:04,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (1/1) ... [2022-11-02 21:11:04,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (1/1) ... [2022-11-02 21:11:04,191 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (1/1) ... [2022-11-02 21:11:04,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (1/1) ... [2022-11-02 21:11:04,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:11:04,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:11:04,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:11:04,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:11:04,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (1/1) ... [2022-11-02 21:11:04,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:11:04,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:04,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:04,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:11:04,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:11:04,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:11:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 21:11:04,287 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 21:11:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:11:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:11:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:11:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:11:04,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:11:04,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:11:04,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:11:04,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:11:04,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:11:04,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:11:04,409 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:11:04,411 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:11:04,682 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:11:04,688 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:11:04,688 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 21:11:04,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:04 BoogieIcfgContainer [2022-11-02 21:11:04,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:11:04,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:11:04,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:11:04,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:11:04,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:11:03" (1/3) ... [2022-11-02 21:11:04,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0f3673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:04, skipping insertion in model container [2022-11-02 21:11:04,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:04" (2/3) ... [2022-11-02 21:11:04,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0f3673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:04, skipping insertion in model container [2022-11-02 21:11:04,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:04" (3/3) ... [2022-11-02 21:11:04,721 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2022-11-02 21:11:04,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:11:04,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:11:04,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:11:04,810 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;@518c7927, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:11:04,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:11:04,817 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) [2022-11-02 21:11:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:11:04,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:04,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:04,827 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-11-02 21:11:04,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:04,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824748355] [2022-11-02 21:11:04,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:05,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:05,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:11:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:11:05,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:05,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824748355] [2022-11-02 21:11:05,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824748355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:05,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:05,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:11:05,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395691119] [2022-11-02 21:11:05,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:05,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:11:05,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:05,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:05,387 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.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:11:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:05,496 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-11-02 21:11:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:05,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-02 21:11:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:05,506 INFO L225 Difference]: With dead ends: 65 [2022-11-02 21:11:05,506 INFO L226 Difference]: Without dead ends: 28 [2022-11-02 21:11:05,509 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 [2022-11-02 21:11:05,513 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:05,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:11:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-02 21:11:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-02 21:11:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2022-11-02 21:11:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-02 21:11:05,554 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-11-02 21:11:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:05,555 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-02 21:11:05,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:11:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-02 21:11:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:11:05,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:05,557 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:05,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:11:05,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:05,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-11-02 21:11:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:05,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598664041] [2022-11-02 21:11:05,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:05,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:05,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:05,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:11:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:11:05,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:05,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598664041] [2022-11-02 21:11:05,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598664041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:05,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:05,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:11:05,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425066033] [2022-11-02 21:11:05,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:05,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:11:05,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:05,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:11:05,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:11:05,825 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:11:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:05,878 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-11-02 21:11:05,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:11:05,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-02 21:11:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:05,881 INFO L225 Difference]: With dead ends: 52 [2022-11-02 21:11:05,882 INFO L226 Difference]: Without dead ends: 31 [2022-11-02 21:11:05,882 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 [2022-11-02 21:11:05,886 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 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 [2022-11-02 21:11:05,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:11:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-02 21:11:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-02 21:11:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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) [2022-11-02 21:11:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-02 21:11:05,894 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-11-02 21:11:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:05,895 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-02 21:11:05,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:11:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-02 21:11:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 21:11:05,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:05,912 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] [2022-11-02 21:11:05,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:11:05,914 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-11-02 21:11:05,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:05,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571564697] [2022-11-02 21:11:05,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:05,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:06,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:11:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:11:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:11:06,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:06,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571564697] [2022-11-02 21:11:06,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571564697] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:06,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019448069] [2022-11-02 21:11:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:06,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:06,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:06,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:06,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:11:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:06,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 21:11:06,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:07,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-11-02 21:11:07,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:07,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 24 [2022-11-02 21:11:07,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-02 21:11:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:11:07,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:07,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| Int) (v_ArrVal_316 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| v_ArrVal_316) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| |c_#StackHeapBarrier|)) (<= 1 .cse0)))) is different from false [2022-11-02 21:11:07,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019448069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:07,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:11:07,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-11-02 21:11:07,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843535191] [2022-11-02 21:11:07,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:07,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 21:11:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:07,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 21:11:07,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2022-11-02 21:11:07,766 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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) [2022-11-02 21:11:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:08,191 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-02 21:11:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:11:08,192 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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 32 [2022-11-02 21:11:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:08,194 INFO L225 Difference]: With dead ends: 38 [2022-11-02 21:11:08,194 INFO L226 Difference]: Without dead ends: 30 [2022-11-02 21:11:08,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2022-11-02 21:11:08,196 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:08,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 187 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 151 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-11-02 21:11:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-02 21:11:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-11-02 21:11:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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) [2022-11-02 21:11:08,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-11-02 21:11:08,202 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2022-11-02 21:11:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:08,203 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-11-02 21:11:08,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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) [2022-11-02 21:11:08,203 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-11-02 21:11:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 21:11:08,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:08,204 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, 1, 1] [2022-11-02 21:11:08,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:08,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:08,405 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:08,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-11-02 21:11:08,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:08,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140782047] [2022-11-02 21:11:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:08,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:09,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:09,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:11:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:09,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:11:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:11:09,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:09,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140782047] [2022-11-02 21:11:09,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140782047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:09,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010338031] [2022-11-02 21:11:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:09,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:09,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:09,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:09,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:11:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:10,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-02 21:11:10,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:10,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 21:11:10,435 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:11:10,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 21:11:10,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:11:10,622 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:11:10,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 21:11:10,785 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:11:10,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2022-11-02 21:11:10,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:11:10,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-02 21:11:10,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:10,989 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 21:11:10,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 51 [2022-11-02 21:11:11,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:11,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 49 [2022-11-02 21:11:11,030 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-02 21:11:11,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 21:11:11,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 23 [2022-11-02 21:11:11,203 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:11:11,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2022-11-02 21:11:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:11,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:11,399 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| Int) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| v_ArrVal_532))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| v_ArrVal_533) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11|) 0)) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| |c_#StackHeapBarrier|)))) is different from false [2022-11-02 21:11:11,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010338031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:11,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:11:11,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 35 [2022-11-02 21:11:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40450861] [2022-11-02 21:11:11,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:11,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 21:11:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:11,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 21:11:11,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1213, Unknown=1, NotChecked=70, Total=1406 [2022-11-02 21:11:11,412 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:11:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:12,371 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-11-02 21:11:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 21:11:12,371 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2022-11-02 21:11:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:12,372 INFO L225 Difference]: With dead ends: 65 [2022-11-02 21:11:12,372 INFO L226 Difference]: Without dead ends: 56 [2022-11-02 21:11:12,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=232, Invalid=2123, Unknown=1, NotChecked=94, Total=2450 [2022-11-02 21:11:12,374 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:12,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 305 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 391 Invalid, 0 Unknown, 46 Unchecked, 0.4s Time] [2022-11-02 21:11:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-02 21:11:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2022-11-02 21:11:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:11:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-11-02 21:11:12,387 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 35 [2022-11-02 21:11:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:12,387 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-11-02 21:11:12,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:11:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-11-02 21:11:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 21:11:12,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:12,389 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:12,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:12,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:12,604 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:12,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:12,605 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-11-02 21:11:12,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:12,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977069938] [2022-11-02 21:11:12,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:12,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:14,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:14,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:11:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:14,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:11:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:11:15,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:15,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977069938] [2022-11-02 21:11:15,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977069938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:15,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109436805] [2022-11-02 21:11:15,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:15,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:15,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:15,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:15,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:11:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:15,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-02 21:11:15,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:15,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 21:11:15,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 21:11:15,483 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) is different from false [2022-11-02 21:11:15,487 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) is different from true [2022-11-02 21:11:15,516 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-02 21:11:15,518 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-02 21:11:15,574 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from false [2022-11-02 21:11:15,577 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from true [2022-11-02 21:11:15,606 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-02 21:11:15,609 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-02 21:11:15,678 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from false [2022-11-02 21:11:15,681 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from true [2022-11-02 21:11:15,780 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-02 21:11:15,784 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-02 21:11:15,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:11:15,863 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-02 21:11:15,866 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-02 21:11:15,980 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:11:15,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:11:16,018 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1))))) is different from false [2022-11-02 21:11:16,022 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1))))) is different from true [2022-11-02 21:11:16,109 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-02 21:11:16,113 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-02 21:11:16,159 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-02 21:11:16,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 19 [2022-11-02 21:11:16,221 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2022-11-02 21:11:16,225 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from true [2022-11-02 21:11:16,302 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-02 21:11:16,306 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-02 21:11:16,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:11:16,456 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_746) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_744 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_744)))) is different from false [2022-11-02 21:11:16,460 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_746) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_744 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_744)))) is different from true [2022-11-02 21:11:16,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:16,610 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 21:11:16,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 60 [2022-11-02 21:11:16,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:16,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-11-02 21:11:16,757 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from false [2022-11-02 21:11:16,763 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from true [2022-11-02 21:11:16,951 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2022-11-02 21:11:16,957 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2022-11-02 21:11:17,147 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) is different from false [2022-11-02 21:11:17,152 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) is different from true [2022-11-02 21:11:17,472 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) is different from false [2022-11-02 21:11:17,478 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) is different from true [2022-11-02 21:11:17,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2022-11-02 21:11:17,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:17,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:17,870 INFO L356 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2022-11-02 21:11:17,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 111 [2022-11-02 21:11:17,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:17,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:17,970 INFO L356 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2022-11-02 21:11:17,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 84 [2022-11-02 21:11:17,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 58 [2022-11-02 21:11:18,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-02 21:11:18,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:18,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:18,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:18,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2022-11-02 21:11:18,168 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_33 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_32) v_arrayElimCell_33))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= 1 (select |v_#valid_BEFORE_CALL_13| .cse5))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2022-11-02 21:11:18,172 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_33 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_32) v_arrayElimCell_33))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= 1 (select |v_#valid_BEFORE_CALL_13| .cse5))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from true [2022-11-02 21:11:18,231 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 21:11:18,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 50 [2022-11-02 21:11:18,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 13 [2022-11-02 21:11:18,360 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_32 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_35) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= 0 (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_35)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_12| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))))) is different from false [2022-11-02 21:11:18,365 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_32 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_35) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= 0 (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_35)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_12| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))))) is different from true [2022-11-02 21:11:18,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:11:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-02 21:11:18,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:18,565 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_752) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_751) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_754) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_757) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_753) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_759) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-02 21:11:18,609 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_752) .cse0 v_ArrVal_751) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_754) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_757) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_753) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_759) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-02 21:11:18,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_752) .cse0 v_ArrVal_751) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_754) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_757) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_753) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_759) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-02 21:11:18,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_752) .cse0 v_ArrVal_751) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_754) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_757) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) .cse0 v_ArrVal_753) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_759) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) .cse0 v_ArrVal_755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-02 21:11:18,805 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:18,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 139 [2022-11-02 21:11:18,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:11:18,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 616 treesize of output 615 [2022-11-02 21:11:18,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 516 treesize of output 424 [2022-11-02 21:11:18,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 234 treesize of output 188 [2022-11-02 21:11:29,922 WARN L234 SmtUtils]: Spent 10.56s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:11:29,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109436805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:29,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:11:29,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 44 [2022-11-02 21:11:29,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251324892] [2022-11-02 21:11:29,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:29,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 21:11:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:29,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 21:11:29,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=755, Unknown=40, NotChecked=1650, Total=2550 [2022-11-02 21:11:29,928 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 44 states, 40 states have (on average 1.425) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:11:30,355 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-02 21:11:30,358 WARN L855 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-02 21:11:30,363 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-02 21:11:30,366 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-02 21:11:30,372 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from false [2022-11-02 21:11:30,376 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from true [2022-11-02 21:11:30,381 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from false [2022-11-02 21:11:30,385 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2022-11-02 21:11:30,401 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (or .cse1 (= (select |c_old(#valid)| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (or .cse1 (<= (+ .cse2 1) |c_#StackHeapBarrier|)) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|))) is different from false [2022-11-02 21:11:30,408 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (or .cse1 (= (select |c_old(#valid)| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (or .cse1 (<= (+ .cse2 1) |c_#StackHeapBarrier|)) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|))) is different from true [2022-11-02 21:11:30,421 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-02 21:11:30,426 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-02 21:11:30,439 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-02 21:11:30,444 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-02 21:11:30,467 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-02 21:11:30,471 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-02 21:11:30,490 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-02 21:11:30,495 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-02 21:11:30,512 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from false [2022-11-02 21:11:30,517 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from true [2022-11-02 21:11:30,533 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from false [2022-11-02 21:11:30,538 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2022-11-02 21:11:30,649 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse3 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse4 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse0 (select |c_#memory_int| |c_node_create_#res#1.base|))) (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (exists ((v_ArrVal_746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_746) |c_#memory_$Pointer$.offset|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse3 (= (select |c_old(#valid)| .cse4) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (or .cse3 (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (= (select .cse0 4) |c_node_create_#in~data#1|) (exists ((v_ArrVal_744 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_744))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|))) is different from false [2022-11-02 21:11:30,656 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse3 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse4 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse0 (select |c_#memory_int| |c_node_create_#res#1.base|))) (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (exists ((v_ArrVal_746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_746) |c_#memory_$Pointer$.offset|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse3 (= (select |c_old(#valid)| .cse4) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (or .cse3 (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (= (select .cse0 4) |c_node_create_#in~data#1|) (exists ((v_ArrVal_744 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_744))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|))) is different from true [2022-11-02 21:11:30,795 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (not (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse4)) (= (select .cse2 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse6 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from false [2022-11-02 21:11:30,800 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (not (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse4)) (= (select .cse2 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse6 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from true [2022-11-02 21:11:30,871 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse1 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)))) is different from false [2022-11-02 21:11:30,878 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse1 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)))) is different from true [2022-11-02 21:11:30,970 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse1 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) is different from false [2022-11-02 21:11:30,977 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse1 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) is different from true [2022-11-02 21:11:31,065 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse1 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) is different from false [2022-11-02 21:11:31,070 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse1 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) is different from true [2022-11-02 21:11:31,154 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse6)) (.cse4 (select |c_#memory_int| .cse6)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 4)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_33 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_32) v_arrayElimCell_33))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse7) 0) (= 1 (select |v_#valid_BEFORE_CALL_13| .cse7))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 (+ .cse1 4)))))) is different from false [2022-11-02 21:11:31,160 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse6)) (.cse4 (select |c_#memory_int| .cse6)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 4)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_33 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_32) v_arrayElimCell_33))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse7) 0) (= 1 (select |v_#valid_BEFORE_CALL_13| .cse7))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 (+ .cse1 4)))))) is different from true [2022-11-02 21:11:31,220 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_32 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_35) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= 0 (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_35)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_12| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))))) is different from false [2022-11-02 21:11:31,226 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_32 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_35) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= 0 (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_35)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_12| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))))) is different from true [2022-11-02 21:11:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:31,311 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-11-02 21:11:31,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 21:11:31,314 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.425) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2022-11-02 21:11:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:31,315 INFO L225 Difference]: With dead ends: 72 [2022-11-02 21:11:31,315 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 21:11:31,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 40 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=158, Invalid=918, Unknown=76, NotChecked=3960, Total=5112 [2022-11-02 21:11:31,318 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:31,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 389 Unchecked, 0.3s Time] [2022-11-02 21:11:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 21:11:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-02 21:11:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 21:11:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-11-02 21:11:31,341 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 37 [2022-11-02 21:11:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:31,342 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-11-02 21:11:31,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.425) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:11:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-11-02 21:11:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:11:31,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:31,344 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:31,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:31,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:31,563 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:31,563 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-11-02 21:11:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:31,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329892786] [2022-11-02 21:11:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:11:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:11:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:11:33,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:33,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329892786] [2022-11-02 21:11:33,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329892786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:33,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906140826] [2022-11-02 21:11:33,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:11:33,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:33,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:33,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:33,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:11:33,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:11:33,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:11:33,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 185 conjunts are in the unsatisfiable core [2022-11-02 21:11:33,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:33,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 21:11:34,019 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:11:34,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 21:11:34,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:11:34,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:11:34,316 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:11:34,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-02 21:11:34,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-02 21:11:34,580 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:11:34,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 36 [2022-11-02 21:11:34,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:11:34,598 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:11:34,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 21:11:34,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:11:34,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:34,909 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 21:11:34,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 61 [2022-11-02 21:11:34,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:34,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:34,945 INFO L356 Elim1Store]: treesize reduction 60, result has 41.7 percent of original size [2022-11-02 21:11:34,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 68 [2022-11-02 21:11:34,993 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 21:11:34,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 21:11:36,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2022-11-02 21:11:36,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:36,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:37,027 INFO L356 Elim1Store]: treesize reduction 962, result has 7.9 percent of original size [2022-11-02 21:11:37,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 33 case distinctions, treesize of input 470 treesize of output 480 [2022-11-02 21:11:37,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:38,497 INFO L356 Elim1Store]: treesize reduction 497, result has 14.5 percent of original size [2022-11-02 21:11:38,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 795 treesize of output 581 [2022-11-02 21:11:38,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:39,312 INFO L356 Elim1Store]: treesize reduction 157, result has 18.7 percent of original size [2022-11-02 21:11:39,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 144 [2022-11-02 21:11:39,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 104 treesize of output 103 [2022-11-02 21:11:39,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 104 treesize of output 103 [2022-11-02 21:11:40,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 21 [2022-11-02 21:11:40,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 104 treesize of output 103 [2022-11-02 21:11:40,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-11-02 21:11:40,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:40,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 1 [2022-11-02 21:11:41,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:11:41,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 462 [2022-11-02 21:11:41,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:11:41,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 154 treesize of output 462 [2022-11-02 21:11:41,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:41,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 224 [2022-11-02 21:11:45,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:11:45,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 330 [2022-11-02 21:11:45,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 101 treesize of output 3 [2022-11-02 21:11:45,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:45,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:45,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:45,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:45,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:45,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:45,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:45,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:11:45,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:45,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:45,888 INFO L356 Elim1Store]: treesize reduction 153, result has 19.5 percent of original size [2022-11-02 21:11:45,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 5764 treesize of output 3911 [2022-11-02 21:11:46,005 INFO L356 Elim1Store]: treesize reduction 137, result has 2.1 percent of original size [2022-11-02 21:11:46,006 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-02 21:11:46,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:46,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:46,208 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_DerPreprocessor_5 input size 347 context size 347 output size 347 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-02 21:11:46,212 INFO L158 Benchmark]: Toolchain (without parser) took 42750.73ms. Allocated memory was 102.8MB in the beginning and 297.8MB in the end (delta: 195.0MB). Free memory was 64.4MB in the beginning and 188.9MB in the end (delta: -124.4MB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. [2022-11-02 21:11:46,212 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:11:46,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.06ms. Allocated memory is still 102.8MB. Free memory was 64.3MB in the beginning and 70.3MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 21:11:46,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.08ms. Allocated memory is still 102.8MB. Free memory was 70.0MB in the beginning and 67.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:11:46,212 INFO L158 Benchmark]: Boogie Preprocessor took 36.72ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 66.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:11:46,213 INFO L158 Benchmark]: RCFGBuilder took 494.75ms. Allocated memory is still 102.8MB. Free memory was 66.1MB in the beginning and 49.4MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 21:11:46,213 INFO L158 Benchmark]: TraceAbstraction took 41518.99ms. Allocated memory was 102.8MB in the beginning and 297.8MB in the end (delta: 195.0MB). Free memory was 48.7MB in the beginning and 188.9MB in the end (delta: -140.1MB). Peak memory consumption was 121.7MB. Max. memory is 16.1GB. [2022-11-02 21:11:46,214 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.06ms. Allocated memory is still 102.8MB. Free memory was 64.3MB in the beginning and 70.3MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.08ms. Allocated memory is still 102.8MB. Free memory was 70.0MB in the beginning and 67.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.72ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 66.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 494.75ms. Allocated memory is still 102.8MB. Free memory was 66.1MB in the beginning and 49.4MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 41518.99ms. Allocated memory was 102.8MB in the beginning and 297.8MB in the end (delta: 195.0MB). Free memory was 48.7MB in the beginning and 188.9MB in the end (delta: -140.1MB). Peak memory consumption was 121.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_DerPreprocessor_5 input size 347 context size 347 output size 347 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_DerPreprocessor_5 input size 347 context size 347 output size 347: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-02 21:11:46,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc --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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:11:48,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:11:48,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:11:48,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:11:48,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:11:48,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:11:48,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:11:48,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:11:48,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:11:48,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:11:48,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:11:48,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:11:48,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:11:48,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:11:48,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:11:48,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:11:48,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:11:48,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:11:48,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:11:48,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:11:48,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:11:48,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:11:48,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:11:48,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:11:48,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:11:48,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:11:48,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:11:48,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:11:48,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:11:48,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:11:48,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:11:48,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:11:48,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:11:48,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:11:48,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:11:48,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:11:48,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:11:48,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:11:48,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:11:48,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:11:48,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:11:48,790 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-02 21:11:48,830 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:11:48,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:11:48,832 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:11:48,832 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:11:48,833 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:11:48,833 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:11:48,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:11:48,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:11:48,836 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:11:48,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:11:48,837 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:11:48,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:11:48,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:11:48,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:11:48,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:11:48,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:11:48,839 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 21:11:48,839 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 21:11:48,840 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 21:11:48,840 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:11:48,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:11:48,840 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:11:48,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:11:48,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:11:48,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:11:48,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:11:48,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:11:48,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:11:48,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:11:48,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:11:48,843 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 21:11:48,844 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 21:11:48,844 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:11:48,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:11:48,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:11:48,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 21:11:48,845 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2022-11-02 21:11:49,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:11:49,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:11:49,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:11:49,283 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:11:49,284 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:11:49,286 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-11-02 21:11:49,364 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/data/f8ea49f63/59ab44b82a28413492dea2503df3607d/FLAG6daa19ea0 [2022-11-02 21:11:49,899 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:11:49,900 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-11-02 21:11:49,916 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/data/f8ea49f63/59ab44b82a28413492dea2503df3607d/FLAG6daa19ea0 [2022-11-02 21:11:50,215 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/data/f8ea49f63/59ab44b82a28413492dea2503df3607d [2022-11-02 21:11:50,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:11:50,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:11:50,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:50,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:11:50,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:11:50,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7810812a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50, skipping insertion in model container [2022-11-02 21:11:50,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:11:50,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:11:50,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-11-02 21:11:50,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:50,620 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:11:50,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-11-02 21:11:50,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:50,689 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:11:50,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50 WrapperNode [2022-11-02 21:11:50,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:50,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:50,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:11:50,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:11:50,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,767 INFO L138 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2022-11-02 21:11:50,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:50,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:11:50,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:11:50,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:11:50,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,827 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:11:50,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:11:50,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:11:50,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:11:50,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (1/1) ... [2022-11-02 21:11:50,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:11:50,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:50,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:50,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:11:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-02 21:11:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 21:11:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 21:11:50,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:11:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:11:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:11:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:11:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:11:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:11:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 21:11:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:11:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 21:11:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:11:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:11:51,152 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:11:51,154 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:11:51,649 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:11:51,660 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:11:51,663 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 21:11:51,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:51 BoogieIcfgContainer [2022-11-02 21:11:51,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:11:51,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:11:51,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:11:51,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:11:51,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:11:50" (1/3) ... [2022-11-02 21:11:51,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342f3f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:51, skipping insertion in model container [2022-11-02 21:11:51,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:50" (2/3) ... [2022-11-02 21:11:51,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342f3f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:51, skipping insertion in model container [2022-11-02 21:11:51,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:51" (3/3) ... [2022-11-02 21:11:51,678 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2022-11-02 21:11:51,698 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:11:51,698 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:11:51,777 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:11:51,787 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;@59c3285b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:11:51,788 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:11:51,794 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) [2022-11-02 21:11:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:11:51,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:51,804 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:51,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:51,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-11-02 21:11:51,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:11:51,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570736305] [2022-11-02 21:11:51,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:51,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:11:51,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:11:51,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:11:51,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 21:11:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-02 21:11:52,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:52,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:11:52,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:11:52,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570736305] [2022-11-02 21:11:52,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570736305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:52,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:52,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:11:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798528228] [2022-11-02 21:11:52,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:52,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:11:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:11:52,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:11:52,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:11:52,155 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 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:11:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:52,177 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-11-02 21:11:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:11:52,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-02 21:11:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:52,186 INFO L225 Difference]: With dead ends: 65 [2022-11-02 21:11:52,187 INFO L226 Difference]: Without dead ends: 28 [2022-11-02 21:11:52,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:11:52,193 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:52,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:11:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-02 21:11:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-02 21:11:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2022-11-02 21:11:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-02 21:11:52,233 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-11-02 21:11:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:52,235 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-02 21:11:52,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:11:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-02 21:11:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:11:52,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:52,237 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:52,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:52,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:11:52,452 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-11-02 21:11:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:11:52,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992786466] [2022-11-02 21:11:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:52,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:11:52,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:11:52,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:11:52,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 21:11:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 21:11:52,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:52,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:11:52,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:11:52,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992786466] [2022-11-02 21:11:52,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992786466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:52,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:52,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:11:52,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610160958] [2022-11-02 21:11:52,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:52,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:11:52,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:11:52,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:52,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:52,727 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:11:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:52,766 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-11-02 21:11:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:52,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-02 21:11:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:52,777 INFO L225 Difference]: With dead ends: 52 [2022-11-02 21:11:52,778 INFO L226 Difference]: Without dead ends: 31 [2022-11-02 21:11:52,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:52,780 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:52,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:11:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-02 21:11:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-02 21:11:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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) [2022-11-02 21:11:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-02 21:11:52,799 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-11-02 21:11:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:52,801 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-02 21:11:52,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:11:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-02 21:11:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 21:11:52,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:52,805 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] [2022-11-02 21:11:52,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:53,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:11:53,023 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-11-02 21:11:53,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:11:53,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088561487] [2022-11-02 21:11:53,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:53,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:11:53,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:11:53,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:11:53,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 21:11:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-02 21:11:53,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:53,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:11:53,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 21:11:53,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:53,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 21:11:53,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 21:11:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:11:53,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:54,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:11:54,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088561487] [2022-11-02 21:11:54,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088561487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [144513514] [2022-11-02 21:11:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:54,132 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 21:11:54,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 21:11:54,135 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 21:11:54,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-02 21:11:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:54,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-02 21:11:54,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:55,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 21:11:55,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:55,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 21:11:55,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 21:11:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:11:55,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:55,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [144513514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:55,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:11:55,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2022-11-02 21:11:55,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036842326] [2022-11-02 21:11:55,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:55,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-02 21:11:55,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:11:55,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 21:11:55,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=417, Unknown=9, NotChecked=0, Total=506 [2022-11-02 21:11:55,472 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 21:11:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:56,113 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-02 21:11:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:11:56,114 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2022-11-02 21:11:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:56,116 INFO L225 Difference]: With dead ends: 38 [2022-11-02 21:11:56,117 INFO L226 Difference]: Without dead ends: 30 [2022-11-02 21:11:56,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=115, Invalid=576, Unknown=11, NotChecked=0, Total=702 [2022-11-02 21:11:56,118 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:56,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 133 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 29 Unchecked, 0.5s Time] [2022-11-02 21:11:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-02 21:11:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-11-02 21:11:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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) [2022-11-02 21:11:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-11-02 21:11:56,126 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2022-11-02 21:11:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:56,127 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-11-02 21:11:56,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 21:11:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-11-02 21:11:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 21:11:56,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:56,129 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, 1, 1] [2022-11-02 21:11:56,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-02 21:11:56,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:56,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt [2022-11-02 21:11:56,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:56,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-11-02 21:11:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:11:56,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059490069] [2022-11-02 21:11:56,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:56,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:11:56,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:11:56,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:11:56,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-02 21:11:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:56,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-02 21:11:56,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:56,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 21:11:57,314 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 21:11:57,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 21:11:57,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:11:57,551 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:11:57,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-11-02 21:11:57,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-02 21:11:57,756 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-11-02 21:11:57,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 35 [2022-11-02 21:11:57,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:11:57,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 21:11:58,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:58,136 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 21:11:58,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2022-11-02 21:11:58,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:11:58,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 46 [2022-11-02 21:11:58,209 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-02 21:11:58,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-02 21:11:58,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 32 [2022-11-02 21:11:58,503 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-02 21:11:58,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2022-11-02 21:11:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:58,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:58,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:11:58,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059490069] [2022-11-02 21:11:58,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059490069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:58,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1234347238] [2022-11-02 21:11:58,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:58,913 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 21:11:58,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 21:11:58,915 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 21:11:58,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-02 21:11:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:59,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-02 21:11:59,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:59,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 21:12:00,045 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 21:12:00,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 21:12:00,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:12:00,406 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:12:00,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 21:12:00,712 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:12:00,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2022-11-02 21:12:00,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 21:12:00,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 21:12:01,108 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 21:12:01,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59 [2022-11-02 21:12:01,144 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:12:01,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49 [2022-11-02 21:12:01,176 INFO L356 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-11-02 21:12:01,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 21:12:01,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 25 [2022-11-02 21:12:01,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 66 [2022-11-02 21:12:01,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-11-02 21:12:02,077 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:12:02,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2022-11-02 21:12:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:12:02,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:12:02,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1234347238] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:12:02,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:12:02,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2022-11-02 21:12:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350416830] [2022-11-02 21:12:02,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:12:02,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 21:12:02,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:12:02,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 21:12:02,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1611, Unknown=10, NotChecked=0, Total=1806 [2022-11-02 21:12:02,412 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 29 states have internal predecessors, (51), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:12:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:04,748 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-11-02 21:12:04,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:12:04,749 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 29 states have internal predecessors, (51), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2022-11-02 21:12:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:04,750 INFO L225 Difference]: With dead ends: 62 [2022-11-02 21:12:04,750 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 21:12:04,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=291, Invalid=2349, Unknown=12, NotChecked=0, Total=2652 [2022-11-02 21:12:04,753 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:04,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 403 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 380 Invalid, 0 Unknown, 148 Unchecked, 1.4s Time] [2022-11-02 21:12:04,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 21:12:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2022-11-02 21:12:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:12:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-11-02 21:12:04,767 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 35 [2022-11-02 21:12:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:04,767 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-11-02 21:12:04,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 29 states have internal predecessors, (51), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:12:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-11-02 21:12:04,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 21:12:04,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:04,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:12:04,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2022-11-02 21:12:04,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:12:05,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:12:05,174 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:05,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-11-02 21:12:05,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:12:05,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65862205] [2022-11-02 21:12:05,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:05,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:12:05,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:12:05,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:12:05,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-02 21:12:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:05,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-02 21:12:05,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:12:05,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 21:12:05,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-02 21:12:05,754 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 21:12:05,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 21:12:05,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 21:12:06,053 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-02 21:12:06,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-02 21:12:06,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:12:06,409 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:12:06,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 21:12:06,708 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-02 21:12:06,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 30 [2022-11-02 21:12:06,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-02 21:12:06,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:12:07,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:07,132 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 21:12:07,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 71 [2022-11-02 21:12:07,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:07,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 60 [2022-11-02 21:12:07,223 INFO L356 Elim1Store]: treesize reduction 18, result has 61.7 percent of original size [2022-11-02 21:12:07,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 47 [2022-11-02 21:12:08,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2022-11-02 21:12:08,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:08,837 INFO L356 Elim1Store]: treesize reduction 99, result has 10.0 percent of original size [2022-11-02 21:12:08,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 102 [2022-11-02 21:12:08,962 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 21:12:08,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 236 treesize of output 169 [2022-11-02 21:12:09,015 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-11-02 21:12:09,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 118 [2022-11-02 21:12:09,082 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-02 21:12:09,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 131 [2022-11-02 21:12:09,145 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 21:12:09,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 53 [2022-11-02 21:12:09,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 21:12:09,456 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-02 21:12:09,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 47 [2022-11-02 21:12:09,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 21:12:09,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 21:12:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:12:09,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:12:10,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (_ BitVec 32)) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_548)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_549) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_538) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_531) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 21:12:10,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (_ BitVec 32)) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_548)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_549) .cse0 v_ArrVal_538) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_531) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_547) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-02 21:12:10,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (_ BitVec 32)) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_548)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_549) .cse0 v_ArrVal_538) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_531) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)))) (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_547) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-02 21:12:10,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (_ BitVec 32)) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_548)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_549) .cse0 v_ArrVal_538) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse2)))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse0 v_ArrVal_531) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse4)))) (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|))) .cse0 v_ArrVal_547) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-02 21:12:11,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:12:11,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 177 [2022-11-02 21:12:11,420 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:12:11,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1752 treesize of output 1623 [2022-11-02 21:12:11,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1484 treesize of output 1220 [2022-11-02 21:12:11,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1220 treesize of output 1088 [2022-11-02 21:12:26,780 WARN L234 SmtUtils]: Spent 11.53s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:12:26,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:12:26,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65862205] [2022-11-02 21:12:26,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65862205] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:12:26,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [357801301] [2022-11-02 21:12:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:26,784 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 21:12:26,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 21:12:26,791 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 21:12:26,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-02 21:12:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:27,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-02 21:12:27,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:12:27,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 21:12:29,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-02 21:12:30,756 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 21:12:30,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 21:12:31,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:12:32,607 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:12:32,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-02 21:12:33,530 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:12:33,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2022-11-02 21:12:33,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 21:12:33,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-02 21:12:34,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:12:34,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:34,259 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 21:12:34,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 64 [2022-11-02 21:12:34,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:34,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 64 [2022-11-02 21:12:34,355 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-02 21:12:34,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-02 21:12:36,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2022-11-02 21:12:36,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:37,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:37,207 INFO L356 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2022-11-02 21:12:37,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 142 treesize of output 116 [2022-11-02 21:12:37,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:37,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:37,323 INFO L356 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2022-11-02 21:12:37,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 89 [2022-11-02 21:12:37,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2022-11-02 21:12:37,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2022-11-02 21:12:37,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:37,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:37,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2022-11-02 21:12:38,074 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:12:38,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 33 [2022-11-02 21:12:38,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 21:12:38,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 21:12:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:12:38,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:12:38,355 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (_ BitVec 32)) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_672)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_666) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_663) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_661) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_664) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_662) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_660) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))) is different from false [2022-11-02 21:12:38,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (_ BitVec 32)) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_672)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_666) .cse0 v_ArrVal_663) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_661) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_664) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_662) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_660) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-02 21:12:38,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (_ BitVec 32)) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_672)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_666) .cse0 v_ArrVal_663) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_661) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_664) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_662) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_660) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-02 21:12:38,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (_ BitVec 32)) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_672)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_666) .cse0 v_ArrVal_663) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_661) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_664) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) .cse0 v_ArrVal_662) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_660) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_671) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-02 21:12:39,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:12:39,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 137 [2022-11-02 21:12:39,702 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:12:39,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 614 treesize of output 615 [2022-11-02 21:12:39,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 516 treesize of output 424 [2022-11-02 21:12:39,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 234 treesize of output 188 [2022-11-02 21:13:48,292 WARN L234 SmtUtils]: Spent 39.90s on a formula simplification. DAG size of input: 95 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:13:48,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [357801301] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:13:48,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:13:48,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 41 [2022-11-02 21:13:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788446527] [2022-11-02 21:13:48,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:13:48,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-02 21:13:48,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:13:48,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-02 21:13:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1916, Unknown=17, NotChecked=760, Total=2862 [2022-11-02 21:13:48,299 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 30 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:13:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:59,422 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-11-02 21:13:59,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 21:13:59,423 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 30 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2022-11-02 21:13:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:59,424 INFO L225 Difference]: With dead ends: 54 [2022-11-02 21:13:59,424 INFO L226 Difference]: Without dead ends: 52 [2022-11-02 21:13:59,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 101.7s TimeCoverageRelationStatistics Valid=258, Invalid=2836, Unknown=18, NotChecked=920, Total=4032 [2022-11-02 21:13:59,426 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:59,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 356 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 286 Invalid, 0 Unknown, 125 Unchecked, 1.7s Time] [2022-11-02 21:13:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-02 21:13:59,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-11-02 21:13:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:13:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-11-02 21:13:59,440 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 37 [2022-11-02 21:13:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:59,440 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-11-02 21:13:59,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 30 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:13:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-11-02 21:13:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:13:59,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:59,442 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:59,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-11-02 21:13:59,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:13:59,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:13:59,846 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-11-02 21:13:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:13:59,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475083832] [2022-11-02 21:13:59,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:13:59,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:13:59,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:13:59,848 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:13:59,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-02 21:14:00,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:14:00,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:14:00,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-02 21:14:00,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:14:00,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 21:14:01,259 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 21:14:01,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 21:14:01,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:14:01,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:14:01,920 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-02 21:14:01,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 48 [2022-11-02 21:14:01,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-02 21:14:02,495 INFO L356 Elim1Store]: treesize reduction 32, result has 28.9 percent of original size [2022-11-02 21:14:02,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 71 [2022-11-02 21:14:02,527 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-02 21:14:02,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 22 [2022-11-02 21:14:02,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 21:14:03,357 INFO L356 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-02 21:14:03,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 117 [2022-11-02 21:14:03,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:14:03,501 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-02 21:14:03,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 104 [2022-11-02 21:14:03,601 INFO L356 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-11-02 21:14:03,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 21:14:03,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 66 [2022-11-02 21:14:03,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 138 [2022-11-02 21:14:05,810 INFO L356 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-11-02 21:14:05,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 92 [2022-11-02 21:14:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:14:06,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:14:07,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:14:07,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475083832] [2022-11-02 21:14:07,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475083832] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:14:07,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [800282393] [2022-11-02 21:14:07,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:14:07,731 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 21:14:07,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 21:14:07,732 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 21:14:07,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-02 21:14:08,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:14:08,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:14:08,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-02 21:14:08,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:14:08,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 21:14:10,299 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 21:14:10,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 21:14:10,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:14:10,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:14:11,594 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 21:14:11,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2022-11-02 21:14:11,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-02 21:14:12,767 INFO L356 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-11-02 21:14:12,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 58 [2022-11-02 21:14:12,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-11-02 21:14:12,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 21:14:13,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:14:16,162 INFO L356 Elim1Store]: treesize reduction 122, result has 19.7 percent of original size [2022-11-02 21:14:16,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 97 [2022-11-02 21:14:16,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:14:16,286 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 21:14:16,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 56 [2022-11-02 21:14:16,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:14:16,359 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 21:14:16,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2022-11-02 21:14:16,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 115 [2022-11-02 21:14:23,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:14:23,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:14:26,454 INFO L356 Elim1Store]: treesize reduction 978, result has 5.9 percent of original size [2022-11-02 21:14:26,456 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-02 21:14:26,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-11-02 21:14:26,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-02 21:14:26,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:14:26,857 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.offset_90| input size 161 context size 161 output size 161 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-02 21:14:26,861 INFO L158 Benchmark]: Toolchain (without parser) took 156641.63ms. Allocated memory was 60.8MB in the beginning and 113.2MB in the end (delta: 52.4MB). Free memory was 36.6MB in the beginning and 83.3MB in the end (delta: -46.7MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2022-11-02 21:14:26,861 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 60.8MB. Free memory was 41.1MB in the beginning and 41.0MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:14:26,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.93ms. Allocated memory is still 60.8MB. Free memory was 36.5MB in the beginning and 35.8MB in the end (delta: 708.4kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 21:14:26,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.26ms. Allocated memory is still 60.8MB. Free memory was 35.6MB in the beginning and 33.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:14:26,862 INFO L158 Benchmark]: Boogie Preprocessor took 83.88ms. Allocated memory is still 60.8MB. Free memory was 33.4MB in the beginning and 31.2MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 21:14:26,862 INFO L158 Benchmark]: RCFGBuilder took 813.37ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 43.7MB in the end (delta: -12.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-11-02 21:14:26,862 INFO L158 Benchmark]: TraceAbstraction took 155191.37ms. Allocated memory was 75.5MB in the beginning and 113.2MB in the end (delta: 37.7MB). Free memory was 43.0MB in the beginning and 83.3MB in the end (delta: -40.3MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2022-11-02 21:14:26,864 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 60.8MB. Free memory was 41.1MB in the beginning and 41.0MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.93ms. Allocated memory is still 60.8MB. Free memory was 36.5MB in the beginning and 35.8MB in the end (delta: 708.4kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.26ms. Allocated memory is still 60.8MB. Free memory was 35.6MB in the beginning and 33.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 83.88ms. Allocated memory is still 60.8MB. Free memory was 33.4MB in the beginning and 31.2MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 813.37ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 43.7MB in the end (delta: -12.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 155191.37ms. Allocated memory was 75.5MB in the beginning and 113.2MB in the end (delta: 37.7MB). Free memory was 43.0MB in the beginning and 83.3MB in the end (delta: -40.3MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.offset_90| input size 161 context size 161 output size 161 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.offset_90| input size 161 context size 161 output size 161: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-02 21:14:26,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66ae9539-f23d-454a-bcc6-30a8d501614d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.offset_90| input size 161 context size 161 output size 161