./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- 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-8393723 [2022-11-18 20:00:10,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:00:10,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:00:10,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:00:10,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:00:10,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:00:10,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:00:10,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:00:10,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:00:10,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:00:10,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:00:10,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:00:10,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:00:10,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:00:10,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:00:10,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:00:10,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:00:10,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:00:10,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:00:10,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:00:10,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:00:10,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:00:10,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:00:10,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:00:10,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:00:10,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:00:10,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:00:10,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:00:10,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:00:10,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:00:10,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:00:10,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:00:10,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:00:10,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:00:10,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:00:10,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:00:10,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:00:10,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:00:10,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:00:10,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:00:10,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:00:10,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:00:10,680 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:00:10,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:00:10,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:00:10,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:00:10,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:00:10,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:00:10,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:00:10,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:00:10,687 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:00:10,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:00:10,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:00:10,689 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:00:10,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:00:10,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:00:10,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:00:10,690 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:00:10,690 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:00:10,690 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:00:10,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:00:10,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:00:10,691 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:00:10,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:00:10,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:00:10,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:00:10,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:00:10,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:00:10,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:00:10,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:00:10,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:00:10,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:00:10,693 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_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/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_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2022-11-18 20:00:10,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:00:11,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:00:11,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:00:11,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:00:11,009 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:00:11,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2022-11-18 20:00:11,088 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/data/318de4961/7b60a909730a4512b48a90e815f7a78f/FLAGa9f7036a6 [2022-11-18 20:00:11,692 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:00:11,692 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2022-11-18 20:00:11,704 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/data/318de4961/7b60a909730a4512b48a90e815f7a78f/FLAGa9f7036a6 [2022-11-18 20:00:11,996 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/data/318de4961/7b60a909730a4512b48a90e815f7a78f [2022-11-18 20:00:12,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:00:12,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:00:12,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:00:12,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:00:12,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:00:12,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:00:11" (1/1) ... [2022-11-18 20:00:12,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616efa99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12, skipping insertion in model container [2022-11-18 20:00:12,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:00:11" (1/1) ... [2022-11-18 20:00:12,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:00:12,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:00:12,469 WARN L234 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_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2022-11-18 20:00:12,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:00:12,487 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:00:12,559 WARN L234 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_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2022-11-18 20:00:12,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:00:12,593 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:00:12,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12 WrapperNode [2022-11-18 20:00:12,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:00:12,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:00:12,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:00:12,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:00:12,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (1/1) ... [2022-11-18 20:00:12,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (1/1) ... [2022-11-18 20:00:12,664 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2022-11-18 20:00:12,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:00:12,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:00:12,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:00:12,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:00:12,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (1/1) ... [2022-11-18 20:00:12,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (1/1) ... [2022-11-18 20:00:12,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (1/1) ... [2022-11-18 20:00:12,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (1/1) ... [2022-11-18 20:00:12,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (1/1) ... [2022-11-18 20:00:12,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (1/1) ... [2022-11-18 20:00:12,696 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (1/1) ... [2022-11-18 20:00:12,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (1/1) ... [2022-11-18 20:00:12,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:00:12,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:00:12,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:00:12,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:00:12,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (1/1) ... [2022-11-18 20:00:12,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:00:12,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:12,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:00:12,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:00:12,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:00:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:00:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-18 20:00:12,808 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-18 20:00:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:00:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:00:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:00:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:00:12,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:00:12,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:00:12,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:00:12,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:00:12,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:00:12,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:00:12,996 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:00:13,010 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:00:13,447 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:00:13,454 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:00:13,454 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-18 20:00:13,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:00:13 BoogieIcfgContainer [2022-11-18 20:00:13,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:00:13,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:00:13,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:00:13,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:00:13,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:00:11" (1/3) ... [2022-11-18 20:00:13,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43950877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:00:13, skipping insertion in model container [2022-11-18 20:00:13,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:00:12" (2/3) ... [2022-11-18 20:00:13,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43950877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:00:13, skipping insertion in model container [2022-11-18 20:00:13,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:00:13" (3/3) ... [2022-11-18 20:00:13,477 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2022-11-18 20:00:13,499 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:00:13,499 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-11-18 20:00:13,560 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:00:13,567 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@134da8e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:00:13,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-11-18 20:00:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 66 states have (on average 2.090909090909091) internal successors, (138), 126 states have internal predecessors, (138), 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-18 20:00:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:00:13,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:13,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:00:13,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:13,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash 895333938, now seen corresponding path program 1 times [2022-11-18 20:00:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:13,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317999725] [2022-11-18 20:00:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:13,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:00:13,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:13,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317999725] [2022-11-18 20:00:13,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317999725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:13,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:00:13,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:00:13,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652570675] [2022-11-18 20:00:13,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:13,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:00:13,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:14,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:00:14,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:00:14,008 INFO L87 Difference]: Start difference. First operand has 131 states, 66 states have (on average 2.090909090909091) internal successors, (138), 126 states have internal predecessors, (138), 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, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:00:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:14,220 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2022-11-18 20:00:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:00:14,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-18 20:00:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:14,236 INFO L225 Difference]: With dead ends: 128 [2022-11-18 20:00:14,236 INFO L226 Difference]: Without dead ends: 125 [2022-11-18 20:00:14,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 20:00:14,243 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:14,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 195 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:00:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-18 20:00:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-18 20:00:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 1.984375) internal successors, (127), 120 states have internal predecessors, (127), 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-18 20:00:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2022-11-18 20:00:14,288 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 6 [2022-11-18 20:00:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:14,288 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2022-11-18 20:00:14,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:00:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2022-11-18 20:00:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:00:14,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:14,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:00:14,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:00:14,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash 895333939, now seen corresponding path program 1 times [2022-11-18 20:00:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:14,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353972396] [2022-11-18 20:00:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:00:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:14,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353972396] [2022-11-18 20:00:14,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353972396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:14,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:00:14,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:00:14,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746036535] [2022-11-18 20:00:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:14,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:00:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:14,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:00:14,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:00:14,467 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:00:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:14,623 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2022-11-18 20:00:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:00:14,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-18 20:00:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:14,625 INFO L225 Difference]: With dead ends: 122 [2022-11-18 20:00:14,627 INFO L226 Difference]: Without dead ends: 122 [2022-11-18 20:00:14,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 20:00:14,629 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:14,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 197 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:00:14,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-18 20:00:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-18 20:00:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.9375) internal successors, (124), 117 states have internal predecessors, (124), 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-18 20:00:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2022-11-18 20:00:14,650 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 6 [2022-11-18 20:00:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:14,653 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2022-11-18 20:00:14,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:00:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2022-11-18 20:00:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:00:14,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:14,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:14,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:00:14,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:14,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1787864811, now seen corresponding path program 1 times [2022-11-18 20:00:14,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:14,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880371919] [2022-11-18 20:00:14,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:14,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:14,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:00:14,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:14,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880371919] [2022-11-18 20:00:14,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880371919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:14,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:00:14,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:00:14,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711210078] [2022-11-18 20:00:14,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:14,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:00:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:14,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:00:14,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:00:14,864 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:00:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:15,014 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-11-18 20:00:15,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:00:15,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-18 20:00:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:15,016 INFO L225 Difference]: With dead ends: 133 [2022-11-18 20:00:15,016 INFO L226 Difference]: Without dead ends: 133 [2022-11-18 20:00:15,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-18 20:00:15,018 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:15,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 295 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:00:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-18 20:00:15,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2022-11-18 20:00:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 118 states have internal predecessors, (125), 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-18 20:00:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2022-11-18 20:00:15,029 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 14 [2022-11-18 20:00:15,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:15,030 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2022-11-18 20:00:15,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:00:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2022-11-18 20:00:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:00:15,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:15,031 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:15,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:00:15,032 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134272, now seen corresponding path program 1 times [2022-11-18 20:00:15,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:15,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144176221] [2022-11-18 20:00:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:15,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:15,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:15,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:00:15,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:15,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144176221] [2022-11-18 20:00:15,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144176221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:15,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:00:15,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:00:15,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390698180] [2022-11-18 20:00:15,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:15,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:00:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:15,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:00:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:00:15,278 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:00:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:15,593 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2022-11-18 20:00:15,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:00:15,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-18 20:00:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:15,596 INFO L225 Difference]: With dead ends: 123 [2022-11-18 20:00:15,597 INFO L226 Difference]: Without dead ends: 123 [2022-11-18 20:00:15,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:00:15,598 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 21 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:15,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 400 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:00:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-18 20:00:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2022-11-18 20:00:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 117 states have internal predecessors, (124), 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-18 20:00:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2022-11-18 20:00:15,607 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2022-11-18 20:00:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:15,607 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2022-11-18 20:00:15,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:00:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2022-11-18 20:00:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:00:15,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:15,609 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:15,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:00:15,609 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:15,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:15,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134271, now seen corresponding path program 1 times [2022-11-18 20:00:15,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:15,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765410953] [2022-11-18 20:00:15,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:15,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:15,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:15,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:00:16,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:16,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765410953] [2022-11-18 20:00:16,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765410953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:16,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:00:16,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:00:16,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559392222] [2022-11-18 20:00:16,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:16,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:00:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:16,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:00:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:00:16,024 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:00:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:16,350 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-11-18 20:00:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:00:16,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-18 20:00:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:16,354 INFO L225 Difference]: With dead ends: 122 [2022-11-18 20:00:16,354 INFO L226 Difference]: Without dead ends: 122 [2022-11-18 20:00:16,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:00:16,355 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 19 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:16,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 424 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:00:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-18 20:00:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-11-18 20:00:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 116 states have internal predecessors, (123), 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-18 20:00:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-11-18 20:00:16,362 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2022-11-18 20:00:16,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:16,368 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-11-18 20:00:16,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:00:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-11-18 20:00:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:00:16,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:16,369 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:16,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:00:16,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:16,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash 524578273, now seen corresponding path program 1 times [2022-11-18 20:00:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:16,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231844252] [2022-11-18 20:00:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:16,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:16,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:00:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:16,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231844252] [2022-11-18 20:00:16,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231844252] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:16,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245952266] [2022-11-18 20:00:16,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:16,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:16,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:16,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:16,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:00:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:16,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-18 20:00:16,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:16,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:00:17,084 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-18 20:00:17,269 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:00:17,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 20:00:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-18 20:00:17,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:17,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245952266] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:17,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:00:17,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-18 20:00:17,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125631595] [2022-11-18 20:00:17,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:17,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:00:17,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:00:17,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-18 20:00:17,382 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:00:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:17,776 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2022-11-18 20:00:17,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:00:17,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-11-18 20:00:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:17,778 INFO L225 Difference]: With dead ends: 128 [2022-11-18 20:00:17,778 INFO L226 Difference]: Without dead ends: 128 [2022-11-18 20:00:17,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2022-11-18 20:00:17,779 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 5 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:17,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 462 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 369 Invalid, 0 Unknown, 147 Unchecked, 0.3s Time] [2022-11-18 20:00:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-18 20:00:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2022-11-18 20:00:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8695652173913044) internal successors, (129), 120 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:00:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2022-11-18 20:00:17,786 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 26 [2022-11-18 20:00:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:17,786 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2022-11-18 20:00:17,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:00:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-11-18 20:00:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:00:17,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:17,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:17,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:00:17,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 20:00:17,989 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:17,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:17,989 INFO L85 PathProgramCache]: Analyzing trace with hash 524578274, now seen corresponding path program 1 times [2022-11-18 20:00:17,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:17,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909243705] [2022-11-18 20:00:17,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:17,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:18,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:00:18,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:18,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909243705] [2022-11-18 20:00:18,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909243705] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:18,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158873935] [2022-11-18 20:00:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:18,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:18,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:18,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:18,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:00:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:18,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:00:18,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:18,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:00:18,992 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_493 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-18 20:00:19,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:19,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:00:19,068 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:00:19,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:00:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-18 20:00:19,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:21,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158873935] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:21,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:00:21,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2022-11-18 20:00:21,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193097593] [2022-11-18 20:00:21,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:21,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:00:21,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:21,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:00:21,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=263, Unknown=1, NotChecked=32, Total=342 [2022-11-18 20:00:21,295 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-18 20:00:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:22,141 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2022-11-18 20:00:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:00:22,141 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-11-18 20:00:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:22,142 INFO L225 Difference]: With dead ends: 128 [2022-11-18 20:00:22,142 INFO L226 Difference]: Without dead ends: 128 [2022-11-18 20:00:22,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=69, Invalid=396, Unknown=1, NotChecked=40, Total=506 [2022-11-18 20:00:22,144 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:22,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 783 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 777 Invalid, 0 Unknown, 153 Unchecked, 0.6s Time] [2022-11-18 20:00:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-18 20:00:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2022-11-18 20:00:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.855072463768116) internal successors, (128), 120 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:00:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-11-18 20:00:22,159 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 26 [2022-11-18 20:00:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:22,160 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-11-18 20:00:22,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-18 20:00:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-11-18 20:00:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 20:00:22,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:22,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:22,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:00:22,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:22,368 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1608700855, now seen corresponding path program 1 times [2022-11-18 20:00:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:22,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744254070] [2022-11-18 20:00:22,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:22,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:22,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:00:22,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:22,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744254070] [2022-11-18 20:00:22,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744254070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:22,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518554532] [2022-11-18 20:00:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:22,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:22,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:22,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:22,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:00:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:22,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:00:22,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:00:22,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:00:22,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518554532] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:00:22,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:00:22,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-18 20:00:22,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379281714] [2022-11-18 20:00:22,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:22,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:00:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:00:22,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:00:22,889 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 20:00:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:23,095 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-11-18 20:00:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:00:23,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-18 20:00:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:23,096 INFO L225 Difference]: With dead ends: 127 [2022-11-18 20:00:23,096 INFO L226 Difference]: Without dead ends: 127 [2022-11-18 20:00:23,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:00:23,098 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:23,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 618 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:00:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-18 20:00:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2022-11-18 20:00:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 120 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:00:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2022-11-18 20:00:23,105 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 28 [2022-11-18 20:00:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:23,105 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2022-11-18 20:00:23,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 20:00:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2022-11-18 20:00:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:00:23,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:23,107 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:23,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:00:23,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:23,316 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:23,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:23,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661710, now seen corresponding path program 1 times [2022-11-18 20:00:23,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:23,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802454392] [2022-11-18 20:00:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:23,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:23,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:23,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:00:23,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:23,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802454392] [2022-11-18 20:00:23,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802454392] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:23,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365594837] [2022-11-18 20:00:23,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:23,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:23,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:23,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:23,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:00:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:23,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 20:00:23,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:00:23,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:23,660 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 20:00:23,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:00:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:00:23,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365594837] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:00:23,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:00:23,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-18 20:00:23,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860522704] [2022-11-18 20:00:23,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:23,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:00:23,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:23,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:00:23,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:00:23,685 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:00:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:23,925 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-11-18 20:00:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:00:23,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-11-18 20:00:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:23,927 INFO L225 Difference]: With dead ends: 131 [2022-11-18 20:00:23,927 INFO L226 Difference]: Without dead ends: 131 [2022-11-18 20:00:23,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:00:23,928 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 12 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:23,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 403 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:00:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-18 20:00:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-11-18 20:00:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 123 states have internal predecessors, (132), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:00:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2022-11-18 20:00:23,934 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 29 [2022-11-18 20:00:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:23,935 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2022-11-18 20:00:23,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:00:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-11-18 20:00:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:00:23,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:23,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:23,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:00:24,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:24,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:24,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:24,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661709, now seen corresponding path program 1 times [2022-11-18 20:00:24,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:24,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12206532] [2022-11-18 20:00:24,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:24,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:24,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:00:24,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:24,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12206532] [2022-11-18 20:00:24,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12206532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:24,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359995334] [2022-11-18 20:00:24,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:24,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:24,462 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:24,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:00:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:24,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:00:24,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:00:24,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:24,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:00:24,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-18 20:00:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:00:24,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359995334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:00:24,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:00:24,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-18 20:00:24,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742924130] [2022-11-18 20:00:24,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:24,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:00:24,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:24,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:00:24,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:00:24,987 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-18 20:00:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:25,331 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2022-11-18 20:00:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:00:25,332 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-11-18 20:00:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:25,333 INFO L225 Difference]: With dead ends: 136 [2022-11-18 20:00:25,333 INFO L226 Difference]: Without dead ends: 136 [2022-11-18 20:00:25,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:00:25,334 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 36 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:25,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1106 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:00:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-18 20:00:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2022-11-18 20:00:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 123 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:00:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2022-11-18 20:00:25,347 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 29 [2022-11-18 20:00:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:25,351 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2022-11-18 20:00:25,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-18 20:00:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2022-11-18 20:00:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 20:00:25,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:25,354 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:25,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-18 20:00:25,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:25,560 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash -374905453, now seen corresponding path program 1 times [2022-11-18 20:00:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:25,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128942376] [2022-11-18 20:00:25,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:25,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:25,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:00:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:25,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128942376] [2022-11-18 20:00:25,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128942376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:25,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:00:25,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:00:25,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107500034] [2022-11-18 20:00:25,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:25,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:00:25,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:25,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:00:25,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:00:25,730 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:00:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:26,074 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-11-18 20:00:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:00:26,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-18 20:00:26,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:26,076 INFO L225 Difference]: With dead ends: 129 [2022-11-18 20:00:26,076 INFO L226 Difference]: Without dead ends: 129 [2022-11-18 20:00:26,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:00:26,077 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 24 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:26,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 445 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:00:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-18 20:00:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-11-18 20:00:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 122 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:00:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-11-18 20:00:26,082 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 30 [2022-11-18 20:00:26,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:26,082 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-11-18 20:00:26,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:00:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-11-18 20:00:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 20:00:26,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:26,083 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:26,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:00:26,084 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:26,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash -374905452, now seen corresponding path program 1 times [2022-11-18 20:00:26,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:26,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664765634] [2022-11-18 20:00:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:26,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:26,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:00:26,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:26,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664765634] [2022-11-18 20:00:26,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664765634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:26,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:00:26,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:00:26,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061966907] [2022-11-18 20:00:26,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:26,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:00:26,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:26,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:00:26,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:00:26,405 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:00:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:26,740 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-11-18 20:00:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:00:26,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-18 20:00:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:26,742 INFO L225 Difference]: With dead ends: 127 [2022-11-18 20:00:26,742 INFO L226 Difference]: Without dead ends: 127 [2022-11-18 20:00:26,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:00:26,743 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 20 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:26,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 475 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:00:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-18 20:00:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-18 20:00:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:00:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-11-18 20:00:26,747 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2022-11-18 20:00:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:26,748 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-11-18 20:00:26,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:00:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-11-18 20:00:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 20:00:26,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:26,749 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:26,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:00:26,750 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash -688454360, now seen corresponding path program 1 times [2022-11-18 20:00:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:26,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005955778] [2022-11-18 20:00:26,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:26,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:26,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:00:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:00:26,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:26,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005955778] [2022-11-18 20:00:26,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005955778] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:26,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167859923] [2022-11-18 20:00:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:26,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:26,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:26,926 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:26,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:00:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:27,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:00:27,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:00:27,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:00:27,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167859923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:27,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:00:27,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-18 20:00:27,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141256160] [2022-11-18 20:00:27,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:27,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:00:27,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:27,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:00:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:00:27,186 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:00:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:27,199 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-11-18 20:00:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:00:27,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-18 20:00:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:27,201 INFO L225 Difference]: With dead ends: 115 [2022-11-18 20:00:27,201 INFO L226 Difference]: Without dead ends: 115 [2022-11-18 20:00:27,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:00:27,203 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 99 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:27,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 145 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:00:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-18 20:00:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-18 20:00:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 110 states have internal predecessors, (115), 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-18 20:00:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2022-11-18 20:00:27,210 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 41 [2022-11-18 20:00:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:27,210 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2022-11-18 20:00:27,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:00:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-11-18 20:00:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-18 20:00:27,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:27,216 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-18 20:00:27,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-18 20:00:27,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:27,421 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008248, now seen corresponding path program 1 times [2022-11-18 20:00:27,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:27,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109486659] [2022-11-18 20:00:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:27,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:27,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:27,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:00:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:00:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:27,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109486659] [2022-11-18 20:00:27,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109486659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:27,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892298769] [2022-11-18 20:00:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:27,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:27,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:27,965 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:27,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:00:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:28,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:00:28,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:28,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:00:28,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:00:28,240 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582))))) is different from true [2022-11-18 20:00:28,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:28,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:00:28,324 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-18 20:00:28,349 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:00:28,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:00:28,401 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:00:28,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:00:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2022-11-18 20:00:28,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:28,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892298769] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:28,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:00:28,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2022-11-18 20:00:28,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798165450] [2022-11-18 20:00:28,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:28,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:00:28,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:28,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:00:28,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2022-11-18 20:00:28,743 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:00:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:29,236 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2022-11-18 20:00:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:00:29,237 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-11-18 20:00:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:29,237 INFO L225 Difference]: With dead ends: 126 [2022-11-18 20:00:29,238 INFO L226 Difference]: Without dead ends: 126 [2022-11-18 20:00:29,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=188, Unknown=2, NotChecked=58, Total=306 [2022-11-18 20:00:29,238 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 125 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:29,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 232 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 243 Invalid, 0 Unknown, 254 Unchecked, 0.2s Time] [2022-11-18 20:00:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-18 20:00:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2022-11-18 20:00:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 103 states have internal predecessors, (108), 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-18 20:00:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2022-11-18 20:00:29,242 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 43 [2022-11-18 20:00:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:29,242 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2022-11-18 20:00:29,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:00:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2022-11-18 20:00:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-18 20:00:29,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:29,243 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-18 20:00:29,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:00:29,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:00:29,450 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:29,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:29,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008247, now seen corresponding path program 1 times [2022-11-18 20:00:29,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:29,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688609394] [2022-11-18 20:00:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:29,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:29,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:30,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:30,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:00:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:00:30,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:30,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688609394] [2022-11-18 20:00:30,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688609394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:30,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171521255] [2022-11-18 20:00:30,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:30,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:30,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:30,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:30,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:00:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:30,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 20:00:30,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:30,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:00:30,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:00:30,553 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-18 20:00:30,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:30,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:00:30,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:00:30,632 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1824 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1824))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-18 20:00:30,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:30,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:00:30,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:00:30,763 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1825 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1825) |c_#length|)))) is different from true [2022-11-18 20:00:30,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:30,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:00:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-18 20:00:30,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:30,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171521255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:30,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:00:30,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-18 20:00:30,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151427377] [2022-11-18 20:00:30,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:30,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:00:30,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:30,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:00:30,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=145, Unknown=3, NotChecked=78, Total=272 [2022-11-18 20:00:30,932 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:00:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:31,429 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2022-11-18 20:00:31,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:00:31,430 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-11-18 20:00:31,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:31,431 INFO L225 Difference]: With dead ends: 117 [2022-11-18 20:00:31,431 INFO L226 Difference]: Without dead ends: 117 [2022-11-18 20:00:31,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=187, Unknown=3, NotChecked=90, Total=342 [2022-11-18 20:00:31,431 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 207 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:31,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 172 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 325 Invalid, 0 Unknown, 351 Unchecked, 0.4s Time] [2022-11-18 20:00:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-18 20:00:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-11-18 20:00:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.523076923076923) internal successors, (99), 94 states have internal predecessors, (99), 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-18 20:00:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2022-11-18 20:00:31,435 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 43 [2022-11-18 20:00:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:31,435 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2022-11-18 20:00:31,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:00:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2022-11-18 20:00:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-18 20:00:31,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:31,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2022-11-18 20:00:31,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:00:31,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:00:31,646 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:31,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625015, now seen corresponding path program 1 times [2022-11-18 20:00:31,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:31,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089165779] [2022-11-18 20:00:31,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:31,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:31,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:31,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:31,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:00:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-18 20:00:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:31,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089165779] [2022-11-18 20:00:31,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089165779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:31,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:00:31,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:00:31,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669351948] [2022-11-18 20:00:31,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:31,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:00:31,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:31,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:00:31,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:00:31,832 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:00:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:32,061 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-11-18 20:00:32,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:00:32,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-11-18 20:00:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:32,062 INFO L225 Difference]: With dead ends: 113 [2022-11-18 20:00:32,063 INFO L226 Difference]: Without dead ends: 113 [2022-11-18 20:00:32,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:00:32,063 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 70 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:32,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 264 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:00:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-18 20:00:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2022-11-18 20:00:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 90 states have internal predecessors, (95), 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-18 20:00:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-11-18 20:00:32,067 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 45 [2022-11-18 20:00:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:32,067 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-11-18 20:00:32,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:00:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-11-18 20:00:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-18 20:00:32,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:32,068 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2022-11-18 20:00:32,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:00:32,068 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625014, now seen corresponding path program 1 times [2022-11-18 20:00:32,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:32,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158556747] [2022-11-18 20:00:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:32,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:32,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:32,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:00:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-18 20:00:32,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:32,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158556747] [2022-11-18 20:00:32,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158556747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:32,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:00:32,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:00:32,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205742260] [2022-11-18 20:00:32,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:32,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:00:32,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:32,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:00:32,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:00:32,427 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:00:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:32,640 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-11-18 20:00:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:00:32,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-11-18 20:00:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:32,642 INFO L225 Difference]: With dead ends: 91 [2022-11-18 20:00:32,642 INFO L226 Difference]: Without dead ends: 91 [2022-11-18 20:00:32,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:00:32,643 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:32,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 275 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:00:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-18 20:00:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-18 20:00:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4) internal successors, (91), 86 states have internal predecessors, (91), 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-18 20:00:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-11-18 20:00:32,646 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 45 [2022-11-18 20:00:32,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:32,647 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-11-18 20:00:32,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:00:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-11-18 20:00:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-18 20:00:32,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:32,648 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2022-11-18 20:00:32,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:00:32,649 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:32,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash -601855080, now seen corresponding path program 1 times [2022-11-18 20:00:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:32,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762008232] [2022-11-18 20:00:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:33,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:33,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:00:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 20:00:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:33,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762008232] [2022-11-18 20:00:33,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762008232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:33,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107752391] [2022-11-18 20:00:33,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:33,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:33,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:33,522 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:33,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:00:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:33,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:00:33,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:33,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:00:34,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-18 20:00:34,245 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2357 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2357) |c_#memory_$Pointer$.base|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-18 20:00:34,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:34,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:00:34,302 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-11-18 20:00:34,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2022-11-18 20:00:34,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 20:00:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-18 20:00:34,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:34,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107752391] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:34,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:00:34,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-11-18 20:00:34,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533047277] [2022-11-18 20:00:34,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:34,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:00:34,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:34,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:00:34,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=524, Unknown=1, NotChecked=46, Total=650 [2022-11-18 20:00:34,473 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 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-18 20:00:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:35,285 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-11-18 20:00:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:00:35,286 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 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 46 [2022-11-18 20:00:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:35,287 INFO L225 Difference]: With dead ends: 90 [2022-11-18 20:00:35,287 INFO L226 Difference]: Without dead ends: 90 [2022-11-18 20:00:35,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=856, Unknown=1, NotChecked=60, Total=1056 [2022-11-18 20:00:35,288 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:35,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 607 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 668 Invalid, 0 Unknown, 93 Unchecked, 0.6s Time] [2022-11-18 20:00:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-18 20:00:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-18 20:00:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 85 states have internal predecessors, (90), 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-18 20:00:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-11-18 20:00:35,292 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 46 [2022-11-18 20:00:35,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:35,292 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-11-18 20:00:35,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 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-18 20:00:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-11-18 20:00:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-18 20:00:35,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:35,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2022-11-18 20:00:35,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:00:35,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:00:35,500 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -601855079, now seen corresponding path program 1 times [2022-11-18 20:00:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:35,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450748960] [2022-11-18 20:00:35,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:36,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:36,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:36,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:00:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:00:37,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:37,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450748960] [2022-11-18 20:00:37,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450748960] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:37,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595883219] [2022-11-18 20:00:37,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:37,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:37,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:37,131 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:37,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:00:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:37,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-18 20:00:37,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:37,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:00:37,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-18 20:00:37,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-18 20:00:38,244 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2605 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2605) |c_#memory_$Pointer$.offset|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2604 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2604))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2599 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2599) |c_#length|)))) is different from true [2022-11-18 20:00:38,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:38,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-18 20:00:38,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:38,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-18 20:00:38,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:38,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-18 20:00:38,366 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:00:38,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-18 20:00:38,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-18 20:00:38,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 20:00:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-18 20:00:38,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:38,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595883219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:38,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:00:38,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2022-11-18 20:00:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110078465] [2022-11-18 20:00:38,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:38,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-18 20:00:38,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:38,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-18 20:00:38,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1024, Unknown=2, NotChecked=64, Total=1190 [2022-11-18 20:00:38,899 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:00:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:40,576 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-18 20:00:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:00:40,577 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-18 20:00:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:40,577 INFO L225 Difference]: With dead ends: 89 [2022-11-18 20:00:40,577 INFO L226 Difference]: Without dead ends: 89 [2022-11-18 20:00:40,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=200, Invalid=1779, Unknown=5, NotChecked=86, Total=2070 [2022-11-18 20:00:40,579 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 48 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:40,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 799 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 614 Invalid, 0 Unknown, 181 Unchecked, 0.7s Time] [2022-11-18 20:00:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-18 20:00:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-18 20:00:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 84 states have internal predecessors, (89), 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-18 20:00:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-18 20:00:40,582 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 46 [2022-11-18 20:00:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:40,583 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-18 20:00:40,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:00:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-18 20:00:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:00:40,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:40,584 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1] [2022-11-18 20:00:40,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:00:40,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:40,784 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854233, now seen corresponding path program 1 times [2022-11-18 20:00:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:40,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164495311] [2022-11-18 20:00:40,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:40,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:41,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:41,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:00:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:00:42,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:42,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164495311] [2022-11-18 20:00:42,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164495311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:42,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567386519] [2022-11-18 20:00:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:42,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:42,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:42,866 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:42,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:00:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:43,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-18 20:00:43,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:43,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:00:43,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:00:43,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:43,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:00:43,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 14 [2022-11-18 20:00:43,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:00:44,020 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2860 (Array Int Int)) (v_ArrVal_2859 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2859) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2860)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-18 20:00:44,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:44,099 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:00:44,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2022-11-18 20:00:44,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:44,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-11-18 20:00:44,154 INFO L321 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2022-11-18 20:00:44,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2022-11-18 20:00:44,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-11-18 20:00:44,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:44,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:00:44,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 17 [2022-11-18 20:00:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-18 20:00:44,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:44,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567386519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:44,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:00:44,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 33 [2022-11-18 20:00:44,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363038806] [2022-11-18 20:00:44,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:44,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-18 20:00:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-18 20:00:44,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1144, Unknown=1, NotChecked=68, Total=1332 [2022-11-18 20:00:44,635 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:00:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:46,639 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-11-18 20:00:46,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:00:46,640 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2022-11-18 20:00:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:46,641 INFO L225 Difference]: With dead ends: 129 [2022-11-18 20:00:46,641 INFO L226 Difference]: Without dead ends: 129 [2022-11-18 20:00:46,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=238, Invalid=2021, Unknown=1, NotChecked=92, Total=2352 [2022-11-18 20:00:46,643 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 103 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:46,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1459 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1340 Invalid, 0 Unknown, 155 Unchecked, 1.3s Time] [2022-11-18 20:00:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-18 20:00:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 88. [2022-11-18 20:00:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) internal successors, (88), 83 states have internal predecessors, (88), 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-18 20:00:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-18 20:00:46,647 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 48 [2022-11-18 20:00:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:46,648 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-18 20:00:46,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:00:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-18 20:00:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:00:46,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:46,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1] [2022-11-18 20:00:46,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:00:46,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:46,850 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:46,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:46,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854234, now seen corresponding path program 1 times [2022-11-18 20:00:46,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:46,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202070537] [2022-11-18 20:00:46,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:48,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:48,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:48,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:00:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:00:50,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:50,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202070537] [2022-11-18 20:00:50,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202070537] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:50,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787521753] [2022-11-18 20:00:50,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:50,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:50,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:50,055 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:50,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:00:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:50,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-18 20:00:50,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:50,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:00:50,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:00:50,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:00:51,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:00:51,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 32 [2022-11-18 20:00:51,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:00:51,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-11-18 20:00:51,607 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3117 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3117))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3111 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3111) |c_#length|)) (exists ((v_ArrVal_3116 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3116) |c_#memory_$Pointer$.offset|)))) is different from true [2022-11-18 20:00:51,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:51,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:51,675 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 20:00:51,675 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 48 treesize of output 47 [2022-11-18 20:00:51,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:51,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-18 20:00:51,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:51,704 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:00:51,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 59 [2022-11-18 20:00:51,726 INFO L321 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2022-11-18 20:00:51,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 20:00:51,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:00:51,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:00:51,929 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 41 [2022-11-18 20:00:51,940 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-18 20:00:51,941 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 25 [2022-11-18 20:00:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-18 20:00:52,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:52,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787521753] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:52,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:00:52,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 44 [2022-11-18 20:00:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191625976] [2022-11-18 20:00:52,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-18 20:00:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-18 20:00:52,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2196, Unknown=2, NotChecked=94, Total=2450 [2022-11-18 20:00:52,607 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 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-18 20:00:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:55,862 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-11-18 20:00:55,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:00:55,867 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 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 48 [2022-11-18 20:00:55,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:55,869 INFO L225 Difference]: With dead ends: 130 [2022-11-18 20:00:55,869 INFO L226 Difference]: Without dead ends: 130 [2022-11-18 20:00:55,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=312, Invalid=3596, Unknown=2, NotChecked=122, Total=4032 [2022-11-18 20:00:55,871 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 278 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:55,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1845 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1873 Invalid, 0 Unknown, 328 Unchecked, 1.7s Time] [2022-11-18 20:00:55,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-18 20:00:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 87. [2022-11-18 20:00:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 82 states have internal predecessors, (87), 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-18 20:00:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-11-18 20:00:55,875 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 48 [2022-11-18 20:00:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:55,875 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-11-18 20:00:55,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 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-18 20:00:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-11-18 20:00:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:00:55,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:55,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:55,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:00:56,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:56,083 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:56,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433199, now seen corresponding path program 1 times [2022-11-18 20:00:56,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:56,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364750585] [2022-11-18 20:00:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:56,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:56,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:00:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-18 20:00:56,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:56,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364750585] [2022-11-18 20:00:56,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364750585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:56,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:00:56,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:00:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273382364] [2022-11-18 20:00:56,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:56,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:00:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:56,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:00:56,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:00:56,447 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:00:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:56,797 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2022-11-18 20:00:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:00:56,797 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-11-18 20:00:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:56,798 INFO L225 Difference]: With dead ends: 150 [2022-11-18 20:00:56,798 INFO L226 Difference]: Without dead ends: 150 [2022-11-18 20:00:56,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:00:56,799 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 269 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:56,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 380 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:00:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-18 20:00:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 90. [2022-11-18 20:00:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.318840579710145) internal successors, (91), 85 states have internal predecessors, (91), 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-18 20:00:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-11-18 20:00:56,803 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 51 [2022-11-18 20:00:56,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:56,803 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-11-18 20:00:56,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:00:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-11-18 20:00:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:00:56,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:56,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:56,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 20:00:56,804 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:56,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:56,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433198, now seen corresponding path program 1 times [2022-11-18 20:00:56,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:56,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311829264] [2022-11-18 20:00:56,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:57,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:00:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-18 20:00:57,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:57,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311829264] [2022-11-18 20:00:57,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311829264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:00:57,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:00:57,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 20:00:57,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560304840] [2022-11-18 20:00:57,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:00:57,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:00:57,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:57,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:00:57,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:00:57,428 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:00:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:00:57,813 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-11-18 20:00:57,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:00:57,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-11-18 20:00:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:00:57,815 INFO L225 Difference]: With dead ends: 132 [2022-11-18 20:00:57,815 INFO L226 Difference]: Without dead ends: 132 [2022-11-18 20:00:57,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:00:57,816 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 278 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:00:57,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 466 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:00:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-18 20:00:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2022-11-18 20:00:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 87 states have internal predecessors, (93), 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-18 20:00:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2022-11-18 20:00:57,820 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 51 [2022-11-18 20:00:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:00:57,820 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2022-11-18 20:00:57,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:00:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-11-18 20:00:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-18 20:00:57,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:00:57,821 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:00:57,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 20:00:57,822 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:00:57,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:00:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1197458036, now seen corresponding path program 1 times [2022-11-18 20:00:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:00:57,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552565159] [2022-11-18 20:00:57,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:57,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:00:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:58,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:00:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:58,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:00:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:58,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:00:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:00:58,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:00:58,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552565159] [2022-11-18 20:00:58,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552565159] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:58,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037169874] [2022-11-18 20:00:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:00:58,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:00:58,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:00:58,470 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:00:58,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:00:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:00:58,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-18 20:00:58,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:00:59,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 20:00:59,271 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3729 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3729)))) is different from true [2022-11-18 20:00:59,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:59,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-18 20:00:59,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-18 20:00:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-18 20:00:59,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:00:59,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037169874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:00:59,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:00:59,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-18 20:00:59,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741423559] [2022-11-18 20:00:59,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:00:59,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 20:00:59,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:00:59,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 20:00:59,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=613, Unknown=6, NotChecked=50, Total=756 [2022-11-18 20:00:59,531 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 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-18 20:01:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:00,219 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-11-18 20:01:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:01:00,219 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 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 53 [2022-11-18 20:01:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:00,220 INFO L225 Difference]: With dead ends: 83 [2022-11-18 20:01:00,220 INFO L226 Difference]: Without dead ends: 83 [2022-11-18 20:01:00,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=955, Unknown=6, NotChecked=64, Total=1190 [2022-11-18 20:01:00,221 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 219 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:00,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 538 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 435 Invalid, 0 Unknown, 85 Unchecked, 0.4s Time] [2022-11-18 20:01:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-18 20:01:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-18 20:01:00,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 78 states have internal predecessors, (82), 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-18 20:01:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-11-18 20:01:00,225 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 53 [2022-11-18 20:01:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:00,225 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-11-18 20:01:00,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 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-18 20:01:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-11-18 20:01:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-18 20:01:00,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:00,227 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:01:00,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-18 20:01:00,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:00,433 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:01:00,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:00,433 INFO L85 PathProgramCache]: Analyzing trace with hash -422730206, now seen corresponding path program 1 times [2022-11-18 20:01:00,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:00,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816012869] [2022-11-18 20:01:00,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:01,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:01,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-18 20:01:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:01,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816012869] [2022-11-18 20:01:01,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816012869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:01,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:01,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-18 20:01:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181131940] [2022-11-18 20:01:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:01,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:01:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:01,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:01:01,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:01:01,656 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:01:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:02,209 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-11-18 20:01:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:01:02,210 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-11-18 20:01:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:02,211 INFO L225 Difference]: With dead ends: 100 [2022-11-18 20:01:02,211 INFO L226 Difference]: Without dead ends: 100 [2022-11-18 20:01:02,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2022-11-18 20:01:02,212 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 416 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:02,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 458 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:01:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-18 20:01:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2022-11-18 20:01:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 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-18 20:01:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-18 20:01:02,214 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 54 [2022-11-18 20:01:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:02,215 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-18 20:01:02,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:01:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-18 20:01:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-18 20:01:02,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:02,216 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:01:02,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-18 20:01:02,216 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:01:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash -422730205, now seen corresponding path program 1 times [2022-11-18 20:01:02,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:02,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665359007] [2022-11-18 20:01:02,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:03,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:01:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:04,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665359007] [2022-11-18 20:01:04,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665359007] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:04,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158756706] [2022-11-18 20:01:04,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:04,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:04,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:04,779 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:04,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 20:01:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:05,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-18 20:01:05,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:05,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:01:05,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:05,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:01:06,203 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:01:06,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-11-18 20:01:06,230 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:01:06,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-18 20:01:06,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:06,407 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 20:01:06,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 38 [2022-11-18 20:01:06,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:06,430 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 20:01:06,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 52 [2022-11-18 20:01:06,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 20:01:06,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:01:06,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:06,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-18 20:01:06,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:06,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-18 20:01:06,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-18 20:01:06,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-18 20:01:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:01:06,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:01:06,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158756706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:06,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:01:06,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 39 [2022-11-18 20:01:06,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339965614] [2022-11-18 20:01:06,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:06,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:01:06,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:06,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:01:06,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1439, Unknown=2, NotChecked=0, Total=1560 [2022-11-18 20:01:06,848 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:01:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:07,288 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-11-18 20:01:07,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:01:07,288 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-11-18 20:01:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:07,289 INFO L225 Difference]: With dead ends: 81 [2022-11-18 20:01:07,289 INFO L226 Difference]: Without dead ends: 81 [2022-11-18 20:01:07,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=157, Invalid=1821, Unknown=2, NotChecked=0, Total=1980 [2022-11-18 20:01:07,290 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 25 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:07,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 691 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 144 Unchecked, 0.2s Time] [2022-11-18 20:01:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-18 20:01:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-18 20:01:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 76 states have internal predecessors, (80), 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-18 20:01:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-11-18 20:01:07,294 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 54 [2022-11-18 20:01:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:07,294 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-11-18 20:01:07,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:01:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-11-18 20:01:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:01:07,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:07,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:01:07,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:07,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-18 20:01:07,502 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:01:07,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash -755022309, now seen corresponding path program 1 times [2022-11-18 20:01:07,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:07,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898832644] [2022-11-18 20:01:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:08,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:08,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 20:01:08,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:08,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898832644] [2022-11-18 20:01:08,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898832644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:08,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88304562] [2022-11-18 20:01:08,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:08,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:08,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:08,871 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:08,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 20:01:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:09,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-18 20:01:09,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:09,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:01:09,670 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4458 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4458)))) is different from true [2022-11-18 20:01:09,676 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4459 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4459)))) is different from true [2022-11-18 20:01:09,683 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4460 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4460)))) is different from true [2022-11-18 20:01:09,691 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4460 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4460) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:01:09,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:09,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:01:09,929 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:01:09,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2022-11-18 20:01:10,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:10,044 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 20:01:10,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2022-11-18 20:01:10,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:01:10,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:10,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:01:10,216 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:01:10,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-18 20:01:10,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-18 20:01:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-11-18 20:01:10,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:10,314 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-18 20:01:10,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-18 20:01:10,397 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4465 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-18 20:01:10,407 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4464 (Array Int Int)) (v_ArrVal_4465 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4464))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-18 20:01:10,422 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4464 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4465 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4464))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-18 20:01:10,453 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4464 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4465 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4464))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1)))) is different from false [2022-11-18 20:01:10,506 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4464 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4465 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| Int) (v_ArrVal_4470 (Array Int Int))) (or (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| |c_#StackHeapBarrier|)) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_4470))) (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24|))) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_4464))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1))))) is different from false [2022-11-18 20:01:10,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88304562] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:10,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:10,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 40 [2022-11-18 20:01:10,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606326903] [2022-11-18 20:01:10,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:10,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-18 20:01:10,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:10,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-18 20:01:10,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1285, Unknown=29, NotChecked=720, Total=2162 [2022-11-18 20:01:10,510 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 41 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:01:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:11,805 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2022-11-18 20:01:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:01:11,805 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2022-11-18 20:01:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:11,806 INFO L225 Difference]: With dead ends: 103 [2022-11-18 20:01:11,806 INFO L226 Difference]: Without dead ends: 103 [2022-11-18 20:01:11,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=286, Invalid=2688, Unknown=32, NotChecked=1026, Total=4032 [2022-11-18 20:01:11,809 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 255 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 450 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:11,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1050 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1059 Invalid, 0 Unknown, 450 Unchecked, 0.6s Time] [2022-11-18 20:01:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-18 20:01:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2022-11-18 20:01:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 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-18 20:01:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-11-18 20:01:11,812 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 59 [2022-11-18 20:01:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:11,813 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-11-18 20:01:11,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:01:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-11-18 20:01:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:01:11,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:11,814 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:01:11,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:12,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-18 20:01:12,021 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:01:12,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:12,021 INFO L85 PathProgramCache]: Analyzing trace with hash -755022308, now seen corresponding path program 1 times [2022-11-18 20:01:12,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:12,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242001165] [2022-11-18 20:01:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:12,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:14,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:01:15,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:15,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242001165] [2022-11-18 20:01:15,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242001165] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:15,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901607652] [2022-11-18 20:01:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:15,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:15,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:15,511 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:15,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-18 20:01:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:15,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-18 20:01:15,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:15,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:01:15,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:01:16,112 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:01:16,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:01:16,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:01:16,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:01:16,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:01:17,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:01:17,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 21 [2022-11-18 20:01:17,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:01:17,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:01:17,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:01:17,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:17,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:01:17,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:17,961 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:01:17,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 48 [2022-11-18 20:01:17,983 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 20:01:17,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-18 20:01:18,006 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:01:18,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-18 20:01:18,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:18,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:01:18,882 INFO L321 Elim1Store]: treesize reduction 88, result has 30.2 percent of original size [2022-11-18 20:01:18,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 117 treesize of output 83 [2022-11-18 20:01:18,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2022-11-18 20:01:19,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:19,203 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-18 20:01:19,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 92 [2022-11-18 20:01:19,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:19,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:19,235 INFO L321 Elim1Store]: treesize reduction 63, result has 28.4 percent of original size [2022-11-18 20:01:19,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 91 [2022-11-18 20:01:19,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:01:19,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:01:19,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:19,638 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-18 20:01:19,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 82 [2022-11-18 20:01:19,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:19,669 INFO L321 Elim1Store]: treesize reduction 43, result has 36.8 percent of original size [2022-11-18 20:01:19,669 INFO L350 Elim1Store]: Elim1 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 76 [2022-11-18 20:01:20,260 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-18 20:01:20,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 108 [2022-11-18 20:01:20,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:20,297 INFO L321 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2022-11-18 20:01:20,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 85 [2022-11-18 20:01:20,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:01:20,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:01:20,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 93 [2022-11-18 20:01:20,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-18 20:01:20,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:01:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:01:20,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:21,086 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4772 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-18 20:01:21,096 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (forall ((v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4772 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-18 20:01:21,116 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (v_ArrVal_4769 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse0 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-18 20:01:21,153 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse2 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-18 20:01:21,181 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse2 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-18 20:01:21,205 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse3 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2022-11-18 20:01:21,228 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse3 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2022-11-18 20:01:21,279 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4769))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4770) .cse3 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2022-11-18 20:01:21,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901607652] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:21,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:21,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 54 [2022-11-18 20:01:21,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291601346] [2022-11-18 20:01:21,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:21,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-18 20:01:21,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:21,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-18 20:01:21,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3241, Unknown=9, NotChecked=968, Total=4422 [2022-11-18 20:01:21,969 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 55 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 47 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:01:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:26,378 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-11-18 20:01:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:01:26,379 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 47 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 59 [2022-11-18 20:01:26,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:26,380 INFO L225 Difference]: With dead ends: 87 [2022-11-18 20:01:26,380 INFO L226 Difference]: Without dead ends: 87 [2022-11-18 20:01:26,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=445, Invalid=6219, Unknown=10, NotChecked=1336, Total=8010 [2022-11-18 20:01:26,382 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 155 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:26,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1451 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1255 Invalid, 0 Unknown, 136 Unchecked, 1.1s Time] [2022-11-18 20:01:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-18 20:01:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2022-11-18 20:01:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 states have internal predecessors, (84), 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-18 20:01:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-18 20:01:26,393 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 59 [2022-11-18 20:01:26,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:26,393 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-18 20:01:26,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 47 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:01:26,394 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-18 20:01:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-18 20:01:26,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:26,395 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:01:26,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:26,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-18 20:01:26,602 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:01:26,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:26,602 INFO L85 PathProgramCache]: Analyzing trace with hash 273036414, now seen corresponding path program 1 times [2022-11-18 20:01:26,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:26,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321452687] [2022-11-18 20:01:26,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:26,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:30,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:30,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:01:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:31,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321452687] [2022-11-18 20:01:31,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321452687] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:31,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129079374] [2022-11-18 20:01:31,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:31,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:31,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:31,592 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:31,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-18 20:01:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:32,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 154 conjunts are in the unsatisfiable core [2022-11-18 20:01:32,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:32,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:01:32,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:01:32,342 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:01:32,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 20:01:32,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:01:32,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:01:32,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:33,004 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:01:33,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-18 20:01:33,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-18 20:01:33,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:01:33,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:01:33,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:33,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:01:33,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:01:34,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:01:34,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2022-11-18 20:01:34,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:34,324 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 10 [2022-11-18 20:01:34,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:01:34,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:01:35,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:35,171 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:01:35,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 65 [2022-11-18 20:01:35,198 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 20:01:35,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-18 20:01:35,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:01:35,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:35,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:35,246 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 20:01:35,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-18 20:01:35,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:35,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:01:36,341 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-18 20:01:36,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 129 treesize of output 110 [2022-11-18 20:01:36,369 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:01:36,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 49 [2022-11-18 20:01:36,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:36,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-18 20:01:36,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:36,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:01:36,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:36,443 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:01:36,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 63 [2022-11-18 20:01:36,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 20:01:36,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:36,539 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:01:36,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 63 [2022-11-18 20:01:36,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 20:01:36,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:36,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:01:36,914 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:01:36,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 75 [2022-11-18 20:01:36,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-18 20:01:36,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:36,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-11-18 20:01:36,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:36,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 20:01:37,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 20:01:37,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:01:37,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:01:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:01:37,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:37,833 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5100 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097)) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-18 20:01:38,305 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse3 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2022-11-18 20:01:38,322 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse3 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2022-11-18 20:01:38,341 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) v_ArrVal_5097))) (select (select (store .cse4 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2022-11-18 20:01:38,358 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse4 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2022-11-18 20:01:38,398 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse4 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2022-11-18 20:01:38,537 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int)) (v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| Int) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5114 (Array Int Int)) (v_ArrVal_5113 (Array Int Int)) (v_ArrVal_5115 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5114)) (.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5115))) (let ((.cse3 (select (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store .cse6 .cse3 v_ArrVal_5089) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5095))) (let ((.cse2 (store (store .cse5 .cse3 v_ArrVal_5090) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5096)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5113) .cse3 v_ArrVal_5088) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse4 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) is different from false [2022-11-18 20:01:38,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129079374] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:38,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:38,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33] total 69 [2022-11-18 20:01:38,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016249238] [2022-11-18 20:01:38,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:38,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-18 20:01:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:38,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-18 20:01:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=4873, Unknown=104, NotChecked=1036, Total=6320 [2022-11-18 20:01:38,544 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 69 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 60 states have internal predecessors, (108), 6 states have call successors, (6), 3 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-18 20:01:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:42,987 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-11-18 20:01:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:01:42,988 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 60 states have internal predecessors, (108), 6 states have call successors, (6), 3 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 61 [2022-11-18 20:01:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:42,989 INFO L225 Difference]: With dead ends: 103 [2022-11-18 20:01:42,989 INFO L226 Difference]: Without dead ends: 103 [2022-11-18 20:01:42,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=567, Invalid=7538, Unknown=113, NotChecked=1288, Total=9506 [2022-11-18 20:01:42,992 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 441 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:42,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1383 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2045 Invalid, 0 Unknown, 115 Unchecked, 1.8s Time] [2022-11-18 20:01:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-18 20:01:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2022-11-18 20:01:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 79 states have internal predecessors, (83), 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-18 20:01:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-11-18 20:01:42,996 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 61 [2022-11-18 20:01:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:42,996 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-11-18 20:01:42,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 60 states have internal predecessors, (108), 6 states have call successors, (6), 3 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-18 20:01:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-11-18 20:01:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-18 20:01:42,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:42,997 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:01:43,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:43,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-18 20:01:43,203 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:01:43,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:43,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638346, now seen corresponding path program 1 times [2022-11-18 20:01:43,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:43,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869698309] [2022-11-18 20:01:43,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:43,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:47,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:01:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:48,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869698309] [2022-11-18 20:01:48,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869698309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:48,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237132294] [2022-11-18 20:01:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:48,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:48,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:48,965 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:48,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-18 20:01:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:49,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-18 20:01:49,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:49,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:01:49,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:01:49,697 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:01:49,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 20:01:49,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:01:50,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:50,120 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:01:50,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-18 20:01:50,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:01:50,556 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:01:50,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2022-11-18 20:01:50,873 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:01:50,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2022-11-18 20:01:50,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:50,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-18 20:01:51,390 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:01:51,390 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 28 [2022-11-18 20:01:51,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:51,399 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 10 [2022-11-18 20:01:51,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:01:52,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:52,124 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:01:52,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 63 [2022-11-18 20:01:52,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:52,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:52,169 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-18 20:01:52,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2022-11-18 20:01:52,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:52,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:01:53,413 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-18 20:01:53,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 158 treesize of output 121 [2022-11-18 20:01:53,448 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:01:53,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 48 [2022-11-18 20:01:53,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:53,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:01:53,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:53,515 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:01:53,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 75 [2022-11-18 20:01:53,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:53,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:01:53,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:53,654 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:01:53,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 75 [2022-11-18 20:01:54,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:01:54,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:54,019 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:01:54,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 78 [2022-11-18 20:01:54,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:54,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2022-11-18 20:01:54,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:01:54,786 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:01:54,786 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 48 [2022-11-18 20:01:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:01:55,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:55,213 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5420 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_5420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-18 20:01:55,221 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5420 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2022-11-18 20:01:58,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237132294] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:58,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:58,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 69 [2022-11-18 20:01:58,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153388721] [2022-11-18 20:01:58,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:58,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-18 20:01:58,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:58,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-18 20:01:58,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=5555, Unknown=63, NotChecked=302, Total=6162 [2022-11-18 20:01:58,240 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 70 states, 65 states have (on average 1.8) internal successors, (117), 61 states have internal predecessors, (117), 6 states have call successors, (6), 3 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-18 20:02:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:04,823 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-11-18 20:02:04,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 20:02:04,826 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 65 states have (on average 1.8) internal successors, (117), 61 states have internal predecessors, (117), 6 states have call successors, (6), 3 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 65 [2022-11-18 20:02:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:04,826 INFO L225 Difference]: With dead ends: 88 [2022-11-18 20:02:04,827 INFO L226 Difference]: Without dead ends: 88 [2022-11-18 20:02:04,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2282 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=539, Invalid=9293, Unknown=76, NotChecked=394, Total=10302 [2022-11-18 20:02:04,828 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 108 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:04,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1258 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1880 Invalid, 0 Unknown, 151 Unchecked, 1.7s Time] [2022-11-18 20:02:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-18 20:02:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-18 20:02:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 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-18 20:02:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-11-18 20:02:04,833 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 65 [2022-11-18 20:02:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:04,833 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-11-18 20:02:04,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 65 states have (on average 1.8) internal successors, (117), 61 states have internal predecessors, (117), 6 states have call successors, (6), 3 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-18 20:02:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-11-18 20:02:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-18 20:02:04,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:04,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:04,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-18 20:02:05,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:05,042 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:02:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638347, now seen corresponding path program 1 times [2022-11-18 20:02:05,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:05,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728841311] [2022-11-18 20:02:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:05,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:12,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:02:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:12,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:02:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:02:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:13,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728841311] [2022-11-18 20:02:13,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728841311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:13,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86178283] [2022-11-18 20:02:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:13,317 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:13,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-18 20:02:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:13,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 166 conjunts are in the unsatisfiable core [2022-11-18 20:02:13,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:13,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:02:14,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:02:14,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:02:14,742 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:02:14,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-18 20:02:14,772 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:02:14,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 20:02:15,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:02:15,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:02:15,316 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:02:15,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-18 20:02:15,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 20:02:15,725 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:02:15,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-11-18 20:02:15,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:15,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:02:15,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:15,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:02:15,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:15,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2022-11-18 20:02:16,490 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:02:16,490 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 46 [2022-11-18 20:02:16,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:02:16,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:16,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 10 [2022-11-18 20:02:16,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:02:17,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:17,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-11-18 20:02:17,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:17,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:17,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:17,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-18 20:02:17,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:17,344 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:02:17,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 89 [2022-11-18 20:02:17,383 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 20:02:17,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 20:02:18,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:18,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:02:18,702 INFO L321 Elim1Store]: treesize reduction 134, result has 18.8 percent of original size [2022-11-18 20:02:18,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 172 treesize of output 97 [2022-11-18 20:02:18,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:18,737 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-18 20:02:18,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 92 [2022-11-18 20:02:19,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:19,047 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-18 20:02:19,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 114 [2022-11-18 20:02:19,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:19,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:19,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2022-11-18 20:02:19,239 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-18 20:02:19,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 133 [2022-11-18 20:02:19,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:19,274 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-18 20:02:19,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 150 [2022-11-18 20:02:19,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:19,849 INFO L321 Elim1Store]: treesize reduction 87, result has 7.4 percent of original size [2022-11-18 20:02:19,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 228 treesize of output 107 [2022-11-18 20:02:19,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:19,882 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-18 20:02:19,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-11-18 20:02:20,712 INFO L321 Elim1Store]: treesize reduction 57, result has 5.0 percent of original size [2022-11-18 20:02:20,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 63 [2022-11-18 20:02:21,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:21,068 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 20:02:21,068 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-18 20:02:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:21,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:02:36,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86178283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:36,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:02:36,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36] total 74 [2022-11-18 20:02:36,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703373190] [2022-11-18 20:02:36,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:02:36,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-18 20:02:36,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:36,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-18 20:02:36,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=7395, Unknown=107, NotChecked=0, Total=7832 [2022-11-18 20:02:36,187 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 75 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 66 states have internal predecessors, (116), 6 states have call successors, (6), 4 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-18 20:02:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:43,722 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-11-18 20:02:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-18 20:02:43,723 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 66 states have internal predecessors, (116), 6 states have call successors, (6), 4 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 65 [2022-11-18 20:02:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:43,724 INFO L225 Difference]: With dead ends: 121 [2022-11-18 20:02:43,724 INFO L226 Difference]: Without dead ends: 121 [2022-11-18 20:02:43,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3136 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=611, Invalid=11491, Unknown=108, NotChecked=0, Total=12210 [2022-11-18 20:02:43,726 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 164 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:43,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1233 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1619 Invalid, 0 Unknown, 269 Unchecked, 1.7s Time] [2022-11-18 20:02:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-18 20:02:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 90. [2022-11-18 20:02:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 85 states have internal predecessors, (91), 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-18 20:02:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-11-18 20:02:43,730 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 65 [2022-11-18 20:02:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:43,730 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-11-18 20:02:43,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 66 states have internal predecessors, (116), 6 states have call successors, (6), 4 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-18 20:02:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-11-18 20:02:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-18 20:02:43,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:43,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:43,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-18 20:02:43,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-18 20:02:43,939 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:02:43,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:43,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1082819804, now seen corresponding path program 1 times [2022-11-18 20:02:43,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:43,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539346167] [2022-11-18 20:02:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:43,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:46,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:46,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:02:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:47,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:02:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:02:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:47,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539346167] [2022-11-18 20:02:47,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539346167] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:47,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151363282] [2022-11-18 20:02:47,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:47,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:47,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:47,535 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:47,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-18 20:02:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:47,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 136 conjunts are in the unsatisfiable core [2022-11-18 20:02:47,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:48,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:02:48,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:02:48,268 WARN L837 $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_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2022-11-18 20:02:48,270 WARN L859 $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_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2022-11-18 20:02:48,289 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2022-11-18 20:02:48,291 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2022-11-18 20:02:48,345 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2022-11-18 20:02:48,348 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| |c_old(#valid)|)) is different from true [2022-11-18 20:02:48,380 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-18 20:02:48,383 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-18 20:02:48,535 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0)) is different from false [2022-11-18 20:02:48,537 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0)) is different from true [2022-11-18 20:02:48,634 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1))))))) is different from false [2022-11-18 20:02:48,639 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1))))))) is different from true [2022-11-18 20:02:48,699 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1))))) is different from false [2022-11-18 20:02:48,703 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1))))) is different from true [2022-11-18 20:02:48,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:02:48,769 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-18 20:02:48,773 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from true [2022-11-18 20:02:48,867 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:02:48,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-18 20:02:48,912 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1))) is different from false [2022-11-18 20:02:48,915 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1))) is different from true [2022-11-18 20:02:48,979 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|))) is different from false [2022-11-18 20:02:48,983 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-18 20:02:49,078 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:02:49,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2022-11-18 20:02:49,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:49,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-18 20:02:49,176 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= .cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from false [2022-11-18 20:02:49,180 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= .cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from true [2022-11-18 20:02:49,239 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse3 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (= (select .cse3 0) .cse0)))) is different from false [2022-11-18 20:02:49,244 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse3 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (= (select .cse3 0) .cse0)))) is different from true [2022-11-18 20:02:49,328 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (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 |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse3 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= .cse2 (select .cse3 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse0 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse0) 0))))))) is different from false [2022-11-18 20:02:49,332 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (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 |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse3 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= .cse2 (select .cse3 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse0 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse0) 0))))))) is different from true [2022-11-18 20:02:49,370 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:02:49,371 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 25 [2022-11-18 20:02:49,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:02:49,415 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2022-11-18 20:02:49,419 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2022-11-18 20:02:49,491 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2022-11-18 20:02:49,495 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2022-11-18 20:02:49,632 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2022-11-18 20:02:49,637 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2022-11-18 20:02:49,706 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2022-11-18 20:02:49,711 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2022-11-18 20:02:49,772 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2022-11-18 20:02:49,776 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2022-11-18 20:02:49,838 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2022-11-18 20:02:49,842 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2022-11-18 20:02:49,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:49,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:02:49,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:49,999 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:02:50,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 80 [2022-11-18 20:02:50,183 WARN L837 $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 ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse2 (select .cse5 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0))) (= .cse2 (select .cse5 0)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from false [2022-11-18 20:02:50,188 WARN L859 $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 ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse2 (select .cse5 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0))) (= .cse2 (select .cse5 0)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from true [2022-11-18 20:02:50,389 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-18 20:02:50,395 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-18 20:02:50,911 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-18 20:02:50,916 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-18 20:02:51,204 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-18 20:02:51,210 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-18 20:02:51,459 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))))))) is different from false [2022-11-18 20:02:51,465 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))))))) is different from true [2022-11-18 20:02:51,582 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-18 20:02:51,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 134 treesize of output 113 [2022-11-18 20:02:51,612 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:02:51,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2022-11-18 20:02:51,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-18 20:02:51,858 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_60))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))))))) is different from false [2022-11-18 20:02:51,865 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_60))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))))))) is different from true [2022-11-18 20:02:51,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:51,944 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:02:51,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 93 [2022-11-18 20:02:51,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:51,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-18 20:02:52,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:52,403 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:02:52,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 93 [2022-11-18 20:02:52,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:52,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-18 20:02:52,688 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-11-18 20:02:52,695 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2022-11-18 20:02:53,196 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-11-18 20:02:53,202 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2022-11-18 20:02:53,338 INFO L321 Elim1Store]: treesize reduction 103, result has 12.7 percent of original size [2022-11-18 20:02:53,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 89 [2022-11-18 20:02:53,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:53,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-18 20:02:53,550 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (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 .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from false [2022-11-18 20:02:53,556 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (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 .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from true [2022-11-18 20:02:54,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-18 20:02:54,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (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 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from false [2022-11-18 20:02:54,239 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (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 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from true [2022-11-18 20:02:54,524 WARN L837 $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 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-18 20:02:54,530 WARN L859 $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 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-18 20:02:55,276 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 .cse7)) (.cse4 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse3 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse1 (select |v_#valid_BEFORE_CALL_47| .cse1)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse4)))))) is different from false [2022-11-18 20:02:55,282 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 .cse7)) (.cse4 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse3 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse1 (select |v_#valid_BEFORE_CALL_47| .cse1)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse4)))))) is different from true [2022-11-18 20:02:55,551 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (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 |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from false [2022-11-18 20:02:55,557 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (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 |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from true [2022-11-18 20:02:55,631 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-11-18 20:02:55,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 64 [2022-11-18 20:02:55,893 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|)))) is different from false [2022-11-18 20:02:55,915 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|)))) is different from true [2022-11-18 20:02:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-11-18 20:02:55,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:02:55,947 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int)) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) v_ArrVal_6059)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-18 20:02:55,955 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-18 20:02:55,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse0 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2022-11-18 20:02:55,996 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse0 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2022-11-18 20:02:56,014 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2022-11-18 20:02:56,025 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-18 20:02:56,040 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-18 20:02:56,066 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-18 20:02:56,163 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| Int) (v_ArrVal_6070 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6071 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39|) 0)) (not (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6071)) (.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6070))) (let ((.cse6 (select (select .cse7 (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store .cse7 .cse6 v_ArrVal_6053) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store .cse5 .cse6 v_ArrVal_6054) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| |c_#StackHeapBarrier|)))) is different from false [2022-11-18 20:02:56,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151363282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:56,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:02:56,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 75 [2022-11-18 20:02:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575695773] [2022-11-18 20:02:56,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:02:56,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-18 20:02:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:56,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-18 20:02:56,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1617, Unknown=75, NotChecked=5082, Total=6972 [2022-11-18 20:02:56,169 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 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-18 20:02:56,695 WARN L837 $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) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2022-11-18 20:02:56,697 WARN L859 $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) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2022-11-18 20:02:56,701 WARN L837 $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_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2022-11-18 20:02:56,704 WARN L859 $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_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2022-11-18 20:02:56,709 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |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-18 20:02:56,712 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |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-18 20:02:56,717 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |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| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |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)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-18 20:02:56,721 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |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| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |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)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-18 20:02:56,728 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse3 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse3)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.base|))) is different from false [2022-11-18 20:02:56,732 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse3 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse3)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:02:56,741 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse1 |c_node_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse2 |c_node_create_#res#1.base|)))) is different from false [2022-11-18 20:02:56,748 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse1 |c_node_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse2 |c_node_create_#res#1.base|)))) is different from true [2022-11-18 20:02:56,760 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-18 20:02:56,764 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-18 20:02:56,779 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-18 20:02:56,784 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-18 20:02:56,798 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-11-18 20:02:56,802 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2022-11-18 20:02:56,825 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-11-18 20:02:56,831 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2022-11-18 20:02:56,842 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse3 0)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-18 20:02:56,847 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse3 0)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-18 20:02:56,861 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from false [2022-11-18 20:02:56,865 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from true [2022-11-18 20:02:56,877 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse4 4)) (.cse3 (select .cse4 0))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse3 .cse0) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from false [2022-11-18 20:02:56,882 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse4 4)) (.cse3 (select .cse4 0))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse3 .cse0) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from true [2022-11-18 20:02:56,896 WARN L837 $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 ((.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse5 0)) (.cse2 (select .cse5 4))) (and (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse1 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (= (select |c_#valid| .cse1) 1) (= .cse2 .cse0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse1 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0))))))) is different from false [2022-11-18 20:02:56,900 WARN L859 $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 ((.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse5 0)) (.cse2 (select .cse5 4))) (and (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse1 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (= (select |c_#valid| .cse1) 1) (= .cse2 .cse0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse1 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0))))))) is different from true [2022-11-18 20:02:56,918 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2022-11-18 20:02:56,922 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2022-11-18 20:02:56,934 WARN L837 $PredicateComparison]: unable to prove that (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| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2022-11-18 20:02:56,939 WARN L859 $PredicateComparison]: unable to prove that (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| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2022-11-18 20:02:56,958 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from false [2022-11-18 20:02:56,962 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:02:56,979 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from false [2022-11-18 20:02:56,984 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:02:56,998 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from false [2022-11-18 20:02:57,002 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:02:57,103 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))))) is different from false [2022-11-18 20:02:57,110 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))))) is different from true [2022-11-18 20:02:57,156 WARN L837 $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 ((.cse7 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse4 (select .cse7 4)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse3 (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse6 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse6) 0))) (= .cse4 (select .cse7 0)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse9 (select .cse11 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse8)) .cse1 .cse3 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= .cse8 .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (not (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse11 0)))))) (= .cse8 0)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse13 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse12 (select |v_#valid_BEFORE_CALL_47| .cse12)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse13 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse13 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse14 (select |v_#valid_BEFORE_CALL_43| .cse14)))) (<= .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from false [2022-11-18 20:02:57,161 WARN L859 $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 ((.cse7 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse4 (select .cse7 4)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse3 (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse6 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse6) 0))) (= .cse4 (select .cse7 0)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse9 (select .cse11 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse8)) .cse1 .cse3 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= .cse8 .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (not (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse11 0)))))) (= .cse8 0)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse13 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse12 (select |v_#valid_BEFORE_CALL_47| .cse12)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse13 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse13 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse14 (select |v_#valid_BEFORE_CALL_43| .cse14)))) (<= .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from true [2022-11-18 20:02:57,217 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse14))) (let ((.cse0 (+ 2 .cse14)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select .cse12 4)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4))) (and .cse1 .cse2 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse4)) (not (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse6 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) (= .cse3 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (+ 2 v_arrayElimIndex_60))) (and (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_47| .cse8)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse1 .cse2 (= .cse11 (select .cse12 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse13 (select |v_#valid_BEFORE_CALL_44| .cse13))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse14 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse14) 0))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-18 20:02:57,223 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse14))) (let ((.cse0 (+ 2 .cse14)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select .cse12 4)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4))) (and .cse1 .cse2 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse4)) (not (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse6 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) (= .cse3 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (+ 2 v_arrayElimIndex_60))) (and (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_47| .cse8)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse1 .cse2 (= .cse11 (select .cse12 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse13 (select |v_#valid_BEFORE_CALL_44| .cse13))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse14 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse14) 0))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-18 20:02:57,289 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse0 (+ 2 .cse10)) (.cse7 (select .cse8 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse5 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse5 .cse6 (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| 0) (= .cse7 (select .cse8 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse10 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse10) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 0) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse11))) (let ((.cse12 (select .cse14 4))) (and .cse5 .cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse11)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse11)) (not (= .cse11 .cse12)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse12)) (not (= (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse14 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))))))))) is different from false [2022-11-18 20:02:57,295 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse0 (+ 2 .cse10)) (.cse7 (select .cse8 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse5 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse5 .cse6 (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| 0) (= .cse7 (select .cse8 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse10 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse10) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 0) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse11))) (let ((.cse12 (select .cse14 4))) (and .cse5 .cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse11)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse11)) (not (= .cse11 .cse12)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse12)) (not (= (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse14 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))))))))) is different from true [2022-11-18 20:02:57,354 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse13 (select .cse1 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (not (= .cse10 .cse13)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse13)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))))) is different from false [2022-11-18 20:02:57,359 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse13 (select .cse1 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (not (= .cse10 .cse13)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse13)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))))) is different from true [2022-11-18 20:02:57,416 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse13)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse0 (+ 2 .cse13)) (.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select .cse9 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse10 (select .cse11 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse9 .cse1))) (= .cse10 (select .cse11 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse12 (select |v_#valid_BEFORE_CALL_44| .cse12))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse10) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse13 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse13) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| .cse1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2022-11-18 20:02:57,422 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse13)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse0 (+ 2 .cse13)) (.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select .cse9 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse10 (select .cse11 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse9 .cse1))) (= .cse10 (select .cse11 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse12 (select |v_#valid_BEFORE_CALL_44| .cse12))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse10) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse13 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse13) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| .cse1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2022-11-18 20:02:57,491 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse12)) (.cse8 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse8)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse9 (select .cse10 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select .cse1 (+ .cse2 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse8)) (= .cse9 (select .cse10 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2022-11-18 20:02:57,497 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse12)) (.cse8 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse8)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse9 (select .cse10 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select .cse1 (+ .cse2 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse8)) (= .cse9 (select .cse10 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2022-11-18 20:02:57,582 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select .cse1 (+ .cse2 4))) (not (= .cse10 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2022-11-18 20:02:57,589 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select .cse1 (+ .cse2 4))) (not (= .cse10 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2022-11-18 20:02:57,676 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2022-11-18 20:02:57,683 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2022-11-18 20:02:57,761 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2022-11-18 20:02:57,767 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2022-11-18 20:02:57,810 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse4 (select .cse5 4)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse8 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2022-11-18 20:02:57,817 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse4 (select .cse5 4)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse8 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2022-11-18 20:02:57,891 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (not (= .cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse1))) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-11-18 20:02:57,898 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (not (= .cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse1))) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2022-11-18 20:02:57,981 WARN L837 $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 ((.cse3 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 .cse4)) (.cse2 (select .cse3 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 0) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select .cse3 .cse1) .cse4)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse8 (select |v_#valid_BEFORE_CALL_44| .cse8))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from false [2022-11-18 20:02:57,987 WARN L859 $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 ((.cse3 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 .cse4)) (.cse2 (select .cse3 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 0) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select .cse3 .cse1) .cse4)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse8 (select |v_#valid_BEFORE_CALL_44| .cse8))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from true [2022-11-18 20:02:58,043 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (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 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base|) |c_ULTIMATE.start_main_#t~mem16#1.offset|) .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from false [2022-11-18 20:02:58,048 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (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 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base|) |c_ULTIMATE.start_main_#t~mem16#1.offset|) .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from true [2022-11-18 20:02:58,078 WARN L837 $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 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-18 20:02:58,084 WARN L859 $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 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-18 20:02:58,155 WARN L837 $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 ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ 2 .cse1)) (.cse5 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse5)))))) is different from false [2022-11-18 20:02:58,161 WARN L859 $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 ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ 2 .cse1)) (.cse5 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse5)))))) is different from true [2022-11-18 20:02:58,231 WARN L837 $PredicateComparison]: unable to prove that (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 |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (+ 2 .cse3)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from false [2022-11-18 20:02:58,237 WARN L859 $PredicateComparison]: unable to prove that (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 |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (+ 2 .cse3)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from true [2022-11-18 20:02:58,312 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|))))) is different from false [2022-11-18 20:02:58,317 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|))))) is different from true [2022-11-18 20:02:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:58,512 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-11-18 20:02:58,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-18 20:02:58,512 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 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 66 [2022-11-18 20:02:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:58,513 INFO L225 Difference]: With dead ends: 106 [2022-11-18 20:02:58,513 INFO L226 Difference]: Without dead ends: 106 [2022-11-18 20:02:58,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 79 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=297, Invalid=1850, Unknown=149, NotChecked=12956, Total=15252 [2022-11-18 20:02:58,516 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1603 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:58,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 939 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 524 Invalid, 0 Unknown, 1603 Unchecked, 0.4s Time] [2022-11-18 20:02:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-18 20:02:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-18 20:02:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.223529411764706) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:02:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2022-11-18 20:02:58,520 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 66 [2022-11-18 20:02:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:58,520 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2022-11-18 20:02:58,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 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-18 20:02:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-11-18 20:02:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-18 20:02:58,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:58,521 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:58,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-18 20:02:58,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-18 20:02:58,728 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:02:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash 792357101, now seen corresponding path program 1 times [2022-11-18 20:02:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:58,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493587927] [2022-11-18 20:02:58,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:04,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:03:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:03:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:03:07,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:07,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493587927] [2022-11-18 20:03:07,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493587927] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:07,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381423908] [2022-11-18 20:03:07,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:07,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:07,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:07,021 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:07,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-18 20:03:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:07,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 200 conjunts are in the unsatisfiable core [2022-11-18 20:03:07,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:07,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:03:07,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:03:08,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:03:08,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:03:09,121 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:03:09,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 20:03:09,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:03:09,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:03:09,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:03:09,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:03:09,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:03:09,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-18 20:03:09,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:03:10,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:03:10,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-18 20:03:10,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:03:10,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:10,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:03:10,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:10,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2022-11-18 20:03:10,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 20:03:11,119 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:03:11,120 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 48 [2022-11-18 20:03:11,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:11,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 10 [2022-11-18 20:03:11,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:03:11,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:03:12,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:12,169 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:03:12,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 91 [2022-11-18 20:03:12,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:12,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:12,197 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 20:03:12,197 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 36 treesize of output 43 [2022-11-18 20:03:12,238 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-18 20:03:12,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-18 20:03:12,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:03:12,278 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 20:03:12,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 20:03:13,901 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-18 20:03:13,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 208 treesize of output 161 [2022-11-18 20:03:13,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:13,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:03:13,969 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-18 20:03:13,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 91 [2022-11-18 20:03:13,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:03:13,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:13,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2022-11-18 20:03:14,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:14,246 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:03:14,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 89 [2022-11-18 20:03:14,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:14,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:14,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-18 20:03:14,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-18 20:03:14,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:14,385 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:03:14,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 89 [2022-11-18 20:03:14,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-18 20:03:14,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:14,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:14,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-18 20:03:14,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:14,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:03:14,921 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:03:14,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 99 [2022-11-18 20:03:14,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-18 20:03:14,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:14,954 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-18 20:03:14,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 65 [2022-11-18 20:03:16,206 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-18 20:03:16,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 52 [2022-11-18 20:03:16,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:16,217 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 20:03:16,217 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 19 [2022-11-18 20:03:16,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:03:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:03:16,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:03:18,767 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (+ 4 (select (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse3 (store .cse8 .cse1 (store (select .cse8 .cse1) .cse7 v_ArrVal_6397)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse5 (store .cse6 .cse1 (store (select .cse6 .cse1) .cse7 v_ArrVal_6399)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse5 .cse4) .cse0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse1 v_ArrVal_6400) .cse2) (+ 8 (select (select .cse3 .cse4) .cse0)))) (= .cse2 .cse4)))))))))))) (forall ((v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse11 (select (select .cse15 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse16 (+ 4 (select (select .cse17 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse14 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse16 v_ArrVal_6397)))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse12 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse16 v_ArrVal_6399)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select (select .cse14 .cse13) .cse9))) (or (= .cse9 .cse10) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse11 v_ArrVal_6400) (select (select .cse12 .cse13) .cse9)) (+ 8 .cse10)))))))) (not (<= 0 .cse9))))))))) is different from false [2022-11-18 20:03:18,903 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (+ (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse6 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse8 v_ArrVal_6397)))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse2 (store .cse7 .cse1 (store (select .cse7 .cse1) .cse8 v_ArrVal_6399)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse6 .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse1 v_ArrVal_6400) (select (select .cse2 .cse3) .cse4)) (+ .cse5 8))) (= .cse5 .cse4)))))) (not (<= 0 .cse4)))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse12 (select (select .cse16 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse17 (+ (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse13 (store .cse18 .cse12 (store (select .cse18 .cse12) .cse17 v_ArrVal_6397)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse15 (store .cse16 .cse12 (store (select .cse16 .cse12) .cse17 v_ArrVal_6399)))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select (select .cse15 .cse10) .cse14))) (or (= .cse10 .cse11) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse12 v_ArrVal_6400) .cse11) (+ (select (select .cse13 .cse10) .cse14) 8)))))))) (not (<= 0 .cse14)))))))))) is different from false [2022-11-18 20:03:18,967 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse2 (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (+ (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse4 (store .cse9 .cse2 (store (select .cse9 .cse2) .cse8 v_ArrVal_6397)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse6 (store .cse7 .cse2 (store (select .cse7 .cse2) .cse8 v_ArrVal_6399)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse6 .cse5) .cse0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse2 v_ArrVal_6400) .cse3) (+ 8 (select (select .cse4 .cse5) .cse0)))) (= .cse3 .cse5)))))))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse17 (+ (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse15 (store .cse18 .cse11 (store (select .cse18 .cse11) .cse17 v_ArrVal_6397)))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse12 (store .cse16 .cse11 (store (select .cse16 .cse11) .cse17 v_ArrVal_6399)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (select (select .cse15 .cse13) .cse10))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse11 v_ArrVal_6400) (select (select .cse12 .cse13) .cse10)) (+ 8 .cse14))) (= .cse10 .cse14)))))))))))))) is different from false [2022-11-18 20:03:19,044 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) .cse21))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) .cse21))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse9 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse5 (store .cse11 .cse3 (store (select .cse11 .cse3) .cse10 v_ArrVal_6397)))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse10 v_ArrVal_6399)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse8 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse3 v_ArrVal_6400) .cse4) (+ (select (select .cse5 .cse6) .cse7) 8))) (= .cse6 .cse4)))))) (not (<= 0 .cse7)))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse18 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse14 (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse19 (+ (select (select .cse20 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse17 (store .cse20 .cse14 (store (select .cse20 .cse14) .cse19 v_ArrVal_6397)))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse15 (store .cse18 .cse14 (store (select .cse18 .cse14) .cse19 v_ArrVal_6399)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (select (select .cse17 .cse16) .cse12))) (or (= .cse12 .cse13) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse14 v_ArrVal_6400) (select (select .cse15 .cse16) .cse12)) (+ .cse13 8)))))))) (not (<= 0 .cse12)))))))))))) is different from false [2022-11-18 20:03:19,115 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse22 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse21) .cse22))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| .cse21) .cse22))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse9 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse5 (store .cse11 .cse3 (store (select .cse11 .cse3) .cse10 v_ArrVal_6397)))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse10 v_ArrVal_6399)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse8 .cse6) .cse7))) (or (= (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse3 v_ArrVal_6400) .cse4) (+ 8 (select (select .cse5 .cse6) .cse7))) |c_ULTIMATE.start_main_~data~0#1|) (= .cse4 .cse6)))))) (not (<= 0 .cse7)))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse18 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse12 (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse19 (+ (select (select .cse20 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse17 (store .cse20 .cse12 (store (select .cse20 .cse12) .cse19 v_ArrVal_6397)))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse13 (store .cse18 .cse12 (store (select .cse18 .cse12) .cse19 v_ArrVal_6399)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select (select .cse17 .cse14) .cse15))) (or (= (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse12 v_ArrVal_6400) (select (select .cse13 .cse14) .cse15)) (+ 8 .cse16)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse15 .cse16)))))) (not (<= 0 .cse15)))))))))))) is different from false [2022-11-18 20:03:19,275 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse22 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse21) .cse22))) (let ((.cse3 (select |c_#memory_int| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| .cse21) .cse22))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6395)) (.cse9 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6394))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (store .cse11 .cse5 (store (select .cse11 .cse5) .cse10 v_ArrVal_6397)))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse6 (store .cse9 .cse5 (store (select .cse9 .cse5) .cse10 v_ArrVal_6399)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse8 .cse7) .cse0))) (or (= .cse1 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse2 (store .cse3 .cse4 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6393) .cse5 v_ArrVal_6400) (select (select .cse6 .cse7) .cse0)) (+ .cse1 8)))))))))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6395)) (.cse18 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6394))) (let ((.cse14 (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse19 (+ (select (select .cse20 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse15 (store .cse20 .cse14 (store (select .cse20 .cse14) .cse19 v_ArrVal_6397)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse17 (store .cse18 .cse14 (store (select .cse18 .cse14) .cse19 v_ArrVal_6399)))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select (select .cse17 .cse13) .cse16))) (or (= .cse12 .cse13) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse2 (store .cse3 .cse4 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6393) .cse14 v_ArrVal_6400) .cse12) (+ (select (select .cse15 .cse13) .cse16) 8)))))))) (not (<= 0 .cse16)))))))))))) is different from false [2022-11-18 20:03:21,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381423908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:21,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:03:21,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 39] total 81 [2022-11-18 20:03:21,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523454366] [2022-11-18 20:03:21,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:03:21,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-18 20:03:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:21,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-18 20:03:21,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=7670, Unknown=17, NotChecked=1086, Total=9120 [2022-11-18 20:03:21,084 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 81 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 4 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-18 20:03:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:33,235 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-11-18 20:03:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-18 20:03:33,236 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 4 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 67 [2022-11-18 20:03:33,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:33,237 INFO L225 Difference]: With dead ends: 107 [2022-11-18 20:03:33,237 INFO L226 Difference]: Without dead ends: 107 [2022-11-18 20:03:33,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 124 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=713, Invalid=13573, Unknown=18, NotChecked=1446, Total=15750 [2022-11-18 20:03:33,239 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 253 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:33,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1725 Invalid, 2724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2440 Invalid, 0 Unknown, 235 Unchecked, 2.8s Time] [2022-11-18 20:03:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-18 20:03:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2022-11-18 20:03:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 99 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:03:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2022-11-18 20:03:33,243 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 67 [2022-11-18 20:03:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:33,243 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2022-11-18 20:03:33,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 4 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-18 20:03:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2022-11-18 20:03:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-18 20:03:33,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:33,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:03:33,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:33,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:33,451 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-18 20:03:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash -925225159, now seen corresponding path program 2 times [2022-11-18 20:03:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:33,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485210818] [2022-11-18 20:03:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:03:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:42,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:03:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:03:43,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:43,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485210818] [2022-11-18 20:03:43,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485210818] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:43,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108595701] [2022-11-18 20:03:43,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:03:43,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:43,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:43,599 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:43,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac7d61eb-e2f4-485d-a0a5-6cce7e0da462/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-18 20:03:44,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:03:44,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:03:44,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 215 conjunts are in the unsatisfiable core [2022-11-18 20:03:44,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:44,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:03:44,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:03:44,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:03:44,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:03:44,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:44,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:03:44,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:44,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:03:45,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:45,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:03:45,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:45,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:03:45,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:45,548 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-18 20:03:45,549 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 33 [2022-11-18 20:03:45,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:45,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-18 20:03:45,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:03:46,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:03:46,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-18 20:03:46,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:46,835 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:03:46,836 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 47 [2022-11-18 20:03:47,560 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-18 20:03:47,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 39 [2022-11-18 20:03:47,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:47,571 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 10 [2022-11-18 20:03:47,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:47,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:03:47,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:03:48,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:48,835 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-18 20:03:48,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 81 [2022-11-18 20:03:48,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:48,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:48,862 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-18 20:03:48,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 42 [2022-11-18 20:03:48,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:48,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:48,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:48,931 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-18 20:03:48,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2022-11-18 20:03:48,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:48,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:03:50,816 INFO L321 Elim1Store]: treesize reduction 88, result has 40.9 percent of original size [2022-11-18 20:03:50,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 151 treesize of output 125 [2022-11-18 20:03:50,863 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-18 20:03:50,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 41 [2022-11-18 20:03:52,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:52,733 INFO L321 Elim1Store]: treesize reduction 132, result has 53.4 percent of original size [2022-11-18 20:03:52,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 27 case distinctions, treesize of input 609 treesize of output 565 [2022-11-18 20:03:52,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:52,968 INFO L321 Elim1Store]: treesize reduction 102, result has 50.2 percent of original size [2022-11-18 20:03:52,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 434 treesize of output 498 [2022-11-18 20:04:08,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-18 20:04:08,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-18 20:04:12,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-18 20:04:17,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-18 20:04:18,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-18 20:04:18,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-18 20:04:19,065 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:04:28,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-18 20:04:29,921 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:04:32,209 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:04:37,341 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:04:38,079 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-18 20:04:38,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 26 [2022-11-18 20:04:48,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 441 treesize of output 421 [2022-11-18 20:04:48,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1213 treesize of output 1043 [2022-11-18 20:04:49,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 616 treesize of output 580 [2022-11-18 20:04:49,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2022-11-18 20:04:50,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2022-11-18 20:04:50,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 607 treesize of output 561 [2022-11-18 20:04:50,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-18 20:04:50,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 182 [2022-11-18 20:04:50,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-18 20:04:50,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-11-18 20:05:04,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:05,351 INFO L321 Elim1Store]: treesize reduction 495, result has 23.7 percent of original size [2022-11-18 20:05:05,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 15 new quantified variables, introduced 63 case distinctions, treesize of input 1525 treesize of output 1162 [2022-11-18 20:05:05,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:05,709 INFO L321 Elim1Store]: treesize reduction 306, result has 28.3 percent of original size [2022-11-18 20:05:05,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 1106 treesize of output 998 [2022-11-18 20:05:26,323 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:05:26,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:27,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:27,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:27,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:28,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:31,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:31,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:05:31,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:32,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:32,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:05:32,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:34,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:34,807 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:05:35,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:38,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:39,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:05:40,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:05:41,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:05:46,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:46,796 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:05:50,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:05:56,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:05:58,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:05:58,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:05:59,164 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:05:59,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:06:00,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:06:17,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:17,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2022-11-18 20:06:17,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:17,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2022-11-18 20:06:17,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:17,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2022-11-18 20:06:18,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:18,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2022-11-18 20:06:18,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:06:18,685 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:06:19,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:06:19,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:06:19,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:06:20,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:06:20,334 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:06:22,894 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:06:23,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:23,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2022-11-18 20:06:23,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:23,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2022-11-18 20:06:23,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:23,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2022-11-18 20:06:23,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:06:24,246 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:06:24,370 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:06:24,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:24,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2022-11-18 20:06:25,020 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:06:25,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 20:06:25,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:25,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2022-11-18 20:09:07,900 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:09:08,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:09,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:09,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:10,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:10,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:10,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:10,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:10,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:10,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:10,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:10,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:10,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:11,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:11,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:11,421 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:09:12,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:12,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:12,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:12,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:12,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:14,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:14,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:14,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:16,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:16,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:18,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:33,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:34,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:34,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:35,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:35,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3559 treesize of output 3523 [2022-11-18 20:09:43,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:45,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:45,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:46,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:46,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:46,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:49,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:50,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:51,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:51,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:51,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:52,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:52,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:09:53,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:55,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:57,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:09:59,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:10:00,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:12:10,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:10,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-11-18 20:12:10,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:12:11,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:12:11,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:12:11,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:12:18,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:12:22,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:12:22,895 INFO L321 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2022-11-18 20:12:22,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1067 treesize of output 1056 [2022-11-18 20:12:23,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:12:23,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:12:23,924 INFO L321 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2022-11-18 20:12:23,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 565 treesize of output 554 [2022-11-18 20:12:52,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:12:58,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:12:58,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:13:12,478 INFO L321 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2022-11-18 20:13:12,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2446 treesize of output 2438 [2022-11-18 20:14:08,675 WARN L207 Elim1Store]: Array PQE input equivalent to false