./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.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_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/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_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/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_0dedfd83-c431-4802-ae51-17670ba2bcb2/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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- 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:01:00,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:01:00,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:01:00,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:01:00,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:01:00,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:01:00,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:01:00,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:01:00,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:01:00,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:01:00,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:01:00,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:01:00,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:01:00,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:01:00,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:01:00,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:01:00,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:01:00,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:01:00,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:01:00,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:01:00,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:01:00,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:01:00,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:01:00,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:01:00,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:01:00,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:01:00,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:01:00,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:01:00,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:01:00,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:01:00,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:01:00,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:01:00,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:01:00,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:01:00,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:01:00,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:01:00,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:01:00,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:01:00,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:01:00,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:01:00,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:01:00,630 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:01:00,657 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:01:00,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:01:00,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:01:00,659 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:01:00,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:01:00,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:01:00,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:01:00,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:01:00,660 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:01:00,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:01:00,661 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:01:00,661 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:01:00,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:01:00,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:01:00,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:01:00,662 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:01:00,662 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:01:00,662 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:01:00,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:01:00,663 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:01:00,663 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:01:00,680 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:01:00,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:01:00,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:01:00,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:01:00,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:01:00,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:01:00,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:01:00,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:01:00,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:01:00,684 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_0dedfd83-c431-4802-ae51-17670ba2bcb2/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_0dedfd83-c431-4802-ae51-17670ba2bcb2/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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2022-11-18 20:01:00,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:01:00,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:01:01,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:01:01,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:01:01,006 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:01:01,008 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-11-18 20:01:01,079 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/data/a00b556b1/d5da10241d904941a11eb09f62e9f451/FLAG90df45d0e [2022-11-18 20:01:01,655 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:01:01,656 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-11-18 20:01:01,668 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/data/a00b556b1/d5da10241d904941a11eb09f62e9f451/FLAG90df45d0e [2022-11-18 20:01:01,930 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/data/a00b556b1/d5da10241d904941a11eb09f62e9f451 [2022-11-18 20:01:01,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:01:01,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:01:01,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:01:01,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:01:01,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:01:01,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:01:01" (1/1) ... [2022-11-18 20:01:01,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa4e7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:01, skipping insertion in model container [2022-11-18 20:01:01,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:01:01" (1/1) ... [2022-11-18 20:01:01,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:01:02,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:01:02,353 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_0dedfd83-c431-4802-ae51-17670ba2bcb2/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2022-11-18 20:01:02,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:01:02,372 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:01:02,464 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_0dedfd83-c431-4802-ae51-17670ba2bcb2/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2022-11-18 20:01:02,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:01:02,500 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:01:02,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:02 WrapperNode [2022-11-18 20:01:02,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:01:02,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:01:02,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:01:02,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:01:02,516 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:01:02" (1/1) ... [2022-11-18 20:01:02,542 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:01:02" (1/1) ... [2022-11-18 20:01:02,567 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-11-18 20:01:02,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:01:02,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:01:02,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:01:02,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:01:02,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:02" (1/1) ... [2022-11-18 20:01:02,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:02" (1/1) ... [2022-11-18 20:01:02,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:02" (1/1) ... [2022-11-18 20:01:02,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:02" (1/1) ... [2022-11-18 20:01:02,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:02" (1/1) ... [2022-11-18 20:01:02,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:02" (1/1) ... [2022-11-18 20:01:02,598 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:02" (1/1) ... [2022-11-18 20:01:02,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:02" (1/1) ... [2022-11-18 20:01:02,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:01:02,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:01:02,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:01:02,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:01:02,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:02" (1/1) ... [2022-11-18 20:01:02,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:01:02,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:02,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:01:02,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:01:02,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:01:02,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:01:02,700 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-18 20:01:02,700 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-18 20:01:02,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:01:02,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:01:02,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:01:02,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:01:02,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:01:02,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:01:02,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:01:02,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:01:02,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:01:02,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:01:02,842 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:01:02,844 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:01:03,446 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:01:03,453 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:01:03,469 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-18 20:01:03,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:01:03 BoogieIcfgContainer [2022-11-18 20:01:03,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:01:03,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:01:03,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:01:03,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:01:03,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:01:01" (1/3) ... [2022-11-18 20:01:03,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d001704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:01:03, skipping insertion in model container [2022-11-18 20:01:03,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:02" (2/3) ... [2022-11-18 20:01:03,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d001704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:01:03, skipping insertion in model container [2022-11-18 20:01:03,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:01:03" (3/3) ... [2022-11-18 20:01:03,482 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2022-11-18 20:01:03,508 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:01:03,508 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-11-18 20:01:03,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:01:03,576 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;@10a8e003, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:01:03,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-18 20:01:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 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:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:01:03,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:03,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:01:03,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash 895672562, now seen corresponding path program 1 times [2022-11-18 20:01:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:03,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328568724] [2022-11-18 20:01:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:03,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:03,908 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:01:03,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328568724] [2022-11-18 20:01:03,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328568724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:03,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:03,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:01:03,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639355388] [2022-11-18 20:01:03,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:03,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:01:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:03,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:01:03,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:01:03,967 INFO L87 Difference]: Start difference. First operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 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:01:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:04,239 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-11-18 20:01:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:01:04,243 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:01:04,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:04,257 INFO L225 Difference]: With dead ends: 135 [2022-11-18 20:01:04,258 INFO L226 Difference]: Without dead ends: 132 [2022-11-18 20:01:04,260 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:01:04,264 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:04,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:01:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-18 20:01:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-18 20:01:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 2.014925373134328) internal successors, (135), 127 states have internal predecessors, (135), 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:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-11-18 20:01:04,340 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2022-11-18 20:01:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:04,340 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-11-18 20:01:04,341 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:01:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-11-18 20:01:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:01:04,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:04,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:01:04,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:01:04,343 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:04,344 INFO L85 PathProgramCache]: Analyzing trace with hash 895672563, now seen corresponding path program 1 times [2022-11-18 20:01:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:04,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709396667] [2022-11-18 20:01:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:04,516 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:01:04,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:04,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709396667] [2022-11-18 20:01:04,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709396667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:04,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:04,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:01:04,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565142419] [2022-11-18 20:01:04,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:04,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:01:04,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:04,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:01:04,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:01:04,520 INFO L87 Difference]: Start difference. First operand 132 states and 141 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:01:04,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:04,677 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-11-18 20:01:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:01:04,677 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:01:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:04,679 INFO L225 Difference]: With dead ends: 129 [2022-11-18 20:01:04,679 INFO L226 Difference]: Without dead ends: 129 [2022-11-18 20:01:04,680 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:01:04,681 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:04,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 209 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:01:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-18 20:01:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-18 20:01:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 124 states have internal predecessors, (132), 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:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-11-18 20:01:04,690 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 6 [2022-11-18 20:01:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:04,691 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-11-18 20:01:04,691 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:01:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-11-18 20:01:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:01:04,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:04,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:01:04,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:01:04,693 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:04,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash -753542016, now seen corresponding path program 1 times [2022-11-18 20:01:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:04,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189568837] [2022-11-18 20:01:04,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:04,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:04,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:04,851 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:01:04,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:04,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189568837] [2022-11-18 20:01:04,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189568837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:04,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:04,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:01:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155285262] [2022-11-18 20:01:04,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:04,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:01:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:04,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:01:04,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:01:04,855 INFO L87 Difference]: Start difference. First operand 129 states and 138 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:01:05,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:05,098 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-11-18 20:01:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:01:05,099 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:01:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:05,105 INFO L225 Difference]: With dead ends: 140 [2022-11-18 20:01:05,106 INFO L226 Difference]: Without dead ends: 140 [2022-11-18 20:01:05,106 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:01:05,107 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:05,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 313 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:01:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-18 20:01:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-11-18 20:01:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 125 states have internal predecessors, (133), 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:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-11-18 20:01:05,121 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 14 [2022-11-18 20:01:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:05,121 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-11-18 20:01:05,121 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:01:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-11-18 20:01:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:01:05,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:05,123 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:01:05,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:01:05,123 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:05,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 265974304, now seen corresponding path program 1 times [2022-11-18 20:01:05,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:05,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516108356] [2022-11-18 20:01:05,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:05,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:05,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:05,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:05,549 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:01:05,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:05,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516108356] [2022-11-18 20:01:05,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516108356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:05,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:05,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:01:05,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466060319] [2022-11-18 20:01:05,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:05,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:01:05,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:05,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:01:05,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:01:05,553 INFO L87 Difference]: Start difference. First operand 130 states and 139 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:01:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:05,922 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-11-18 20:01:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:01:05,923 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:01:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:05,926 INFO L225 Difference]: With dead ends: 130 [2022-11-18 20:01:05,926 INFO L226 Difference]: Without dead ends: 130 [2022-11-18 20:01:05,927 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:01:05,928 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 21 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:05,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 426 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:01:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-18 20:01:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-18 20:01:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 124 states have internal predecessors, (132), 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:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-11-18 20:01:05,938 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 24 [2022-11-18 20:01:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:05,939 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-11-18 20:01:05,939 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:01:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-11-18 20:01:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:01:05,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:05,940 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:01:05,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:01:05,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:05,942 INFO L85 PathProgramCache]: Analyzing trace with hash 265974305, now seen corresponding path program 1 times [2022-11-18 20:01:05,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:05,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256288582] [2022-11-18 20:01:05,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:05,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:06,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:06,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:06,321 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:01:06,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:06,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256288582] [2022-11-18 20:01:06,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256288582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:06,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:06,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:01:06,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802881736] [2022-11-18 20:01:06,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:06,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:01:06,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:06,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:01:06,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:01:06,324 INFO L87 Difference]: Start difference. First operand 129 states and 138 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:01:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:06,685 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-11-18 20:01:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:01:06,686 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:01:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:06,687 INFO L225 Difference]: With dead ends: 129 [2022-11-18 20:01:06,687 INFO L226 Difference]: Without dead ends: 129 [2022-11-18 20:01:06,688 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:01:06,689 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 19 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:06,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 450 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:01:06,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-18 20:01:06,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-11-18 20:01:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 123 states have internal predecessors, (131), 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:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2022-11-18 20:01:06,696 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2022-11-18 20:01:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:06,697 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2022-11-18 20:01:06,697 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:01:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2022-11-18 20:01:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:01:06,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:06,698 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:01:06,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:01:06,699 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:06,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:06,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731903, now seen corresponding path program 1 times [2022-11-18 20:01:06,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:06,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627090947] [2022-11-18 20:01:06,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:06,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:06,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:06,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:07,070 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:01:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:07,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627090947] [2022-11-18 20:01:07,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627090947] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:07,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608318726] [2022-11-18 20:01:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:07,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:07,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:07,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:07,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:01:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:07,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-18 20:01:07,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:07,366 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:07,455 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:01:07,635 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:01:07,636 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:07,650 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:01:07,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:07,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608318726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:07,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:07,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-18 20:01:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270268000] [2022-11-18 20:01:07,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:07,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:01:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:07,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:01:07,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-18 20:01:07,744 INFO L87 Difference]: Start difference. First operand 128 states and 137 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:01:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:08,190 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-11-18 20:01:08,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:01:08,191 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:01:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:08,192 INFO L225 Difference]: With dead ends: 135 [2022-11-18 20:01:08,192 INFO L226 Difference]: Without dead ends: 135 [2022-11-18 20:01:08,192 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:01:08,193 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:08,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 495 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 0 Unknown, 153 Unchecked, 0.4s Time] [2022-11-18 20:01:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-18 20:01:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-11-18 20:01:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 127 states have internal predecessors, (137), 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:01:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-11-18 20:01:08,211 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 26 [2022-11-18 20:01:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:08,212 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-11-18 20:01:08,212 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:01:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-11-18 20:01:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:01:08,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:08,215 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:01:08,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:08,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:08,416 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:08,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731902, now seen corresponding path program 1 times [2022-11-18 20:01:08,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:08,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241638070] [2022-11-18 20:01:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:08,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:08,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:08,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:08,836 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:01:08,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:08,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241638070] [2022-11-18 20:01:08,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241638070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:08,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325031242] [2022-11-18 20:01:08,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:08,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:08,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:08,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:08,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:01:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:08,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-18 20:01:08,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:09,002 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:09,420 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:01:09,421 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 14 treesize of output 20 [2022-11-18 20:01:09,450 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:01:09,450 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:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:01:09,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:15,791 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:01:15,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325031242] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:15,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:15,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2022-11-18 20:01:15,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056094216] [2022-11-18 20:01:15,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:15,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:01:15,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:15,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:01:15,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:01:15,795 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 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:01:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:16,719 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-11-18 20:01:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:01:16,720 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 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:01:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:16,721 INFO L225 Difference]: With dead ends: 135 [2022-11-18 20:01:16,721 INFO L226 Difference]: Without dead ends: 135 [2022-11-18 20:01:16,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-11-18 20:01:16,723 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:16,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 853 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 713 Invalid, 0 Unknown, 161 Unchecked, 0.7s Time] [2022-11-18 20:01:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-18 20:01:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-11-18 20:01:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 127 states have internal predecessors, (136), 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:01:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-11-18 20:01:16,729 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2022-11-18 20:01:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:16,730 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-11-18 20:01:16,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 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:01:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-11-18 20:01:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 20:01:16,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:16,732 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:01:16,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:16,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 20:01:16,939 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash -619542825, now seen corresponding path program 1 times [2022-11-18 20:01:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:16,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599200406] [2022-11-18 20:01:16,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:17,191 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:01:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:17,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599200406] [2022-11-18 20:01:17,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599200406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:17,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040676409] [2022-11-18 20:01:17,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:17,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:17,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:17,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:17,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:01:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:17,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:01:17,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:17,449 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:01:17,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:17,550 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:01:17,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040676409] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:01:17,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:01:17,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-18 20:01:17,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117209770] [2022-11-18 20:01:17,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:17,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:01:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:17,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:01:17,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:01:17,555 INFO L87 Difference]: Start difference. First operand 133 states and 144 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:01:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:17,843 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-11-18 20:01:17,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:01:17,844 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:01:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:17,845 INFO L225 Difference]: With dead ends: 134 [2022-11-18 20:01:17,845 INFO L226 Difference]: Without dead ends: 134 [2022-11-18 20:01:17,845 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:01:17,846 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:17,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 660 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:01:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-18 20:01:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-11-18 20:01:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 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:01:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-11-18 20:01:17,853 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2022-11-18 20:01:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:17,854 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-11-18 20:01:17,854 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:01:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-11-18 20:01:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:01:17,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:17,856 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:01:17,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:18,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:18,063 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739054, now seen corresponding path program 1 times [2022-11-18 20:01:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:18,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037627252] [2022-11-18 20:01:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:18,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:18,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:18,210 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:01:18,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:18,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037627252] [2022-11-18 20:01:18,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037627252] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:18,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165805610] [2022-11-18 20:01:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:18,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:18,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:18,214 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:18,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:01:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:18,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 20:01:18,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:18,412 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:01:18,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:18,430 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 20:01:18,431 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:01:18,460 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:01:18,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165805610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:01:18,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:01:18,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-18 20:01:18,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480046671] [2022-11-18 20:01:18,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:18,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:01:18,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:18,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:01:18,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:01:18,463 INFO L87 Difference]: Start difference. First operand 133 states and 143 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:01:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:18,765 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2022-11-18 20:01:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:01:18,766 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:01:18,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:18,767 INFO L225 Difference]: With dead ends: 138 [2022-11-18 20:01:18,767 INFO L226 Difference]: Without dead ends: 138 [2022-11-18 20:01:18,767 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:01:18,768 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 12 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:18,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 429 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:01:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-18 20:01:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-11-18 20:01:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 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:01:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-11-18 20:01:18,774 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 29 [2022-11-18 20:01:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:18,774 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-11-18 20:01:18,774 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:01:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-11-18 20:01:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:01:18,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:18,775 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:01:18,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:18,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:18,976 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739053, now seen corresponding path program 1 times [2022-11-18 20:01:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:18,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538384239] [2022-11-18 20:01:18,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:18,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:19,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:19,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:19,241 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:01:19,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:19,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538384239] [2022-11-18 20:01:19,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538384239] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:19,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002387261] [2022-11-18 20:01:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:19,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:19,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:19,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:19,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:01:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:19,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:01:19,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:19,612 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:01:19,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:19,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:01:19,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 20 treesize of output 24 [2022-11-18 20:01:19,846 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:01:19,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002387261] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:01:19,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:01:19,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-18 20:01:19,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108796220] [2022-11-18 20:01:19,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:19,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:01:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:19,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:01:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:01:19,849 INFO L87 Difference]: Start difference. First operand 136 states and 148 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:01:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:20,294 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-11-18 20:01:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:01:20,295 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:01:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:20,296 INFO L225 Difference]: With dead ends: 143 [2022-11-18 20:01:20,296 INFO L226 Difference]: Without dead ends: 143 [2022-11-18 20:01:20,296 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:01:20,297 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 28 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:20,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1226 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:01:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-18 20:01:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-11-18 20:01:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 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:01:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-11-18 20:01:20,303 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 29 [2022-11-18 20:01:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:20,304 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-11-18 20:01:20,304 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:01:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-11-18 20:01:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 20:01:20,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:20,310 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:01:20,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:20,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 20:01:20,512 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:20,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:20,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598771, now seen corresponding path program 1 times [2022-11-18 20:01:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:20,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930416755] [2022-11-18 20:01:20,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:20,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:20,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:20,668 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:01:20,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:20,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930416755] [2022-11-18 20:01:20,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930416755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:20,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:20,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:01:20,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203429619] [2022-11-18 20:01:20,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:20,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:01:20,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:20,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:01:20,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:01:20,671 INFO L87 Difference]: Start difference. First operand 136 states and 147 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:01:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:21,032 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-11-18 20:01:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:01:21,033 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:01:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:21,034 INFO L225 Difference]: With dead ends: 136 [2022-11-18 20:01:21,034 INFO L226 Difference]: Without dead ends: 136 [2022-11-18 20:01:21,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:01:21,034 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 24 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:21,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 475 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:01:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-18 20:01:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-11-18 20:01:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.84) internal successors, (138), 129 states have internal predecessors, (138), 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:01:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-11-18 20:01:21,039 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2022-11-18 20:01:21,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:21,039 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-11-18 20:01:21,039 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:01:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-11-18 20:01:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 20:01:21,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:21,040 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:01:21,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:01:21,041 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:21,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:21,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598772, now seen corresponding path program 1 times [2022-11-18 20:01:21,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:21,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780599849] [2022-11-18 20:01:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:21,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:21,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:21,383 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:01:21,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:21,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780599849] [2022-11-18 20:01:21,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780599849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:21,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:21,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:01:21,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859622886] [2022-11-18 20:01:21,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:21,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:01:21,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:21,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:01:21,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:01:21,387 INFO L87 Difference]: Start difference. First operand 135 states and 146 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:01:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:21,786 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-11-18 20:01:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:01:21,786 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:01:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:21,787 INFO L225 Difference]: With dead ends: 134 [2022-11-18 20:01:21,788 INFO L226 Difference]: Without dead ends: 134 [2022-11-18 20:01:21,788 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:01:21,788 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:21,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 505 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:01:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-18 20:01:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-11-18 20:01:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 128 states have internal predecessors, (137), 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:01:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-11-18 20:01:21,793 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2022-11-18 20:01:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:21,794 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-11-18 20:01:21,794 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:01:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-11-18 20:01:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 20:01:21,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:21,795 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:01:21,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:01:21,796 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:21,797 INFO L85 PathProgramCache]: Analyzing trace with hash 939320083, now seen corresponding path program 1 times [2022-11-18 20:01:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:21,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093938274] [2022-11-18 20:01:21,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:21,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:21,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:21,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:01:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:21,959 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:01:21,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:21,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093938274] [2022-11-18 20:01:21,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093938274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:21,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908963557] [2022-11-18 20:01:21,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:21,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:21,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:21,962 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:21,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:01:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:22,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:01:22,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:22,212 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:01:22,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:01:22,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908963557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:22,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:01:22,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-18 20:01:22,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18820316] [2022-11-18 20:01:22,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:22,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:01:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:22,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:01:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:01:22,214 INFO L87 Difference]: Start difference. First operand 134 states and 145 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:01:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:22,229 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-11-18 20:01:22,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:01:22,230 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:01:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:22,230 INFO L225 Difference]: With dead ends: 122 [2022-11-18 20:01:22,231 INFO L226 Difference]: Without dead ends: 122 [2022-11-18 20:01:22,231 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:01:22,232 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 214 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:22,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 142 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:01:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-18 20:01:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-18 20:01:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8088235294117647) internal successors, (123), 117 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:01:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2022-11-18 20:01:22,236 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2022-11-18 20:01:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:22,236 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2022-11-18 20:01:22,236 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:01:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-11-18 20:01:22,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-18 20:01:22,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:22,237 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:01:22,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-18 20:01:22,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:01:22,443 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:22,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:22,444 INFO L85 PathProgramCache]: Analyzing trace with hash -566913869, now seen corresponding path program 1 times [2022-11-18 20:01:22,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:22,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672231163] [2022-11-18 20:01:22,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:22,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:22,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:22,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:22,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:22,981 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:01:22,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:22,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672231163] [2022-11-18 20:01:22,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672231163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:22,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928583310] [2022-11-18 20:01:22,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:22,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:22,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:22,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:23,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:01:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:23,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-18 20:01:23,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:23,220 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:23,231 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:23,252 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:01:23,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:23,302 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:01:23,322 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:23,329 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:01:23,361 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:01:23,362 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:01:23,445 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:23,458 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_1584 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1584))))) is different from true [2022-11-18 20:01:23,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:23,536 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:01:23,541 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:01:23,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:23,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928583310] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:23,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:23,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-18 20:01:23,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452460732] [2022-11-18 20:01:23,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:23,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:01:23,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:23,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:01:23,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=125, Unknown=3, NotChecked=72, Total=240 [2022-11-18 20:01:23,612 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 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:01:24,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:24,355 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2022-11-18 20:01:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:01:24,356 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 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:01:24,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:24,357 INFO L225 Difference]: With dead ends: 133 [2022-11-18 20:01:24,357 INFO L226 Difference]: Without dead ends: 133 [2022-11-18 20:01:24,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=218, Unknown=3, NotChecked=96, Total=380 [2022-11-18 20:01:24,358 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 143 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:24,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 508 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 590 Invalid, 0 Unknown, 401 Unchecked, 0.5s Time] [2022-11-18 20:01:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-18 20:01:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2022-11-18 20:01:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 110 states have internal predecessors, (116), 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:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2022-11-18 20:01:24,361 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 43 [2022-11-18 20:01:24,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:24,362 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2022-11-18 20:01:24,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 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:01:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2022-11-18 20:01:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-18 20:01:24,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:24,363 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:01:24,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:24,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:01:24,563 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash -566913868, now seen corresponding path program 1 times [2022-11-18 20:01:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:24,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425216099] [2022-11-18 20:01:24,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:24,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:25,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:25,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-18 20:01:25,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:25,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425216099] [2022-11-18 20:01:25,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425216099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:25,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110622947] [2022-11-18 20:01:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:25,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:25,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:25,280 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:25,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:01:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:25,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 20:01:25,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:25,540 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:25,557 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:25,578 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1821 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1821) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-18 20:01:25,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:25,625 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:01:25,653 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:25,662 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_1822 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1822))))) is different from true [2022-11-18 20:01:25,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:25,712 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:01:25,787 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:25,796 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:01:25,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:25,847 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:01:25,856 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:01:25,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:27,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110622947] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:27,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:27,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-18 20:01:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52791147] [2022-11-18 20:01:27,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:27,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:01:27,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:01:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-11-18 20:01:27,991 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:01:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:28,629 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2022-11-18 20:01:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:01:28,629 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-11-18 20:01:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:28,630 INFO L225 Difference]: With dead ends: 125 [2022-11-18 20:01:28,630 INFO L226 Difference]: Without dead ends: 125 [2022-11-18 20:01:28,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2022-11-18 20:01:28,631 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 270 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:28,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 259 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 421 Invalid, 0 Unknown, 378 Unchecked, 0.5s Time] [2022-11-18 20:01:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-18 20:01:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-11-18 20:01:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.588235294117647) internal successors, (108), 102 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:01:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2022-11-18 20:01:28,635 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 43 [2022-11-18 20:01:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:28,635 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2022-11-18 20:01:28,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:01:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2022-11-18 20:01:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-18 20:01:28,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:28,636 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:01:28,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:28,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:01:28,843 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:28,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:28,844 INFO L85 PathProgramCache]: Analyzing trace with hash 656619060, now seen corresponding path program 1 times [2022-11-18 20:01:28,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:28,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126213917] [2022-11-18 20:01:28,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:28,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:28,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:28,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:29,036 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:01:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:29,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126213917] [2022-11-18 20:01:29,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126213917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:29,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:29,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:01:29,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573021547] [2022-11-18 20:01:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:29,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:01:29,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:29,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:01:29,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:01:29,039 INFO L87 Difference]: Start difference. First operand 107 states and 114 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:01:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:29,308 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-11-18 20:01:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:01:29,309 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:01:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:29,310 INFO L225 Difference]: With dead ends: 121 [2022-11-18 20:01:29,310 INFO L226 Difference]: Without dead ends: 121 [2022-11-18 20:01:29,310 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:01:29,311 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 79 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:29,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 282 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:01:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-18 20:01:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2022-11-18 20:01:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 98 states have internal predecessors, (104), 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:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-11-18 20:01:29,314 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 45 [2022-11-18 20:01:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:29,315 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-11-18 20:01:29,315 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:01:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-11-18 20:01:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-18 20:01:29,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:29,316 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:01:29,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:01:29,316 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:29,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash 656619061, now seen corresponding path program 1 times [2022-11-18 20:01:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:29,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299625863] [2022-11-18 20:01:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:29,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:29,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:29,621 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:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:29,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299625863] [2022-11-18 20:01:29,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299625863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:29,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:29,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:01:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992297273] [2022-11-18 20:01:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:29,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:01:29,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:29,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:01:29,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:01:29,624 INFO L87 Difference]: Start difference. First operand 103 states and 110 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:01:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:29,867 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-11-18 20:01:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:01:29,868 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:01:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:29,869 INFO L225 Difference]: With dead ends: 99 [2022-11-18 20:01:29,869 INFO L226 Difference]: Without dead ends: 99 [2022-11-18 20:01:29,869 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:01:29,870 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:29,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 297 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:01:29,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-18 20:01:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-18 20:01:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 94 states have internal predecessors, (100), 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:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-11-18 20:01:29,873 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 45 [2022-11-18 20:01:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:29,873 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-11-18 20:01:29,874 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:01:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-11-18 20:01:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-18 20:01:29,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:29,874 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:01:29,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:01:29,875 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:29,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634675, now seen corresponding path program 1 times [2022-11-18 20:01:29,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:29,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073266449] [2022-11-18 20:01:29,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:30,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:30,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:30,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:30,813 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:01:30,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:30,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073266449] [2022-11-18 20:01:30,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073266449] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:30,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201138784] [2022-11-18 20:01:30,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:30,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:30,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:30,815 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:30,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:01:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:31,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:01:31,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:31,170 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:31,423 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:01:31,628 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2355 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2355))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-18 20:01:31,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:31,666 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:31,682 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-18 20:01:31,682 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 18 [2022-11-18 20:01:31,806 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:01:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-18 20:01:31,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:31,906 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_48| Int) (v_ArrVal_2361 (Array Int Int))) (or (not (< |v_node_create_~temp~0#1.base_48| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_48| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_48| v_ArrVal_2361) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 1))) is different from false [2022-11-18 20:01:31,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201138784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:31,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:31,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-11-18 20:01:31,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718288883] [2022-11-18 20:01:31,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:31,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:01:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:31,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:01:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=573, Unknown=3, NotChecked=98, Total=756 [2022-11-18 20:01:31,910 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 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:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:32,725 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-11-18 20:01:32,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:01:32,726 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 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:01:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:32,727 INFO L225 Difference]: With dead ends: 98 [2022-11-18 20:01:32,727 INFO L226 Difference]: Without dead ends: 98 [2022-11-18 20:01:32,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=862, Unknown=5, NotChecked=122, Total=1122 [2022-11-18 20:01:32,728 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 30 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:32,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 562 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 454 Invalid, 0 Unknown, 154 Unchecked, 0.5s Time] [2022-11-18 20:01:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-18 20:01:32,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-11-18 20:01:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 93 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:01:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-11-18 20:01:32,734 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 46 [2022-11-18 20:01:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:32,735 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-11-18 20:01:32,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 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:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-11-18 20:01:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-18 20:01:32,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:32,736 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:01:32,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:32,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:01:32,937 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634674, now seen corresponding path program 1 times [2022-11-18 20:01:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:32,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892579204] [2022-11-18 20:01:32,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:32,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:33,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:33,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:34,786 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:01:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:34,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892579204] [2022-11-18 20:01:34,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892579204] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:34,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154982471] [2022-11-18 20:01:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:34,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:34,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:34,788 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:34,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:01:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:35,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-18 20:01:35,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:35,141 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:35,681 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 19 treesize of output 11 [2022-11-18 20:01:35,688 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,923 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2601 (Array Int Int)) (v_ArrVal_2600 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2600)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2601) |c_#memory_$Pointer$.offset|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-18 20:01:35,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:35,991 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 25 treesize of output 25 [2022-11-18 20:01:36,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:36,019 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,034 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:01:36,034 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:36,042 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 18 treesize of output 13 [2022-11-18 20:01:36,130 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:36,135 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:01:36,181 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:01:36,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:37,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154982471] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:37,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:37,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2022-11-18 20:01:37,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154927526] [2022-11-18 20:01:37,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:37,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-18 20:01:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:37,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-18 20:01:37,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=897, Unknown=1, NotChecked=60, Total=1056 [2022-11-18 20:01:37,364 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 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:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:39,300 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-11-18 20:01:39,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:01:39,301 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 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:01:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:39,302 INFO L225 Difference]: With dead ends: 97 [2022-11-18 20:01:39,302 INFO L226 Difference]: Without dead ends: 97 [2022-11-18 20:01:39,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=198, Invalid=1527, Unknown=1, NotChecked=80, Total=1806 [2022-11-18 20:01:39,303 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 210 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:39,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 788 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1114 Invalid, 0 Unknown, 101 Unchecked, 1.2s Time] [2022-11-18 20:01:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-18 20:01:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-18 20:01:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 92 states have internal predecessors, (98), 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:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-11-18 20:01:39,311 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 46 [2022-11-18 20:01:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:39,311 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-11-18 20:01:39,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 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:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-11-18 20:01:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:01:39,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:39,313 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:01:39,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:39,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:39,519 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2067869774, now seen corresponding path program 1 times [2022-11-18 20:01:39,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:39,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115823591] [2022-11-18 20:01:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:39,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:41,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:42,218 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:42,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:42,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115823591] [2022-11-18 20:01:42,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115823591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:42,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623110993] [2022-11-18 20:01:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:42,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:42,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:42,219 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:42,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:01:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:42,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-18 20:01:42,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:42,603 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:42,887 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:43,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:01:43,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2022-11-18 20:01:43,126 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 18 treesize of output 14 [2022-11-18 20:01:43,138 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:01:43,138 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 7 [2022-11-18 20:01:43,444 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2856 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2855 (Array Int Int))) (and (<= (+ |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|))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2855) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2856) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:01:43,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:43,547 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:01:43,547 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:01:43,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:43,559 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:01:43,609 INFO L321 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2022-11-18 20:01:43,609 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:01:43,718 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:01:43,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:01:43,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-18 20:01:43,861 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:01:43,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:44,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623110993] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:44,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:44,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 34 [2022-11-18 20:01:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864994937] [2022-11-18 20:01:44,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:44,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-18 20:01:44,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:44,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-18 20:01:44,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1220, Unknown=1, NotChecked=70, Total=1406 [2022-11-18 20:01:44,202 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:01:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:46,777 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2022-11-18 20:01:46,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:01:46,780 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 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:01:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:46,781 INFO L225 Difference]: With dead ends: 181 [2022-11-18 20:01:46,782 INFO L226 Difference]: Without dead ends: 181 [2022-11-18 20:01:46,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=278, Invalid=2175, Unknown=1, NotChecked=96, Total=2550 [2022-11-18 20:01:46,784 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 512 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:46,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1301 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1433 Invalid, 0 Unknown, 235 Unchecked, 1.6s Time] [2022-11-18 20:01:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-18 20:01:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 96. [2022-11-18 20:01:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 91 states have internal predecessors, (97), 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:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-11-18 20:01:46,789 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 48 [2022-11-18 20:01:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:46,790 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-11-18 20:01:46,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:01:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-11-18 20:01:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:01:46,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:46,791 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:01:46,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:46,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:46,998 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2067869775, now seen corresponding path program 1 times [2022-11-18 20:01:46,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:46,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638526394] [2022-11-18 20:01:46,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 20:01:50,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:50,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638526394] [2022-11-18 20:01:50,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638526394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:50,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23021857] [2022-11-18 20:01:50,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:50,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:50,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:50,078 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:50,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:01:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:50,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-18 20:01:50,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:50,544 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:51,070 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:51,079 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:51,384 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-18 20:01:51,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 44 [2022-11-18 20:01:51,402 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-18 20:01:51,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2022-11-18 20:01:51,430 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:01:51,430 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 7 [2022-11-18 20:01:51,710 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3112 (Array Int Int)) (v_ArrVal_3113 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3113)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-18 20:01:51,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:51,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:51,781 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 20:01:51,781 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 78 treesize of output 71 [2022-11-18 20:01:51,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:51,808 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:01:51,808 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 87 treesize of output 83 [2022-11-18 20:01:51,836 INFO L321 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2022-11-18 20:01:51,837 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 34 treesize of output 36 [2022-11-18 20:01:51,844 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 44 treesize of output 39 [2022-11-18 20:01:52,087 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-18 20:01:52,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 50 [2022-11-18 20:01:52,102 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-18 20:01:52,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-11-18 20:01:52,206 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:01:52,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:01:52,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23021857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:52,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:01:52,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 41 [2022-11-18 20:01:52,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512750713] [2022-11-18 20:01:52,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:01:52,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-18 20:01:52,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:52,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-18 20:01:52,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1926, Unknown=1, NotChecked=88, Total=2162 [2022-11-18 20:01:52,870 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 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:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:57,120 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-11-18 20:01:57,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:01:57,120 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 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:01:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:57,121 INFO L225 Difference]: With dead ends: 146 [2022-11-18 20:01:57,122 INFO L226 Difference]: Without dead ends: 146 [2022-11-18 20:01:57,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=309, Invalid=3476, Unknown=1, NotChecked=120, Total=3906 [2022-11-18 20:01:57,123 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 249 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:57,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 2160 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2289 Invalid, 0 Unknown, 224 Unchecked, 2.4s Time] [2022-11-18 20:01:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-18 20:01:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2022-11-18 20:01:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.411764705882353) internal successors, (96), 90 states have internal predecessors, (96), 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:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-11-18 20:01:57,127 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 48 [2022-11-18 20:01:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:57,128 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-11-18 20:01:57,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 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:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-11-18 20:01:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-18 20:01:57,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:57,129 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] [2022-11-18 20:01:57,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:57,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:57,334 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash -645963400, now seen corresponding path program 1 times [2022-11-18 20:01:57,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:57,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491747198] [2022-11-18 20:01:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:57,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:57,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:57,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:57,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-18 20:01:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:57,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491747198] [2022-11-18 20:01:57,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491747198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:57,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:57,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:01:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555817033] [2022-11-18 20:01:57,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:57,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:01:57,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:57,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:01:57,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:01:57,534 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:01:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:57,701 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-11-18 20:01:57,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:01:57,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-11-18 20:01:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:57,703 INFO L225 Difference]: With dead ends: 112 [2022-11-18 20:01:57,703 INFO L226 Difference]: Without dead ends: 112 [2022-11-18 20:01:57,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:01:57,704 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 92 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:57,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 188 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:01:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-18 20:01:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2022-11-18 20:01:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 89 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:01:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-11-18 20:01:57,708 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 49 [2022-11-18 20:01:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:57,708 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-11-18 20:01:57,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:01:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-11-18 20:01:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:01:57,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:57,710 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:01:57,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 20:01:57,710 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1999432508, now seen corresponding path program 1 times [2022-11-18 20:01:57,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:57,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860665480] [2022-11-18 20:01:57,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:57,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,219 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:01:58,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:58,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860665480] [2022-11-18 20:01:58,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860665480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:58,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:58,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:01:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925816423] [2022-11-18 20:01:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:58,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:01:58,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:58,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:01:58,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:01:58,222 INFO L87 Difference]: Start difference. First operand 94 states and 101 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:01:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:58,769 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2022-11-18 20:01:58,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:01:58,770 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:01:58,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:58,771 INFO L225 Difference]: With dead ends: 160 [2022-11-18 20:01:58,771 INFO L226 Difference]: Without dead ends: 160 [2022-11-18 20:01:58,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:01:58,772 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 261 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:58,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 421 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:01:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-18 20:01:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 97. [2022-11-18 20:01:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.375) internal successors, (99), 92 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:01:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-11-18 20:01:58,777 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 51 [2022-11-18 20:01:58,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:58,778 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-11-18 20:01:58,778 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:01:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-11-18 20:01:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:01:58,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:58,779 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:01:58,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 20:01:58,780 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:01:58,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:58,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1999432509, now seen corresponding path program 1 times [2022-11-18 20:01:58,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:58,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465074129] [2022-11-18 20:01:58,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:58,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:59,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:01:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:59,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:01:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:59,526 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:59,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:59,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465074129] [2022-11-18 20:01:59,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465074129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:59,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:59,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:01:59,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613337543] [2022-11-18 20:01:59,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:59,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:01:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:59,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:01:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:01:59,530 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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:02:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:00,017 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-11-18 20:02:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:02:00,018 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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:02:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:00,019 INFO L225 Difference]: With dead ends: 146 [2022-11-18 20:02:00,019 INFO L226 Difference]: Without dead ends: 146 [2022-11-18 20:02:00,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:02:00,020 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 314 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:00,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 425 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:02:00,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-18 20:02:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 99. [2022-11-18 20:02:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.364864864864865) internal successors, (101), 94 states have internal predecessors, (101), 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:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-11-18 20:02:00,025 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 51 [2022-11-18 20:02:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:00,026 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-11-18 20:02:00,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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:02:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-11-18 20:02:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-18 20:02:00,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:00,027 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:02:00,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 20:02:00,028 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:02:00,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:00,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1604261226, now seen corresponding path program 1 times [2022-11-18 20:02:00,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:00,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158177626] [2022-11-18 20:02:00,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:00,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:02:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:02:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,874 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:02:00,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:00,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158177626] [2022-11-18 20:02:00,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158177626] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:00,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936670270] [2022-11-18 20:02:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:00,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:00,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:00,876 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:00,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:02:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:01,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:02:01,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:01,710 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:02:01,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:01,925 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 19 [2022-11-18 20:02:02,046 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:02:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:02:02,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:02:02,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936670270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:02,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:02:02,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2022-11-18 20:02:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603114489] [2022-11-18 20:02:02,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:02:02,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:02:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:02,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:02:02,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=716, Unknown=4, NotChecked=0, Total=812 [2022-11-18 20:02:02,322 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 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:02:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:03,330 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-11-18 20:02:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:02:03,331 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 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:02:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:03,334 INFO L225 Difference]: With dead ends: 90 [2022-11-18 20:02:03,334 INFO L226 Difference]: Without dead ends: 90 [2022-11-18 20:02:03,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=191, Invalid=1137, Unknown=4, NotChecked=0, Total=1332 [2022-11-18 20:02:03,336 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 526 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:03,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 689 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:02:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-18 20:02:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-18 20:02:03,340 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:02:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-11-18 20:02:03,341 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 53 [2022-11-18 20:02:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:03,341 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-11-18 20:02:03,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 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:02:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-11-18 20:02:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-18 20:02:03,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:03,343 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:02:03,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-18 20:02:03,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-18 20:02:03,551 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:02:03,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:03,551 INFO L85 PathProgramCache]: Analyzing trace with hash -696733545, now seen corresponding path program 1 times [2022-11-18 20:02:03,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:03,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994343551] [2022-11-18 20:02:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:04,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:04,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:02:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:02:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:05,246 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:02:05,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:05,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994343551] [2022-11-18 20:02:05,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994343551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:05,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:05,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-18 20:02:05,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268063133] [2022-11-18 20:02:05,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:05,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:02:05,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:05,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:02:05,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:02:05,249 INFO L87 Difference]: Start difference. First operand 90 states and 96 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:02:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:06,026 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-11-18 20:02:06,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:02:06,027 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:02:06,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:06,028 INFO L225 Difference]: With dead ends: 107 [2022-11-18 20:02:06,028 INFO L226 Difference]: Without dead ends: 107 [2022-11-18 20:02:06,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-11-18 20:02:06,029 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 293 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:06,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 534 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:02:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-18 20:02:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2022-11-18 20:02:06,032 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:02:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-18 20:02:06,033 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 54 [2022-11-18 20:02:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:06,034 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-18 20:02:06,034 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:02:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-18 20:02:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-18 20:02:06,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:06,036 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:02:06,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-18 20:02:06,036 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:02:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash -696733544, now seen corresponding path program 1 times [2022-11-18 20:02:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:06,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173406949] [2022-11-18 20:02:06,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:07,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:07,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:02:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:02:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:02:08,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:08,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173406949] [2022-11-18 20:02:08,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173406949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:08,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:08,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-18 20:02:08,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150272397] [2022-11-18 20:02:08,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:08,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 20:02:08,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:08,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 20:02:08,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:02:08,225 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:02:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:09,421 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-11-18 20:02:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:02:09,422 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-11-18 20:02:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:09,423 INFO L225 Difference]: With dead ends: 88 [2022-11-18 20:02:09,423 INFO L226 Difference]: Without dead ends: 88 [2022-11-18 20:02:09,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2022-11-18 20:02:09,425 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 565 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:09,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 461 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:02:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-18 20:02:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-18 20:02:09,429 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:02:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-18 20:02:09,430 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 54 [2022-11-18 20:02:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:09,430 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-18 20:02:09,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:02:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-18 20:02:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:02:09,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:09,432 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:02:09,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-18 20:02:09,432 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:02:09,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash -833520442, now seen corresponding path program 1 times [2022-11-18 20:02:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:09,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981457874] [2022-11-18 20:02:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:02:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:10,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:02:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:11,229 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:02:11,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:11,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981457874] [2022-11-18 20:02:11,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981457874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:11,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280953526] [2022-11-18 20:02:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:11,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:11,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:11,232 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:11,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 20:02:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:11,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-18 20:02:11,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:12,010 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:12,449 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:02:12,755 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-18 20:02:12,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 15 [2022-11-18 20:02:12,761 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:13,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:13,307 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:02:13,308 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 44 treesize of output 48 [2022-11-18 20:02:13,341 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-18 20:02:13,341 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 21 treesize of output 29 [2022-11-18 20:02:13,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:13,357 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 26 treesize of output 28 [2022-11-18 20:02:13,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-18 20:02:14,171 INFO L321 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-11-18 20:02:14,172 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 58 treesize of output 69 [2022-11-18 20:02:14,184 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 21 treesize of output 13 [2022-11-18 20:02:14,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:14,326 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 33 treesize of output 31 [2022-11-18 20:02:14,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:14,385 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 33 treesize of output 31 [2022-11-18 20:02:14,649 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:02:14,650 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 37 treesize of output 36 [2022-11-18 20:02:14,810 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 34 treesize of output 18 [2022-11-18 20:02:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:02:14,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:14,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280953526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:14,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:02:14,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [20] total 48 [2022-11-18 20:02:14,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878895508] [2022-11-18 20:02:14,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:14,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-18 20:02:14,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-18 20:02:14,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2163, Unknown=1, NotChecked=0, Total=2352 [2022-11-18 20:02:14,982 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (3), 2 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:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:15,601 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-11-18 20:02:15,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 20:02:15,602 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2022-11-18 20:02:15,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:15,603 INFO L225 Difference]: With dead ends: 89 [2022-11-18 20:02:15,603 INFO L226 Difference]: Without dead ends: 89 [2022-11-18 20:02:15,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=255, Invalid=2714, Unknown=1, NotChecked=0, Total=2970 [2022-11-18 20:02:15,604 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:15,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 608 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 281 Invalid, 0 Unknown, 301 Unchecked, 0.2s Time] [2022-11-18 20:02:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-18 20:02:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-18 20:02:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 84 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:02:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-11-18 20:02:15,607 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 59 [2022-11-18 20:02:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:15,608 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-11-18 20:02:15,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (3), 2 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:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-11-18 20:02:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:02:15,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:15,609 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:02:15,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:02:15,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-18 20:02:15,816 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:02:15,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:15,816 INFO L85 PathProgramCache]: Analyzing trace with hash -833520441, now seen corresponding path program 1 times [2022-11-18 20:02:15,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:15,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030146261] [2022-11-18 20:02:15,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:18,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:02:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:02:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:19,547 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:02:19,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:19,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030146261] [2022-11-18 20:02:19,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030146261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:19,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150273162] [2022-11-18 20:02:19,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:19,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:19,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:19,549 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:19,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 20:02:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:19,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-18 20:02:19,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:19,963 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:20,019 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:20,146 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:02:20,146 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:02:20,261 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:20,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:02:21,185 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:02:21,185 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:02:21,196 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:21,209 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:21,214 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:21,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:21,778 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:02:21,778 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:02:21,801 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 20:02:21,801 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:02:21,824 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:02:21,824 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:02:21,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:21,839 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:02:22,748 INFO L321 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-11-18 20:02:22,748 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 79 treesize of output 84 [2022-11-18 20:02:22,771 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:02:22,772 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 48 [2022-11-18 20:02:22,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:02:22,788 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 22 treesize of output 12 [2022-11-18 20:02:22,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:22,928 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:22,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:22,945 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 33 treesize of output 31 [2022-11-18 20:02:22,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:22,997 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:02:23,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:23,004 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 33 treesize of output 31 [2022-11-18 20:02:23,256 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:02:23,257 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 39 treesize of output 38 [2022-11-18 20:02:23,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:23,266 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:23,400 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:02:23,407 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:02:23,532 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:02:23,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:02:23,757 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4815) |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| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4815 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4815) |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:23,776 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_4815 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4815) |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| .cse0 v_ArrVal_4814) |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:23,799 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4814) |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:23,845 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (let ((.cse0 (select (select .cse1 |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| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |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:23,877 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (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 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse0 v_ArrVal_4815) |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_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |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:02:24,510 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)))) (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (let ((.cse1 (select (select .cse2 |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 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse1 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4814) |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:24,558 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)))) (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4813))) (let ((.cse1 (select (select .cse2 |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 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4812) .cse1 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4814) |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:25,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150273162] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:25,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:02:25,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 56 [2022-11-18 20:02:25,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791075195] [2022-11-18 20:02:25,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:02:25,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-18 20:02:25,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:25,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-18 20:02:25,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3507, Unknown=60, NotChecked=882, Total=4692 [2022-11-18 20:02:25,073 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 57 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 49 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:02:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:29,975 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-11-18 20:02:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 20:02:29,976 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 49 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:02:29,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:29,977 INFO L225 Difference]: With dead ends: 112 [2022-11-18 20:02:29,977 INFO L226 Difference]: Without dead ends: 112 [2022-11-18 20:02:29,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=525, Invalid=5915, Unknown=68, NotChecked=1148, Total=7656 [2022-11-18 20:02:29,981 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 538 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:29,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1169 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1903 Invalid, 0 Unknown, 64 Unchecked, 1.8s Time] [2022-11-18 20:02:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-18 20:02:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2022-11-18 20:02:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 86 states have internal predecessors, (92), 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:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-11-18 20:02:29,985 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 59 [2022-11-18 20:02:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:29,986 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-11-18 20:02:29,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 49 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:02:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-11-18 20:02:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-18 20:02:29,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:29,987 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:02:29,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:02:30,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-18 20:02:30,196 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:02:30,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2145741940, now seen corresponding path program 1 times [2022-11-18 20:02:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:30,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849381764] [2022-11-18 20:02:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:33,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:02:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:33,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:02:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:34,716 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:02:34,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:34,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849381764] [2022-11-18 20:02:34,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849381764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:34,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439073361] [2022-11-18 20:02:34,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:34,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:34,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:34,730 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:34,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-18 20:02:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:35,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 153 conjunts are in the unsatisfiable core [2022-11-18 20:02:35,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:35,243 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:35,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:02:35,514 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2022-11-18 20:02:35,516 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2022-11-18 20:02:35,545 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_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2022-11-18 20:02:35,547 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_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2022-11-18 20:02:35,603 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:35,606 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:35,650 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:35,654 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:35,817 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:02:35,828 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) (+ 8 |c_node_create_~temp~0#1.offset|))) (= |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) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:35,831 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) (+ 8 |c_node_create_~temp~0#1.offset|))) (= |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) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:35,882 WARN L837 $PredicateComparison]: unable to prove that (and (= |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) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:35,885 WARN L859 $PredicateComparison]: unable to prove that (and (= |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) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:36,027 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |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_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:36,031 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |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_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:36,118 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~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|) (= |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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:36,123 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~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|) (= |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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:36,152 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 19 treesize of output 18 [2022-11-18 20:02:36,404 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:02:36,404 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 14 treesize of output 20 [2022-11-18 20:02:36,418 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:36,447 WARN L837 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (< |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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:36,452 WARN L859 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (< |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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:36,553 WARN L837 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (< |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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:36,558 WARN L859 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (< |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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:36,716 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:02:36,717 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 24 [2022-11-18 20:02:36,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:36,788 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 25 treesize of output 24 [2022-11-18 20:02:36,798 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:02:36,862 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 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) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse0)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))))) is different from false [2022-11-18 20:02:36,867 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 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) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse0)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))))) is different from true [2022-11-18 20:02:36,968 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (< |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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))) is different from false [2022-11-18 20:02:36,972 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (< |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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))) is different from true [2022-11-18 20:02:37,078 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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 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) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 8)) (= .cse1 .cse0)) (= |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_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse1) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from false [2022-11-18 20:02:37,082 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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 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) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 8)) (= .cse1 .cse0)) (= |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_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse1) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from true [2022-11-18 20:02:37,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:02:37,130 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 70 treesize of output 33 [2022-11-18 20:02:37,140 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 11 treesize of output 7 [2022-11-18 20:02:37,149 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:37,229 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:37,233 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:37,315 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)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:37,319 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)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:37,456 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:37,460 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:37,530 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|))) is different from false [2022-11-18 20:02:37,534 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:02:37,621 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:37,626 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:37,700 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|))) is different from false [2022-11-18 20:02:37,704 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:02:37,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:37,806 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:37,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:37,857 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:02:37,857 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 108 treesize of output 90 [2022-11-18 20:02:37,929 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 20:02:37,930 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 34 treesize of output 44 [2022-11-18 20:02:37,939 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:38,094 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 ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse3))) (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse4) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from false [2022-11-18 20:02:38,099 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 ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse3))) (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .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_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse4) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from true [2022-11-18 20:02:38,346 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-18 20:02:38,353 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-18 20:02:39,088 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (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|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |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|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-18 20:02:39,095 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (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|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |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|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-18 20:02:39,327 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (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))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-18 20:02:39,332 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (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))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-18 20:02:39,580 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |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))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-18 20:02:39,585 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |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))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-18 20:02:39,732 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-18 20:02:39,732 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 169 treesize of output 142 [2022-11-18 20:02:39,762 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:02:39,763 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 53 [2022-11-18 20:02:39,792 INFO L321 Elim1Store]: treesize reduction 31, result has 48.3 percent of original size [2022-11-18 20:02:39,792 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 53 treesize of output 75 [2022-11-18 20:02:39,820 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:40,004 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-18 20:02:40,009 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-18 20:02:40,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:40,125 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:02:40,126 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 134 treesize of output 108 [2022-11-18 20:02:40,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:40,234 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:40,289 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 20:02:40,289 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 41 treesize of output 51 [2022-11-18 20:02:40,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:40,673 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:02:40,673 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 134 treesize of output 108 [2022-11-18 20:02:40,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:40,704 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 41 treesize of output 43 [2022-11-18 20:02:40,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:40,733 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:41,094 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |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_main_~data~0#1| 1) (= |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) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))))))) is different from false [2022-11-18 20:02:41,100 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |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_main_~data~0#1| 1) (= |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) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))))))) is different from true [2022-11-18 20:02:41,689 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)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse8) (or (= .cse8 0) (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-18 20:02:41,695 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)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse8) (or (= .cse8 0) (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-18 20:02:41,824 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:02:41,825 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 146 treesize of output 115 [2022-11-18 20:02:41,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:41,879 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 33 treesize of output 28 [2022-11-18 20:02:41,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:41,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 24 treesize of output 26 [2022-11-18 20:02:41,937 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 28 treesize of output 22 [2022-11-18 20:02:42,219 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 ((.cse0 (+ 2 .cse3))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= (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_main_~data~0#1| 1)))) is different from false [2022-11-18 20:02:42,226 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 ((.cse0 (+ 2 .cse3))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= (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_main_~data~0#1| 1)))) is different from true [2022-11-18 20:02:42,809 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 67 treesize of output 39 [2022-11-18 20:02:42,833 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:02:43,192 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem16#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem16#1.base| 2)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-18 20:02:43,199 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem16#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem16#1.base| 2)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-18 20:02:43,495 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-18 20:02:43,501 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-18 20:02:43,564 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:02:43,631 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:43,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:02:44,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (or (= |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) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140)) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5141) |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_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) is different from false [2022-11-18 20:02:44,472 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= |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_5131) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (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 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5133) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5137))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse3 .cse2 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse0 .cse2 v_ArrVal_5142) |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:44,497 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5131) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (let ((.cse1 (select (select .cse2 |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_5133) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5137))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse2 .cse1 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse3 .cse1 v_ArrVal_5142) |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~mem14#1.offset_9| (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) is different from false [2022-11-18 20:02:44,952 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (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 ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5131) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse1 (store (store |c_#memory_int| .cse3 v_ArrVal_5133) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5137))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse4 .cse2 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse0 .cse2 v_ArrVal_5142) |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:02:45,016 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (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 ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5139))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5131) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5138))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse1 (store (store |c_#memory_int| .cse3 v_ArrVal_5133) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5137))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse4 .cse2 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse0 .cse2 v_ArrVal_5142) |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:45,169 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int)) (v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5156 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5158 (Array Int Int)) (v_ArrVal_5157 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5157)) (.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5156))) (let ((.cse2 (select (select .cse5 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store .cse6 .cse2 v_ArrVal_5132) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5139))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27|) 0)) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store .cse5 .cse2 v_ArrVal_5131) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5138))) (let ((.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 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5158) .cse2 v_ArrVal_5133) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5137))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse3 .cse1 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse4 .cse1 v_ArrVal_5142) |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~mem14#1.offset_9| (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))))) is different from false [2022-11-18 20:02:45,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439073361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:45,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:02:45,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 69 [2022-11-18 20:02:45,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962720856] [2022-11-18 20:02:45,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:02:45,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-18 20:02:45,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:45,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-18 20:02:45,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1750, Unknown=157, NotChecked=4356, Total=6480 [2022-11-18 20:02:45,176 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 69 states, 65 states have (on average 1.6) internal successors, (104), 59 states have internal predecessors, (104), 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:45,959 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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |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|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2022-11-18 20:02:45,962 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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |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|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2022-11-18 20:02:45,967 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_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2022-11-18 20:02:45,969 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_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2022-11-18 20:02:45,974 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)|) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:45,977 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)|) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:45,982 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_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:45,986 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_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:45,990 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-18 20:02:45,994 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:02:46,000 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ 8 |c_node_create_~temp~0#1.offset|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-18 20:02:46,003 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ 8 |c_node_create_~temp~0#1.offset|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:02:46,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse3 (select |c_#memory_$Pointer$.offset| .cse3)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse4 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse3) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select .cse4 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= (select .cse4 (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from false [2022-11-18 20:02:46,035 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse3 (select |c_#memory_$Pointer$.offset| .cse3)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse4 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse3) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select .cse4 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= (select .cse4 (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from true [2022-11-18 20:02:46,050 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |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_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |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|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (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:46,055 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |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_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |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|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (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:46,070 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |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) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 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) (= |c_ULTIMATE.start_main_~data~0#1| 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_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (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:46,075 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |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) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 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) (= |c_ULTIMATE.start_main_~data~0#1| 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_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (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:46,093 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (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 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not .cse0))) is different from false [2022-11-18 20:02:46,100 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (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 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not .cse0))) is different from true [2022-11-18 20:02:46,122 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (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 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (not .cse0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) .cse1)) is different from false [2022-11-18 20:02:46,126 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (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 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (not .cse0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) .cse1)) is different from true [2022-11-18 20:02:46,140 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (let ((.cse0 (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (or .cse0 .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (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_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse2)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) .cse1))) is different from false [2022-11-18 20:02:46,145 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (let ((.cse0 (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (or .cse0 .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (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_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse2)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) .cse1))) is different from true [2022-11-18 20:02:46,166 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8))) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not .cse1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (< |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|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from false [2022-11-18 20:02:46,171 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8))) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not .cse1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (< |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|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from true [2022-11-18 20:02:46,187 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 ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 8))) (.cse1 (= .cse3 .cse2))) (and .cse0 (< |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) (or .cse0 .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse2 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not .cse1) (not (= (select |c_#valid| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse2 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))))) is different from false [2022-11-18 20:02:46,191 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 ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 8))) (.cse1 (= .cse3 .cse2))) (and .cse0 (< |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) (or .cse0 .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse2 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not .cse1) (not (= (select |c_#valid| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse2 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))))) is different from true [2022-11-18 20:02:46,209 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:46,213 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:46,227 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)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-18 20:02:46,231 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)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-18 20:02:46,247 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-18 20:02:46,251 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:02:46,268 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|)) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-18 20:02:46,272 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|)) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:02:46,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= .cse2 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-18 20:02:46,299 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= .cse2 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:02:46,380 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from false [2022-11-18 20:02:46,392 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from true [2022-11-18 20:02:46,460 WARN L837 $PredicateComparison]: unable to prove that (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|)) (.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 (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.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|) 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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse2 |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_~head#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse5) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 8)) (= .cse5 .cse4) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (not (= .cse1 .cse6)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |v_#valid_BEFORE_CALL_31| .cse9))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from false [2022-11-18 20:02:46,466 WARN L859 $PredicateComparison]: unable to prove that (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|)) (.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 (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.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|) 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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse2 |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_~head#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse5) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 8)) (= .cse5 .cse4) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (not (= .cse1 .cse6)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |v_#valid_BEFORE_CALL_31| .cse9))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from true [2022-11-18 20:02:46,518 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.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)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (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) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (not (= .cse5 .cse6)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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:46,523 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.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)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (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) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (not (= .cse5 .cse6)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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:46,571 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 ((.cse0 (+ 2 .cse8)) (.cse6 (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))) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.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|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse6 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (= .cse9 .cse8) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse10 (select |v_#valid_BEFORE_CALL_28| .cse10)))) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse9) 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:46,578 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 ((.cse0 (+ 2 .cse8)) (.cse6 (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))) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.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|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse6 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (= .cse9 .cse8) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse10 (select |v_#valid_BEFORE_CALL_28| .cse10)))) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse9) 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:46,626 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)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.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|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (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|)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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:46,632 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)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.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|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (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|)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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:46,676 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)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse5) (+ (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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:46,682 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)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse5) (+ (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 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:46,736 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |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_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |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:46,743 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |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_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |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:46,778 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |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:46,784 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |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) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |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:46,832 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1)) (.cse8 (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 (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |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_main_~data~0#1| 1) (= |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) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (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:46,837 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1)) (.cse8 (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 (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |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_main_~data~0#1| 1) (= |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) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (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:46,875 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.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)) (.cse2 (= .cse9 0)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse9) (or .cse2 (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-18 20:02:46,880 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.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)) (.cse2 (= .cse9 0)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse9) (or .cse2 (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-18 20:02:46,958 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2022-11-18 20:02:46,963 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2022-11-18 20:02:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:47,261 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2022-11-18 20:02:47,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-18 20:02:47,262 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 65 states have (on average 1.6) internal successors, (104), 59 states have internal predecessors, (104), 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 61 [2022-11-18 20:02:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:47,263 INFO L225 Difference]: With dead ends: 107 [2022-11-18 20:02:47,263 INFO L226 Difference]: Without dead ends: 107 [2022-11-18 20:02:47,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 66 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=315, Invalid=2078, Unknown=223, NotChecked=10494, Total=13110 [2022-11-18 20:02:47,268 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1877 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:47,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 780 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 506 Invalid, 0 Unknown, 1877 Unchecked, 0.5s Time] [2022-11-18 20:02:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-18 20:02:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-18 20:02:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 100 states have internal predecessors, (105), 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:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-11-18 20:02:47,272 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 61 [2022-11-18 20:02:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:47,272 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-11-18 20:02:47,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 65 states have (on average 1.6) internal successors, (104), 59 states have internal predecessors, (104), 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:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-11-18 20:02:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-18 20:02:47,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:47,274 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] [2022-11-18 20:02:47,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-18 20:02:47,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:47,482 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:02:47,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:47,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1799557417, now seen corresponding path program 1 times [2022-11-18 20:02:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:47,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246162427] [2022-11-18 20:02:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:02:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:47,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:02:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-18 20:02:47,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:47,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246162427] [2022-11-18 20:02:47,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246162427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:47,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:47,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:02:47,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262767460] [2022-11-18 20:02:47,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:47,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:02:47,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:47,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:02:47,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:02:47,652 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:02:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:47,861 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2022-11-18 20:02:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:02:47,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-11-18 20:02:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:47,862 INFO L225 Difference]: With dead ends: 125 [2022-11-18 20:02:47,862 INFO L226 Difference]: Without dead ends: 125 [2022-11-18 20:02:47,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:02:47,863 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 51 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:47,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 304 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-18 20:02:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2022-11-18 20:02:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2682926829268293) 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:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2022-11-18 20:02:47,868 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 64 [2022-11-18 20:02:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:47,868 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2022-11-18 20:02:47,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:02:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-11-18 20:02:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-18 20:02:47,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:47,870 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] [2022-11-18 20:02:47,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-18 20:02:47,870 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:02:47,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:47,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1799557418, now seen corresponding path program 1 times [2022-11-18 20:02:47,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:47,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450374429] [2022-11-18 20:02:47,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:47,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:48,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:02:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:02:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-18 20:02:48,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:48,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450374429] [2022-11-18 20:02:48,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450374429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:48,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:48,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:02:48,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401245407] [2022-11-18 20:02:48,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:48,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:02:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:48,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:02:48,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:02:48,215 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:02:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:48,496 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-11-18 20:02:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:02:48,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-11-18 20:02:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:48,498 INFO L225 Difference]: With dead ends: 106 [2022-11-18 20:02:48,498 INFO L226 Difference]: Without dead ends: 106 [2022-11-18 20:02:48,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:02:48,499 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 50 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:48,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 312 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-18 20:02:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2022-11-18 20:02:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 98 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:02:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2022-11-18 20:02:48,505 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 64 [2022-11-18 20:02:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:48,505 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2022-11-18 20:02:48,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:02:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-11-18 20:02:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-18 20:02:48,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:48,507 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:48,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-18 20:02:48,507 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:02:48,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1497139761, now seen corresponding path program 1 times [2022-11-18 20:02:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:48,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917393478] [2022-11-18 20:02:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:53,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:53,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:02:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:02:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:02:54,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:54,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917393478] [2022-11-18 20:02:54,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917393478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:54,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596398515] [2022-11-18 20:02:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:54,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:54,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:54,829 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:54,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-18 20:02:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:55,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-18 20:02:55,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:55,967 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:56,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 6 treesize of output 5 [2022-11-18 20:02:56,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:56,514 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:02:56,834 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:02:56,834 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:02:57,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:57,043 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 20:02:57,043 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:02:57,051 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:57,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:57,218 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 25 treesize of output 20 [2022-11-18 20:02:57,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:57,554 INFO L321 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-11-18 20:02:57,555 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 80 treesize of output 61 [2022-11-18 20:02:57,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:57,563 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 75 [2022-11-18 20:02:58,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:58,474 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 0 case distinctions, treesize of input 100 treesize of output 71 [2022-11-18 20:02:58,698 INFO L321 Elim1Store]: treesize reduction 53, result has 18.5 percent of original size [2022-11-18 20:02:58,698 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 94 treesize of output 48 [2022-11-18 20:02:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:02:58,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:58,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596398515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:58,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:02:58,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [38] total 63 [2022-11-18 20:02:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323312430] [2022-11-18 20:02:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:58,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:02:58,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:58,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:02:58,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3828, Unknown=1, NotChecked=0, Total=4032 [2022-11-18 20:02:58,813 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:03:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:01,069 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2022-11-18 20:03:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 20:03:01,070 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-11-18 20:03:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:01,071 INFO L225 Difference]: With dead ends: 129 [2022-11-18 20:03:01,071 INFO L226 Difference]: Without dead ends: 129 [2022-11-18 20:03:01,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=300, Invalid=5399, Unknown=1, NotChecked=0, Total=5700 [2022-11-18 20:03:01,072 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 77 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:01,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 814 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 871 Invalid, 0 Unknown, 211 Unchecked, 0.8s Time] [2022-11-18 20:03:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-18 20:03:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2022-11-18 20:03:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.264367816091954) internal successors, (110), 103 states have internal predecessors, (110), 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:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2022-11-18 20:03:01,076 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 66 [2022-11-18 20:03:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:01,077 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2022-11-18 20:03:01,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:03:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2022-11-18 20:03:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-18 20:03:01,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:01,078 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:03:01,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:01,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:01,282 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:03:01,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:01,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1497139760, now seen corresponding path program 1 times [2022-11-18 20:03:01,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:01,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228924956] [2022-11-18 20:03:01,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:08,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:03:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:03:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:03:10,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:10,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228924956] [2022-11-18 20:03:10,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228924956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:10,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724549689] [2022-11-18 20:03:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:10,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:10,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:10,057 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:10,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-18 20:03:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:10,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-18 20:03:10,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:10,620 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:11,171 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:11,176 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:11,620 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:03:11,620 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:11,641 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:12,001 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:12,013 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:12,286 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:03:12,286 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:03:12,304 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:12,725 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:03:12,725 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:03:12,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:12,751 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:12,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:12,919 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:12,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:12,930 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:03:13,563 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:03:13,563 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 100 treesize of output 39 [2022-11-18 20:03:13,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:13,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:03:13,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:13,584 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:14,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:14,490 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:03:14,490 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 110 treesize of output 80 [2022-11-18 20:03:14,526 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 20:03:14,527 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:14,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:14,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:14,549 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 25 treesize of output 30 [2022-11-18 20:03:14,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:03:16,014 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-18 20:03:16,014 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 142 treesize of output 111 [2022-11-18 20:03:16,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:16,060 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-18 20:03:16,061 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 39 treesize of output 45 [2022-11-18 20:03:16,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:16,123 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:03:16,124 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 108 treesize of output 78 [2022-11-18 20:03:16,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:16,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:16,150 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 25 treesize of output 30 [2022-11-18 20:03:16,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:16,259 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:03:16,260 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 108 treesize of output 78 [2022-11-18 20:03:16,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:16,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:16,287 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 25 treesize of output 30 [2022-11-18 20:03:16,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:16,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:03:16,732 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:03:16,733 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 132 treesize of output 84 [2022-11-18 20:03:16,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:16,760 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-18 20:03:16,760 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 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-18 20:03:17,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:17,506 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 20:03:17,506 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 1 case distinctions, treesize of input 49 treesize of output 27 [2022-11-18 20:03:17,899 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:03:17,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 26 [2022-11-18 20:03:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:03:18,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:03:19,858 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6098 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_6102)))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_6103)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse2)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6098 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (+ (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (store .cse13 .cse10 (store (select .cse13 .cse10) .cse11 v_ArrVal_6102)))) (let ((.cse12 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (<= 0 (+ 8 (select (select .cse8 (select (select (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse12)))) (not (<= 0 .cse12))))))))) is different from false [2022-11-18 20:03:19,939 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse1 (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_ArrVal_6102)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6103 Int)) (<= 0 (+ 8 (select (select .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse12 (+ (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 v_ArrVal_6102)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse6)) (forall ((v_ArrVal_6103 Int)) (let ((.cse9 (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_ArrVal_6103)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse7 .cse8) .cse6)) (select |c_#length| (select (select .cse9 .cse8) .cse6))))))))))))) is different from false [2022-11-18 20:03:19,979 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_6102)))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4) 8))) (not (<= 0 .cse4)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse12 (+ (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 v_ArrVal_6102)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse6)) (forall ((v_ArrVal_6103 Int)) (let ((.cse9 (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_ArrVal_6103)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse7 .cse8) .cse6) 12) (select |c_#length| (select (select .cse9 .cse8) .cse6))))))))))))) is different from false [2022-11-18 20:03:20,024 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (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)))) (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse4 (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ 4 (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_6102)))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_6103)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 12) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse2)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse11 (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (+ 4 (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse10 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse13 v_ArrVal_6102)))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse9)) (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse10 (select (select (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse9) 8))))))))))) is different from false [2022-11-18 20:03:20,080 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (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)))) (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_6102)))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4) 8))) (not (<= 0 .cse4)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse11 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (+ (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse13 v_ArrVal_6102)))) (let ((.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (let ((.cse10 (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_6103)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse7 .cse8) .cse9) 12) (select |c_#length| (select (select .cse10 .cse8) .cse9)))))) (not (<= 0 .cse9)))))))))) is different from false [2022-11-18 20:03:20,179 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (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)))) (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6099)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6098))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse1 (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_ArrVal_6102)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0) 8))))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6099)) (.cse11 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6098))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (+ (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse13 v_ArrVal_6102)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_6103 Int)) (let ((.cse10 (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_6103)))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse8 .cse9) .cse7) 12) (select |c_#length| (select (select .cse10 .cse9) .cse7)))))))))))))) is different from false [2022-11-18 20:03:21,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724549689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:21,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:03:21,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36] total 75 [2022-11-18 20:03:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116032941] [2022-11-18 20:03:21,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:03:21,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-18 20:03:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-18 20:03:21,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=6695, Unknown=13, NotChecked=1014, Total=8010 [2022-11-18 20:03:21,243 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 76 states, 71 states have (on average 1.676056338028169) internal successors, (119), 67 states have internal predecessors, (119), 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:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:31,395 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2022-11-18 20:03:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-18 20:03:31,396 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 71 states have (on average 1.676056338028169) internal successors, (119), 67 states have internal predecessors, (119), 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 66 [2022-11-18 20:03:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:31,397 INFO L225 Difference]: With dead ends: 182 [2022-11-18 20:03:31,397 INFO L226 Difference]: Without dead ends: 182 [2022-11-18 20:03:31,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=717, Invalid=11949, Unknown=14, NotChecked=1362, Total=14042 [2022-11-18 20:03:31,399 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1195 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:31,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1284 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2439 Invalid, 0 Unknown, 277 Unchecked, 2.5s Time] [2022-11-18 20:03:31,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-18 20:03:31,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 113. [2022-11-18 20:03:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 106 states have internal predecessors, (114), 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:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2022-11-18 20:03:31,404 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 66 [2022-11-18 20:03:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:31,404 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2022-11-18 20:03:31,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 71 states have (on average 1.676056338028169) internal successors, (119), 67 states have internal predecessors, (119), 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:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-11-18 20:03:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-18 20:03:31,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:31,405 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:03:31,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:31,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:31,613 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:03:31,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:31,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1497139726, now seen corresponding path program 1 times [2022-11-18 20:03:31,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:31,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756469156] [2022-11-18 20:03:31,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:31,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:03:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:03:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:03:36,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:36,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756469156] [2022-11-18 20:03:36,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756469156] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:36,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160771420] [2022-11-18 20:03:36,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:36,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:36,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:36,894 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:36,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-18 20:03:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:37,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-18 20:03:37,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:37,397 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:37,460 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:37,664 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:03:37,664 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:37,872 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:38,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:38,109 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:03:38,109 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:03:38,346 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:38,526 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:03:38,527 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:03:38,828 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:03:38,828 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:03:38,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:38,853 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:03:39,291 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:03:39,291 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:03:39,298 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:39,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:39,304 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:39,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:39,911 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:39,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:39,935 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:03:39,935 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:03:39,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:39,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:39,968 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 20:03:39,968 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:03:40,952 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-18 20:03:40,953 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 136 treesize of output 107 [2022-11-18 20:03:40,978 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:03:40,978 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:03:41,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:41,180 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:03:41,181 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 102 treesize of output 74 [2022-11-18 20:03:41,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:41,197 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 33 treesize of output 33 [2022-11-18 20:03:41,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:41,290 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:03:41,290 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 102 treesize of output 74 [2022-11-18 20:03:41,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:41,309 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 33 treesize of output 33 [2022-11-18 20:03:41,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:41,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:03:41,690 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-18 20:03:41,691 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 68 [2022-11-18 20:03:41,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:41,705 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:03:42,479 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-18 20:03:42,479 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 66 treesize of output 28 [2022-11-18 20:03:42,485 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:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:03:42,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:03:42,771 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6418 Int)) (= 1 (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) v_ArrVal_6418)))) (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_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-18 20:03:42,780 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6418 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) v_ArrVal_6418)))) (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_6420) |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:03:42,798 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |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:03:42,825 INFO L321 Elim1Store]: treesize reduction 5, result has 96.5 percent of original size [2022-11-18 20:03:42,825 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 147 treesize of output 146 [2022-11-18 20:03:42,835 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) is different from false [2022-11-18 20:03:42,846 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|)) is different from false [2022-11-18 20:03:42,861 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (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)))) (= .cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse1 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse4 .cse3 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-18 20:03:42,873 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (let ((.cse4 (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 (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 4 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) .cse4))) is different from false [2022-11-18 20:03:42,898 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (let ((.cse4 (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 (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) .cse4))) is different from false [2022-11-18 20:03:43,000 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6430 (Array Int Int)) (v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6429 (Array Int Int)) (v_ArrVal_6417 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| |c_#StackHeapBarrier|)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6429)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6430))) (let ((.cse5 (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 .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (= (let ((.cse1 (store (store .cse6 .cse5 v_ArrVal_6412) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6416))) (let ((.cse3 (store (store .cse4 .cse5 v_ArrVal_6413) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) .cse5))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34|) 0)))) is different from false [2022-11-18 20:03:43,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160771420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:43,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:03:43,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 35] total 71 [2022-11-18 20:03:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306525216] [2022-11-18 20:03:43,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:03:43,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-18 20:03:43,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-18 20:03:43,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=5288, Unknown=15, NotChecked=1386, Total=6972 [2022-11-18 20:03:43,005 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 72 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 63 states have internal predecessors, (116), 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:03:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:49,646 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2022-11-18 20:03:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-18 20:03:49,646 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 63 states have internal predecessors, (116), 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 66 [2022-11-18 20:03:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:49,649 INFO L225 Difference]: With dead ends: 163 [2022-11-18 20:03:49,650 INFO L226 Difference]: Without dead ends: 163 [2022-11-18 20:03:49,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2718 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=647, Invalid=9473, Unknown=16, NotChecked=1854, Total=11990 [2022-11-18 20:03:49,652 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 775 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 2659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:49,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1461 Invalid, 2659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2428 Invalid, 0 Unknown, 170 Unchecked, 2.1s Time] [2022-11-18 20:03:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-18 20:03:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 113. [2022-11-18 20:03:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 106 states have internal predecessors, (113), 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:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2022-11-18 20:03:49,656 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 66 [2022-11-18 20:03:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:49,657 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2022-11-18 20:03:49,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 63 states have internal predecessors, (116), 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:03:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-11-18 20:03:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-18 20:03:49,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:49,658 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, 1, 1] [2022-11-18 20:03:49,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-18 20:03:49,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:49,865 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:03:49,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash 62737026, now seen corresponding path program 1 times [2022-11-18 20:03:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:49,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111764965] [2022-11-18 20:03:49,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:49,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:53,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:53,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:03:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:54,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:03:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:03:55,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:55,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111764965] [2022-11-18 20:03:55,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111764965] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:55,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227317617] [2022-11-18 20:03:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:55,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:55,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:55,358 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:55,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-18 20:03:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:55,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 142 conjunts are in the unsatisfiable core [2022-11-18 20:03:55,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:55,917 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:55,998 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:56,249 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:03:56,249 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:56,460 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:56,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:56,716 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:03:56,716 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:03:57,002 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:57,210 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:03:57,210 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:03:57,539 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:03:57,539 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:03:57,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:57,582 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:03:58,077 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:03:58,077 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:03:58,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:58,086 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:58,090 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:58,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:58,853 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:03:58,853 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:03:58,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:58,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:58,885 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 20:03:58,886 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:03:58,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:58,897 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:04:00,001 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-18 20:04:00,001 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 117 treesize of output 94 [2022-11-18 20:04:00,040 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:04:00,040 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 31 [2022-11-18 20:04:00,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:00,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 14 treesize of output 16 [2022-11-18 20:04:00,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:00,099 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:04:00,099 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 83 treesize of output 61 [2022-11-18 20:04:00,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:00,161 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:04:00,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:00,179 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:04:00,179 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 83 treesize of output 61 [2022-11-18 20:04:00,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:00,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:04:00,439 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:04:00,439 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 112 treesize of output 68 [2022-11-18 20:04:00,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:00,451 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 110 treesize of output 104 [2022-11-18 20:04:01,477 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 97 treesize of output 73 [2022-11-18 20:04:01,671 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:04:01,672 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 109 treesize of output 36 [2022-11-18 20:04:01,681 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:04:01,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:04:02,611 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6734 (Array Int 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 ((.cse0 (let ((.cse3 (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) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4))))))) is different from false [2022-11-18 20:04:02,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int))) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))))) is different from false [2022-11-18 20:04:02,652 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))))) is different from false [2022-11-18 20:04:02,664 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))))) is different from false [2022-11-18 20:04:02,682 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse6 (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 ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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| .cse6 v_ArrVal_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (select (select .cse2 |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 .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4))))))))) is different from false [2022-11-18 20:04:02,696 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse6 (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 ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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| .cse6 v_ArrVal_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (select (select .cse2 |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 .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1)))))))) is different from false [2022-11-18 20:04:02,723 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse6 (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 ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |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| .cse6 v_ArrVal_6727) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |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~ret9#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1)))))))) is different from false [2022-11-18 20:04:03,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227317617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:04:03,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:04:03,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 35] total 75 [2022-11-18 20:04:03,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448097844] [2022-11-18 20:04:03,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:04:03,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-18 20:04:03,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:04:03,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-18 20:04:03,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=6517, Unknown=35, NotChecked=1176, Total=8010 [2022-11-18 20:04:03,154 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 75 states, 71 states have (on average 1.676056338028169) internal successors, (119), 66 states have internal predecessors, (119), 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:04:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:10,200 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-11-18 20:04:10,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-18 20:04:10,201 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 71 states have (on average 1.676056338028169) internal successors, (119), 66 states have internal predecessors, (119), 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 68 [2022-11-18 20:04:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:10,202 INFO L225 Difference]: With dead ends: 112 [2022-11-18 20:04:10,202 INFO L226 Difference]: Without dead ends: 112 [2022-11-18 20:04:10,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2581 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=582, Invalid=10966, Unknown=36, NotChecked=1526, Total=13110 [2022-11-18 20:04:10,204 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 125 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:10,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1732 Invalid, 2235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2099 Invalid, 0 Unknown, 95 Unchecked, 2.0s Time] [2022-11-18 20:04:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-18 20:04:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-18 20:04:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.247191011235955) internal successors, (111), 105 states have internal predecessors, (111), 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:04:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2022-11-18 20:04:10,208 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 68 [2022-11-18 20:04:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:10,208 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2022-11-18 20:04:10,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 71 states have (on average 1.676056338028169) internal successors, (119), 66 states have internal predecessors, (119), 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:04:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2022-11-18 20:04:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-18 20:04:10,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:10,209 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, 1] [2022-11-18 20:04:10,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:10,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-18 20:04:10,416 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:04:10,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash 62769824, now seen corresponding path program 1 times [2022-11-18 20:04:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:04:10,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921064556] [2022-11-18 20:04:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:04:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:15,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:04:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:04:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:04:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:17,434 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:04:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:04:17,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921064556] [2022-11-18 20:04:17,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921064556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:04:17,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006710244] [2022-11-18 20:04:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:17,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:04:17,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:04:17,436 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:04:17,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-18 20:04:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:17,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 219 conjunts are in the unsatisfiable core [2022-11-18 20:04:17,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:18,083 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:04:18,173 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:04:18,558 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:04:18,562 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:04:18,652 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:04:19,381 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:04:19,381 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 14 treesize of output 20 [2022-11-18 20:04:19,391 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:04:19,414 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:04:19,415 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:04:19,820 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:04:19,835 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:04:19,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:04:20,166 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:04:20,167 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 84 treesize of output 73 [2022-11-18 20:04:20,203 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:04:20,217 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 31 treesize of output 26 [2022-11-18 20:04:20,727 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:04:20,727 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 14 treesize of output 20 [2022-11-18 20:04:20,732 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:04:20,768 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:04:20,768 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 51 treesize of output 45 [2022-11-18 20:04:20,776 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 23 treesize of output 22 [2022-11-18 20:04:20,964 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:04:20,989 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 55 treesize of output 38 [2022-11-18 20:04:20,996 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 20 treesize of output 22 [2022-11-18 20:04:21,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:04:21,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:21,747 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:04:21,747 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 168 treesize of output 65 [2022-11-18 20:04:21,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:21,763 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:04:21,763 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2022-11-18 20:04:21,770 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:04:21,775 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:04:21,780 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:04:22,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:22,761 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:04:22,761 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 176 treesize of output 142 [2022-11-18 20:04:22,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:22,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:22,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:22,779 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 163 treesize of output 144 [2022-11-18 20:04:22,805 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-18 20:04:22,805 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 28 treesize of output 48 [2022-11-18 20:04:22,815 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:04:22,845 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-18 20:04:22,845 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 34 treesize of output 36 [2022-11-18 20:04:22,891 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 16 treesize of output 18 [2022-11-18 20:04:24,811 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-18 20:04:24,812 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 261 treesize of output 212 [2022-11-18 20:04:24,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:24,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:04:24,846 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-18 20:04:24,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 229 treesize of output 199 [2022-11-18 20:04:24,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:04:24,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:24,861 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 75 treesize of output 60 [2022-11-18 20:04:25,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:25,124 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:04:25,124 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 174 treesize of output 140 [2022-11-18 20:04:25,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:25,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:25,137 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 162 treesize of output 143 [2022-11-18 20:04:25,174 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 28 treesize of output 30 [2022-11-18 20:04:25,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:25,322 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:04:25,323 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 174 treesize of output 140 [2022-11-18 20:04:25,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:25,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:25,338 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 162 treesize of output 143 [2022-11-18 20:04:25,347 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 28 treesize of output 30 [2022-11-18 20:04:25,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:25,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:04:25,819 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:04:25,819 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 228 treesize of output 119 [2022-11-18 20:04:25,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:25,841 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-18 20:04:25,842 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 2 case distinctions, treesize of input 199 treesize of output 149 [2022-11-18 20:04:25,853 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 30 treesize of output 32 [2022-11-18 20:04:26,903 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 17 treesize of output 9 [2022-11-18 20:04:28,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:28,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:04:28,150 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:04:28,151 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 233 treesize of output 92 [2022-11-18 20:04:28,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:28,165 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:04:28,166 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 27 [2022-11-18 20:04:28,444 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:04:28,569 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:04:28,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:04:49,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006710244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:04:49,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:04:49,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 40] total 77 [2022-11-18 20:04:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868375200] [2022-11-18 20:04:49,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:04:49,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-18 20:04:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:04:49,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-18 20:04:49,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=8369, Unknown=19, NotChecked=0, Total=8742 [2022-11-18 20:04:49,961 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 77 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 69 states have internal predecessors, (118), 6 states have call successors, (6), 3 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:05:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:05:05,072 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2022-11-18 20:05:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-18 20:05:05,073 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 69 states have internal predecessors, (118), 6 states have call successors, (6), 3 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 68 [2022-11-18 20:05:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:05:05,074 INFO L225 Difference]: With dead ends: 112 [2022-11-18 20:05:05,074 INFO L226 Difference]: Without dead ends: 112 [2022-11-18 20:05:05,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2696 ImplicationChecksByTransitivity, 42.0s TimeCoverageRelationStatistics Valid=733, Invalid=14008, Unknown=21, NotChecked=0, Total=14762 [2022-11-18 20:05:05,076 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 70 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:05:05,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1926 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2343 Invalid, 0 Unknown, 352 Unchecked, 3.2s Time] [2022-11-18 20:05:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-18 20:05:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-18 20:05:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 105 states have internal predecessors, (110), 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:05:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2022-11-18 20:05:05,080 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 68 [2022-11-18 20:05:05,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:05:05,080 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2022-11-18 20:05:05,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 69 states have internal predecessors, (118), 6 states have call successors, (6), 3 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:05:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2022-11-18 20:05:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-18 20:05:05,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:05:05,081 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, 1, 1] [2022-11-18 20:05:05,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-18 20:05:05,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-18 20:05:05,289 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:05:05,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:05:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2089489187, now seen corresponding path program 1 times [2022-11-18 20:05:05,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:05:05,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641913097] [2022-11-18 20:05:05,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:05,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:05:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:13,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:05:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:14,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:05:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:14,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:05:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:05:15,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:05:15,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641913097] [2022-11-18 20:05:15,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641913097] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:05:15,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469999753] [2022-11-18 20:05:15,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:15,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:05:15,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:05:15,235 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:05:15,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dedfd83-c431-4802-ae51-17670ba2bcb2/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-18 20:05:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:15,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-18 20:05:15,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:05:15,782 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:05:15,880 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:05:16,167 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:05:16,167 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:05:16,403 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:05:16,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:16,629 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:05:17,248 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:05:17,355 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:05:18,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:18,063 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:05:18,518 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:05:18,519 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:05:18,524 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 6 treesize of output 5 [2022-11-18 20:05:18,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:18,802 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 20:05:18,802 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:05:18,811 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:05:18,820 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 6 treesize of output 5 [2022-11-18 20:05:18,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:18,862 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:05:18,874 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 6 treesize of output 5 [2022-11-18 20:05:19,085 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-18 20:05:19,085 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 45 treesize of output 35 [2022-11-18 20:05:19,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:19,093 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 49 treesize of output 49 [2022-11-18 20:05:19,435 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 46 treesize of output 34 [2022-11-18 20:05:19,641 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-18 20:05:19,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 22 [2022-11-18 20:05:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:05:19,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:05:20,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7389 (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_7389) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-11-18 20:05:20,349 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7389 (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_7389) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 1)) is different from false [2022-11-18 20:05:20,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7386 (Array Int Int)) (v_ArrVal_7389 (Array Int Int)) (v_ArrVal_7385 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7385))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7386)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |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 .cse3 .cse2 v_ArrVal_7389) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 1)) is different from false [2022-11-18 20:05:20,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:05:20,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20230 treesize of output 19921 [2022-11-18 20:05:20,475 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 19910 treesize of output 19782 [2022-11-18 20:05:20,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:05:20,520 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 19782 treesize of output 19630 [2022-11-18 20:05:20,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:05:20,569 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 19622 treesize of output 19310