./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 15:46:44,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 15:46:44,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 15:46:44,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 15:46:44,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 15:46:44,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 15:46:44,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 15:46:44,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 15:46:44,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 15:46:44,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 15:46:44,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 15:46:44,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 15:46:44,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 15:46:44,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 15:46:44,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 15:46:44,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 15:46:44,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 15:46:44,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 15:46:44,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 15:46:44,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 15:46:44,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 15:46:44,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 15:46:44,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 15:46:44,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 15:46:44,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 15:46:44,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 15:46:44,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 15:46:44,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 15:46:44,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 15:46:44,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 15:46:44,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 15:46:44,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 15:46:44,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 15:46:44,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 15:46:44,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 15:46:44,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 15:46:44,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 15:46:44,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 15:46:44,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 15:46:44,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 15:46:44,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 15:46:44,800 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 15:46:44,843 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 15:46:44,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 15:46:44,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 15:46:44,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 15:46:44,845 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 15:46:44,845 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 15:46:44,845 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 15:46:44,846 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 15:46:44,846 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 15:46:44,846 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 15:46:44,846 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 15:46:44,847 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 15:46:44,847 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 15:46:44,847 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 15:46:44,847 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 15:46:44,847 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 15:46:44,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 15:46:44,849 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 15:46:44,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 15:46:44,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 15:46:44,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 15:46:44,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 15:46:44,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 15:46:44,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 15:46:44,850 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 15:46:44,850 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 15:46:44,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 15:46:44,851 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 15:46:44,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 15:46:44,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 15:46:44,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 15:46:44,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 15:46:44,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 15:46:44,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 15:46:44,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 15:46:44,853 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 15:46:44,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 15:46:44,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 15:46:44,853 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 15:46:44,853 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 15:46:44,854 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/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_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2021-11-19 15:46:45,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 15:46:45,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 15:46:45,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 15:46:45,135 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 15:46:45,136 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 15:46:45,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-19 15:46:45,204 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/data/5bb879863/ff6aff022a864da1988bc639d2dd0680/FLAGe0023ad34 [2021-11-19 15:46:45,744 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 15:46:45,744 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-19 15:46:45,758 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/data/5bb879863/ff6aff022a864da1988bc639d2dd0680/FLAGe0023ad34 [2021-11-19 15:46:46,019 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/data/5bb879863/ff6aff022a864da1988bc639d2dd0680 [2021-11-19 15:46:46,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 15:46:46,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 15:46:46,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 15:46:46,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 15:46:46,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 15:46:46,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22626419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46, skipping insertion in model container [2021-11-19 15:46:46,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 15:46:46,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 15:46:46,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-19 15:46:46,502 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 15:46:46,516 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 15:46:46,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-19 15:46:46,600 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 15:46:46,635 INFO L208 MainTranslator]: Completed translation [2021-11-19 15:46:46,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46 WrapperNode [2021-11-19 15:46:46,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 15:46:46,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 15:46:46,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 15:46:46,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 15:46:46,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,695 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2021-11-19 15:46:46,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 15:46:46,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 15:46:46,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 15:46:46,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 15:46:46,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 15:46:46,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 15:46:46,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 15:46:46,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 15:46:46,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46" (1/1) ... [2021-11-19 15:46:46,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 15:46:46,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:46,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 15:46:46,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 15:46:46,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-19 15:46:46,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-19 15:46:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-19 15:46:46,855 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-19 15:46:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-19 15:46:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 15:46:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 15:46:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-19 15:46:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-19 15:46:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 15:46:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-19 15:46:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 15:46:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 15:46:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 15:46:47,042 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 15:46:47,044 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 15:46:47,420 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 15:46:47,472 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 15:46:47,472 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-19 15:46:47,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:46:47 BoogieIcfgContainer [2021-11-19 15:46:47,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 15:46:47,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 15:46:47,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 15:46:47,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 15:46:47,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 03:46:46" (1/3) ... [2021-11-19 15:46:47,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449c4057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:46:47, skipping insertion in model container [2021-11-19 15:46:47,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:46" (2/3) ... [2021-11-19 15:46:47,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449c4057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:46:47, skipping insertion in model container [2021-11-19 15:46:47,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:46:47" (3/3) ... [2021-11-19 15:46:47,484 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2021-11-19 15:46:47,490 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 15:46:47,490 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 15:46:47,539 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 15:46:47,546 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-19 15:46:47,546 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 15:46:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 15:46:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-19 15:46:47,568 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:47,569 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:47,569 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:46:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:47,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1079724122, now seen corresponding path program 1 times [2021-11-19 15:46:47,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:47,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337852490] [2021-11-19 15:46:47,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:47,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-19 15:46:47,912 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:47,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337852490] [2021-11-19 15:46:47,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337852490] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:47,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:47,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 15:46:47,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352352880] [2021-11-19 15:46:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:47,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 15:46:47,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:47,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 15:46:47,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 15:46:47,952 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 15:46:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:48,036 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2021-11-19 15:46:48,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 15:46:48,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2021-11-19 15:46:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:48,046 INFO L225 Difference]: With dead ends: 45 [2021-11-19 15:46:48,047 INFO L226 Difference]: Without dead ends: 21 [2021-11-19 15:46:48,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 15:46:48,056 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:48,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-19 15:46:48,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-11-19 15:46:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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) [2021-11-19 15:46:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-11-19 15:46:48,096 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2021-11-19 15:46:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:48,096 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-11-19 15:46:48,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 15:46:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2021-11-19 15:46:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-19 15:46:48,099 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:48,099 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:48,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 15:46:48,099 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:46:48,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2061360914, now seen corresponding path program 1 times [2021-11-19 15:46:48,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:48,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661314705] [2021-11-19 15:46:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:48,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-19 15:46:48,228 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:48,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661314705] [2021-11-19 15:46:48,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661314705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:48,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:48,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 15:46:48,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693504274] [2021-11-19 15:46:48,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:48,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 15:46:48,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:48,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 15:46:48,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 15:46:48,232 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-11-19 15:46:48,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:48,340 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2021-11-19 15:46:48,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 15:46:48,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 22 [2021-11-19 15:46:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:48,342 INFO L225 Difference]: With dead ends: 26 [2021-11-19 15:46:48,342 INFO L226 Difference]: Without dead ends: 20 [2021-11-19 15:46:48,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-19 15:46:48,344 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:48,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:48,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-19 15:46:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-19 15:46:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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) [2021-11-19 15:46:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-11-19 15:46:48,352 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2021-11-19 15:46:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:48,353 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-11-19 15:46:48,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-11-19 15:46:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2021-11-19 15:46:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-19 15:46:48,356 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:48,356 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:48,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 15:46:48,357 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:46:48,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash 433212228, now seen corresponding path program 1 times [2021-11-19 15:46:48,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:48,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688198934] [2021-11-19 15:46:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:48,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:50,067 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:50,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688198934] [2021-11-19 15:46:50,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688198934] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:50,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790122121] [2021-11-19 15:46:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:50,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:50,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:50,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:50,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 15:46:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:50,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 105 conjunts are in the unsatisfiable core [2021-11-19 15:46:50,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:50,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-19 15:46:50,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-19 15:46:50,564 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-19 15:46:50,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-19 15:46:50,746 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 15:46:50,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2021-11-19 15:46:50,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-19 15:46:50,959 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-19 15:46:50,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-11-19 15:46:51,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-19 15:46:51,264 INFO L354 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2021-11-19 15:46:51,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2021-11-19 15:46:51,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2021-11-19 15:46:51,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-19 15:46:51,468 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 15:46:51,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 25 [2021-11-19 15:46:51,570 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:46:51,571 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-11-19 15:46:55,791 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-19 15:46:55,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 117 [2021-11-19 15:46:55,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 15:46:55,815 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-19 15:46:55,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 74 [2021-11-19 15:46:55,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 15:46:55,842 INFO L354 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2021-11-19 15:46:55,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 81 [2021-11-19 15:46:55,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 15:46:55,861 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-19 15:46:55,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 60 [2021-11-19 15:46:56,539 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-19 15:46:56,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 389 treesize of output 301 [2021-11-19 15:46:56,573 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-19 15:46:56,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 337 treesize of output 277 [2021-11-19 15:46:56,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 219 [2021-11-19 15:46:56,611 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-19 15:46:56,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 204 [2021-11-19 15:46:56,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-19 15:46:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 15:46:56,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:56,926 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-19 15:46:56,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [416023797] [2021-11-19 15:46:56,946 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-19 15:46:56,946 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:46:56,950 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-19 15:46:56,955 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-19 15:46:56,956 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-19 15:46:56,988 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:46:56,990 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-19 15:46:56,990 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:46:56,991 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-19 15:46:56,992 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-19 15:46:56,992 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:46:56,993 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-11-19 15:46:56,995 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-11-19 15:46:57,003 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@15679961 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:92) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:571) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.doElimAllRec(ElimStorePlain.java:444) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:242) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:402) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:228) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:57,005 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 15:46:57,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-19 15:46:57,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550398184] [2021-11-19 15:46:57,006 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 15:46:57,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-19 15:46:57,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:57,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-19 15:46:57,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1310, Unknown=1, NotChecked=0, Total=1406 [2021-11-19 15:46:57,009 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 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) [2021-11-19 15:46:57,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 15:46:57,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=95, Invalid=1310, Unknown=1, NotChecked=0, Total=1406 [2021-11-19 15:46:57,012 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:57,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 15:46:57,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:57,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:57,242 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@15679961 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:57,244 INFO L158 Benchmark]: Toolchain (without parser) took 11220.84ms. Allocated memory was 104.9MB in the beginning and 178.3MB in the end (delta: 73.4MB). Free memory was 61.0MB in the beginning and 79.7MB in the end (delta: -18.7MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2021-11-19 15:46:57,244 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 104.9MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 15:46:57,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.84ms. Allocated memory is still 104.9MB. Free memory was 60.8MB in the beginning and 71.1MB in the end (delta: -10.3MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2021-11-19 15:46:57,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.27ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 68.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 15:46:57,245 INFO L158 Benchmark]: Boogie Preprocessor took 62.03ms. Allocated memory is still 104.9MB. Free memory was 68.9MB in the beginning and 67.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 15:46:57,245 INFO L158 Benchmark]: RCFGBuilder took 713.34ms. Allocated memory is still 104.9MB. Free memory was 67.0MB in the beginning and 47.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-19 15:46:57,246 INFO L158 Benchmark]: TraceAbstraction took 9766.29ms. Allocated memory was 104.9MB in the beginning and 178.3MB in the end (delta: 73.4MB). Free memory was 47.1MB in the beginning and 79.7MB in the end (delta: -32.6MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2021-11-19 15:46:57,248 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 104.9MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.84ms. Allocated memory is still 104.9MB. Free memory was 60.8MB in the beginning and 71.1MB in the end (delta: -10.3MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.27ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 68.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.03ms. Allocated memory is still 104.9MB. Free memory was 68.9MB in the beginning and 67.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 713.34ms. Allocated memory is still 104.9MB. Free memory was 67.0MB in the beginning and 47.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9766.29ms. Allocated memory was 104.9MB in the beginning and 178.3MB in the end (delta: 73.4MB). Free memory was 47.1MB in the beginning and 79.7MB in the end (delta: -32.6MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@15679961 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@15679961: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-19 15:46:57,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 15:46:59,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 15:46:59,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 15:46:59,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 15:46:59,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 15:46:59,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 15:46:59,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 15:46:59,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 15:46:59,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 15:46:59,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 15:46:59,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 15:46:59,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 15:46:59,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 15:46:59,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 15:46:59,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 15:46:59,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 15:46:59,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 15:46:59,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 15:46:59,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 15:46:59,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 15:46:59,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 15:46:59,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 15:46:59,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 15:46:59,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 15:46:59,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 15:46:59,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 15:46:59,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 15:46:59,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 15:46:59,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 15:46:59,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 15:46:59,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 15:46:59,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 15:46:59,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 15:46:59,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 15:46:59,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 15:46:59,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 15:46:59,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 15:46:59,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 15:46:59,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 15:46:59,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 15:46:59,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 15:46:59,863 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-19 15:46:59,907 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 15:46:59,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 15:46:59,908 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 15:46:59,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 15:46:59,909 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 15:46:59,909 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 15:46:59,909 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 15:46:59,909 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 15:46:59,910 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 15:46:59,910 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 15:46:59,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 15:46:59,913 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 15:46:59,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 15:46:59,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 15:46:59,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 15:46:59,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 15:46:59,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 15:46:59,914 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 15:46:59,914 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 15:46:59,914 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 15:46:59,914 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 15:46:59,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 15:46:59,915 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 15:46:59,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 15:46:59,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 15:46:59,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 15:46:59,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 15:46:59,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 15:46:59,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 15:46:59,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 15:46:59,916 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 15:46:59,916 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 15:46:59,917 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 15:46:59,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 15:46:59,917 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 15:46:59,917 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 15:46:59,918 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/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_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2021-11-19 15:47:00,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 15:47:00,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 15:47:00,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 15:47:00,345 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 15:47:00,346 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 15:47:00,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-19 15:47:00,423 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/data/098795ebd/fb9c6c944f09463282f747e03d0023af/FLAGd19eee838 [2021-11-19 15:47:01,070 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 15:47:01,071 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-19 15:47:01,085 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/data/098795ebd/fb9c6c944f09463282f747e03d0023af/FLAGd19eee838 [2021-11-19 15:47:01,325 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/data/098795ebd/fb9c6c944f09463282f747e03d0023af [2021-11-19 15:47:01,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 15:47:01,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 15:47:01,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 15:47:01,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 15:47:01,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 15:47:01,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:01,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45852008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01, skipping insertion in model container [2021-11-19 15:47:01,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:01,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 15:47:01,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 15:47:01,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-19 15:47:01,725 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 15:47:01,764 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 15:47:01,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-19 15:47:01,847 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 15:47:01,894 INFO L208 MainTranslator]: Completed translation [2021-11-19 15:47:01,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01 WrapperNode [2021-11-19 15:47:01,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 15:47:01,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 15:47:01,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 15:47:01,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 15:47:01,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:01,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:01,987 INFO L137 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2021-11-19 15:47:01,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 15:47:01,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 15:47:01,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 15:47:01,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 15:47:01,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:01,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:02,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:02,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:02,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:02,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:02,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:02,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 15:47:02,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 15:47:02,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 15:47:02,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 15:47:02,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01" (1/1) ... [2021-11-19 15:47:02,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 15:47:02,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:47:02,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 15:47:02,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 15:47:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-19 15:47:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-19 15:47:02,151 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-19 15:47:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-19 15:47:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 15:47:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 15:47:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-19 15:47:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-19 15:47:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 15:47:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-19 15:47:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-19 15:47:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 15:47:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 15:47:02,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 15:47:02,316 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 15:47:02,317 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 15:47:02,785 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 15:47:02,791 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 15:47:02,791 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-19 15:47:02,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:47:02 BoogieIcfgContainer [2021-11-19 15:47:02,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 15:47:02,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 15:47:02,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 15:47:02,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 15:47:02,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 03:47:01" (1/3) ... [2021-11-19 15:47:02,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3c0b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:47:02, skipping insertion in model container [2021-11-19 15:47:02,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:01" (2/3) ... [2021-11-19 15:47:02,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3c0b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:47:02, skipping insertion in model container [2021-11-19 15:47:02,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:47:02" (3/3) ... [2021-11-19 15:47:02,803 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2021-11-19 15:47:02,810 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 15:47:02,810 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 15:47:02,873 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 15:47:02,885 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-19 15:47:02,885 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 15:47:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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) [2021-11-19 15:47:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 15:47:02,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:47:02,916 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:47:02,917 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:47:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:47:02,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1369192097, now seen corresponding path program 1 times [2021-11-19 15:47:02,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 15:47:02,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401286663] [2021-11-19 15:47:02,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:02,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 15:47:02,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 15:47:02,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 15:47:02,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 15:47:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:47:03,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-19 15:47:03,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:47:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-19 15:47:03,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:47:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-19 15:47:03,339 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 15:47:03,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401286663] [2021-11-19 15:47:03,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401286663] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 15:47:03,341 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:47:03,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-19 15:47:03,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336034847] [2021-11-19 15:47:03,343 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 15:47:03,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 15:47:03,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 15:47:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 15:47:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 15:47:03,416 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 15:47:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:47:03,465 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2021-11-19 15:47:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 15:47:03,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-11-19 15:47:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:47:03,475 INFO L225 Difference]: With dead ends: 65 [2021-11-19 15:47:03,475 INFO L226 Difference]: Without dead ends: 28 [2021-11-19 15:47:03,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 15:47:03,482 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:47:03,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 15:47:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-11-19 15:47:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-11-19 15:47:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 15:47:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-11-19 15:47:03,538 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2021-11-19 15:47:03,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:47:03,540 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-11-19 15:47:03,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 15:47:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-11-19 15:47:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 15:47:03,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:47:03,543 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:47:03,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-19 15:47:03,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 15:47:03,763 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:47:03,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:47:03,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1579482442, now seen corresponding path program 1 times [2021-11-19 15:47:03,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 15:47:03,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546560759] [2021-11-19 15:47:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:03,765 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 15:47:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 15:47:03,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 15:47:03,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 15:47:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:47:03,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 15:47:03,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:47:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:47:04,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:47:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-19 15:47:04,124 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 15:47:04,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546560759] [2021-11-19 15:47:04,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546560759] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 15:47:04,125 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:47:04,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-19 15:47:04,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841629297] [2021-11-19 15:47:04,125 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 15:47:04,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 15:47:04,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 15:47:04,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 15:47:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-19 15:47:04,128 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-19 15:47:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:47:04,169 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2021-11-19 15:47:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 15:47:04,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2021-11-19 15:47:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:47:04,176 INFO L225 Difference]: With dead ends: 52 [2021-11-19 15:47:04,178 INFO L226 Difference]: Without dead ends: 31 [2021-11-19 15:47:04,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-19 15:47:04,181 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:47:04,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 15:47:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-11-19 15:47:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-11-19 15:47:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 15:47:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-11-19 15:47:04,197 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2021-11-19 15:47:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:47:04,198 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-11-19 15:47:04,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-19 15:47:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-11-19 15:47:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-19 15:47:04,201 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:47:04,202 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:47:04,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-19 15:47:04,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 15:47:04,421 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:47:04,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:47:04,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1638915570, now seen corresponding path program 1 times [2021-11-19 15:47:04,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 15:47:04,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342408042] [2021-11-19 15:47:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:04,422 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 15:47:04,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 15:47:04,425 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 15:47:04,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-19 15:47:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:47:04,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 15:47:04,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:47:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-19 15:47:04,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:47:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-19 15:47:05,204 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 15:47:05,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342408042] [2021-11-19 15:47:05,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342408042] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 15:47:05,205 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:47:05,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-19 15:47:05,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156865455] [2021-11-19 15:47:05,210 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 15:47:05,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 15:47:05,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 15:47:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 15:47:05,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 15:47:05,212 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-19 15:47:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:47:05,280 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2021-11-19 15:47:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 15:47:05,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2021-11-19 15:47:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:47:05,282 INFO L225 Difference]: With dead ends: 41 [2021-11-19 15:47:05,282 INFO L226 Difference]: Without dead ends: 30 [2021-11-19 15:47:05,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-19 15:47:05,284 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:47:05,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 106 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 15:47:05,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-19 15:47:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-11-19 15:47:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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) [2021-11-19 15:47:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-11-19 15:47:05,300 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 33 [2021-11-19 15:47:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:47:05,301 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-11-19 15:47:05,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-19 15:47:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2021-11-19 15:47:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-19 15:47:05,303 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:47:05,303 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:47:05,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-19 15:47:05,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 15:47:05,527 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:47:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:47:05,528 INFO L85 PathProgramCache]: Analyzing trace with hash 802467380, now seen corresponding path program 1 times [2021-11-19 15:47:05,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 15:47:05,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654251271] [2021-11-19 15:47:05,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:05,529 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 15:47:05,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 15:47:05,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 15:47:05,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-19 15:47:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:47:05,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-19 15:47:05,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:47:05,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-19 15:47:06,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 15:47:06,523 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-19 15:47:06,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-11-19 15:47:06,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 15:47:06,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-19 15:47:07,082 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-19 15:47:07,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 62 [2021-11-19 15:47:07,114 INFO L354 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-11-19 15:47:07,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 52 [2021-11-19 15:47:07,657 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-11-19 15:47:07,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 73 [2021-11-19 15:47:07,681 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 15:47:07,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 60 [2021-11-19 15:47:07,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-11-19 15:47:07,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-19 15:47:07,703 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 15:47:07,960 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:47:07,962 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-11-19 15:47:12,768 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-19 15:47:12,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 200 treesize of output 203 [2021-11-19 15:47:13,006 INFO L354 Elim1Store]: treesize reduction 296, result has 10.0 percent of original size [2021-11-19 15:47:13,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 184 treesize of output 140 [2021-11-19 15:47:13,102 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-19 15:47:13,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 145 [2021-11-19 15:47:13,164 INFO L354 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2021-11-19 15:47:13,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 154 treesize of output 156 [2021-11-19 15:47:15,208 INFO L354 Elim1Store]: treesize reduction 290, result has 11.3 percent of original size [2021-11-19 15:47:15,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 11 case distinctions, treesize of input 265 treesize of output 171 [2021-11-19 15:47:15,453 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-19 15:47:15,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 302 treesize of output 221 [2021-11-19 15:47:15,467 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:47:15,468 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 284 [2021-11-19 15:47:15,541 INFO L354 Elim1Store]: treesize reduction 298, result has 8.3 percent of original size [2021-11-19 15:47:15,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 284 treesize of output 187 [2021-11-19 15:47:15,855 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-19 15:47:15,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 41 [2021-11-19 15:47:15,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-11-19 15:47:16,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-11-19 15:47:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:47:16,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:47:16,455 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:47:16,457 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-11-19 15:47:16,460 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:47:16,461 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2021-11-19 15:47:18,508 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_DerPreprocessor_4)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-19 15:47:20,643 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_DerPreprocessor_4)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-19 15:47:22,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_4)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-11-19 15:47:23,655 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:47:23,662 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 273 [2021-11-19 15:47:23,667 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:47:23,668 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 458 [2021-11-19 15:47:23,673 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:47:23,676 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 565 [2021-11-19 15:47:33,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (not (= (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_4)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))))) is different from false [2021-11-19 15:47:35,988 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (not (= (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_4)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))))) is different from true [2021-11-19 15:47:37,687 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:47:37,689 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 824 [2021-11-19 15:47:37,694 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:47:37,695 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1009 [2021-11-19 15:47:37,700 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:47:37,702 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1116 [2021-11-19 15:48:00,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse4 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_10))) (.cse6 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_9)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_8) .cse4 |node_create_~data#1|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |c_node_create_~temp~0#1.base| (store (select .cse0 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |c_node_create_~temp~0#1.base|)))) (store .cse5 |c_node_create_~temp~0#1.base| (store (select .cse5 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |c_node_create_~temp~0#1.base| (store (select .cse7 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (_ bv4 32))))))) (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= (let ((.cse13 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse17 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_7))) (.cse15 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_6)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse13 |v_node_create_~data#1_26|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_prenex_1))))) (store .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_2))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_4))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 v_prenex_3)))) (store .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)))))) is different from false [2021-11-19 15:48:02,938 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse4 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_10))) (.cse6 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_9)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_8) .cse4 |node_create_~data#1|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |c_node_create_~temp~0#1.base| (store (select .cse0 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |c_node_create_~temp~0#1.base|)))) (store .cse5 |c_node_create_~temp~0#1.base| (store (select .cse5 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |c_node_create_~temp~0#1.base| (store (select .cse7 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (_ bv4 32))))))) (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= (let ((.cse13 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse17 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_7))) (.cse15 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_6)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse13 |v_node_create_~data#1_26|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_prenex_1))))) (store .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_2))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_4))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 v_prenex_3)))) (store .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)))))) is different from true [2021-11-19 15:49:02,931 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_29| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (= (let ((.cse4 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_29| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_10))) (.cse6 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_9)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |v_node_create_~temp~0#1.base_29| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| v_DerPreprocessor_8) .cse4 |node_create_~data#1|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_node_create_~temp~0#1.base_29| (store (select .cse0 |v_node_create_~temp~0#1.base_29|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_node_create_~temp~0#1.base_29|)))) (store .cse5 |v_node_create_~temp~0#1.base_29| (store (select .cse5 |v_node_create_~temp~0#1.base_29|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_node_create_~temp~0#1.base_29| (store (select .cse7 |v_node_create_~temp~0#1.base_29|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (_ bv4 32)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|) (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= (let ((.cse13 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse17 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_7))) (.cse15 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_6)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse13 |v_node_create_~data#1_26|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_prenex_1))))) (store .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_2))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_4))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 v_prenex_3)))) (store .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_29|)))) (not (bvult |v_node_create_~temp~0#1.base_29| |c_#StackHeapBarrier|)))) is different from true [2021-11-19 15:49:02,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 348403 treesize of output 343407 [2021-11-19 15:49:03,636 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 15:49:03,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654251271] [2021-11-19 15:49:03,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-19 15:49:03,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2123468537] [2021-11-19 15:49:03,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:49:03,642 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-19 15:49:03,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/cvc4 [2021-11-19 15:49:03,647 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-19 15:49:03,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-19 15:49:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:49:04,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-19 15:49:04,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:49:04,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-19 15:49:04,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 15:49:04,725 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-19 15:49:04,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2021-11-19 15:49:05,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-19 15:49:05,573 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-19 15:49:05,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 35 [2021-11-19 15:49:06,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 56 [2021-11-19 15:49:06,478 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 15:49:06,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 52 [2021-11-19 15:49:06,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-11-19 15:49:06,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-19 15:49:06,502 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 15:49:06,637 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:49:06,638 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-11-19 15:49:09,212 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-19 15:49:09,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 154 [2021-11-19 15:49:09,348 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-19 15:49:09,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 111 [2021-11-19 15:49:09,461 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-19 15:49:09,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 108 [2021-11-19 15:49:09,520 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-19 15:49:09,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 105 treesize of output 107 [2021-11-19 15:49:09,531 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 15:49:11,339 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-19 15:49:11,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 150 [2021-11-19 15:49:11,556 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-19 15:49:11,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 267 treesize of output 190 [2021-11-19 15:49:11,562 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:49:11,563 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 249 [2021-11-19 15:49:11,638 INFO L354 Elim1Store]: treesize reduction 298, result has 8.3 percent of original size [2021-11-19 15:49:11,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 249 treesize of output 152 [2021-11-19 15:49:11,721 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-19 15:49:11,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 41 [2021-11-19 15:49:11,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-11-19 15:49:11,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-11-19 15:49:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:49:12,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:49:12,041 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:49:12,042 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-11-19 15:49:12,044 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:49:12,045 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2021-11-19 15:49:14,098 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_DerPreprocessor_14)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-11-19 15:49:16,245 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_DerPreprocessor_14)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-19 15:49:55,980 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:49:55,982 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 270 [2021-11-19 15:49:55,987 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:49:55,988 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 455 [2021-11-19 15:49:55,993 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:49:55,994 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 562 [2021-11-19 15:50:08,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_14)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|))))))) is different from false [2021-11-19 15:50:10,381 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_14)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|))))))) is different from true [2021-11-19 15:50:11,988 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:50:11,990 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 824 [2021-11-19 15:50:11,996 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:50:11,998 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1009 [2021-11-19 15:50:12,004 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:50:12,006 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1116 [2021-11-19 15:50:38,810 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_6)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))) (= (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_20))) (.cse15 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_19)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_18) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_14))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) is different from false [2021-11-19 15:50:40,816 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_6)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))) (= (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_20))) (.cse15 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_19)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_18) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_14))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) is different from true [2021-11-19 15:51:28,704 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_33|))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_6)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))) (= (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_33| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_33|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_20))) (.cse15 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_33| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_33|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_19)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |v_node_create_~temp~0#1.base_33| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_33|) |node_create_~temp~0#1.offset| v_DerPreprocessor_18) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_14))))) (store .cse9 |v_node_create_~temp~0#1.base_33| (store (select .cse9 |v_node_create_~temp~0#1.base_33|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_node_create_~temp~0#1.base_33|)))) (store .cse14 |v_node_create_~temp~0#1.base_33| (store (select .cse14 |v_node_create_~temp~0#1.base_33|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |v_node_create_~temp~0#1.base_33| (store (select .cse16 |v_node_create_~temp~0#1.base_33|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) (not (bvult |v_node_create_~temp~0#1.base_33| |c_#StackHeapBarrier|)))) is different from true [2021-11-19 15:51:28,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66561 treesize of output 64485 [2021-11-19 15:51:29,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13212574 treesize of output 13064258 [2021-11-19 15:51:43,894 WARN L227 SmtUtils]: Spent 14.77s on a formula simplification that was a NOOP. DAG size: 5128 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 15:51:58,600 WARN L227 SmtUtils]: Spent 14.69s on a formula simplification that was a NOOP. DAG size: 5125 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 15:51:58,686 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-19 15:51:58,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845629262] [2021-11-19 15:51:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:51:58,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:51:58,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:51:58,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:51:58,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 15:51:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:51:58,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-19 15:51:58,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:51:58,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-19 15:51:59,548 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-19 15:51:59,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2021-11-19 15:52:00,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 15:52:00,540 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-11-19 15:52:00,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 60 [2021-11-19 15:52:01,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-19 15:52:01,565 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-19 15:52:01,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2021-11-19 15:52:03,109 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:52:03,110 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-11-19 15:52:11,908 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-19 15:52:11,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 167 [2021-11-19 15:52:12,005 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-19 15:52:12,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 124 [2021-11-19 15:52:12,078 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-19 15:52:12,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 121 [2021-11-19 15:52:12,161 INFO L354 Elim1Store]: treesize reduction 44, result has 27.9 percent of original size [2021-11-19 15:52:12,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 122 [2021-11-19 15:52:12,176 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 15:52:16,078 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-19 15:52:16,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 149 [2021-11-19 15:52:16,250 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-19 15:52:16,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 266 treesize of output 189 [2021-11-19 15:52:16,255 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:52:16,256 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 248 [2021-11-19 15:52:16,317 INFO L354 Elim1Store]: treesize reduction 298, result has 8.3 percent of original size [2021-11-19 15:52:16,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 151 [2021-11-19 15:52:16,665 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-19 15:52:16,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2021-11-19 15:52:16,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-11-19 15:52:16,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-19 15:52:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 15:52:16,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:52:16,973 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:52:16,974 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-11-19 15:52:16,977 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:52:16,978 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2021-11-19 15:52:19,030 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_DerPreprocessor_24)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-19 15:53:25,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_24)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-11-19 15:53:26,693 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:53:26,694 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 268 [2021-11-19 15:53:26,699 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:53:26,700 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 453 [2021-11-19 15:53:26,703 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:53:26,704 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 560 [2021-11-19 15:53:28,999 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse3 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_24))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|))))))) is different from false [2021-11-19 15:53:31,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_24))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_24)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))) is different from false [2021-11-19 15:53:33,662 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_24))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_24)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))) is different from true [2021-11-19 15:53:34,872 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:53:34,873 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 820 [2021-11-19 15:53:34,878 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:53:34,879 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 927 [2021-11-19 15:53:34,884 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 15:53:34,885 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1112 [2021-11-19 15:53:54,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_8))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_10))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_9))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_7)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_11))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_29))) (.cse15 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_30)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_28) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_24))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))))) is different from false [2021-11-19 15:53:56,025 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_8))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_10))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_9))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_7)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_11))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_29))) (.cse15 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_30)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_28) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_24))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))))) is different from true [2021-11-19 15:54:31,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_37| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_37|)))) (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_8))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_10))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_9))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_7)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_11))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_29))) (.cse15 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_30)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| v_DerPreprocessor_28) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_24))))) (store .cse9 |v_node_create_~temp~0#1.base_37| (store (select .cse9 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_node_create_~temp~0#1.base_37|)))) (store .cse14 |v_node_create_~temp~0#1.base_37| (store (select .cse14 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |v_node_create_~temp~0#1.base_37| (store (select .cse16 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))))))) is different from false [2021-11-19 15:54:33,156 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_37| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_37|)))) (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_8))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_10))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_9))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_7)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_11))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_29))) (.cse15 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_30)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| v_DerPreprocessor_28) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_24))))) (store .cse9 |v_node_create_~temp~0#1.base_37| (store (select .cse9 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_node_create_~temp~0#1.base_37|)))) (store .cse14 |v_node_create_~temp~0#1.base_37| (store (select .cse14 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |v_node_create_~temp~0#1.base_37| (store (select .cse16 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))))))) is different from true [2021-11-19 15:54:33,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166758 treesize of output 158610 [2021-11-19 15:54:33,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24715032 treesize of output 23980260 [2021-11-19 15:55:03,537 WARN L227 SmtUtils]: Spent 30.03s on a formula simplification that was a NOOP. DAG size: 4455 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 15:55:33,575 WARN L227 SmtUtils]: Spent 30.02s on a formula simplification that was a NOOP. DAG size: 4452 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 15:55:33,618 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-19 15:55:33,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:55:33,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-19 15:55:33,619 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-11-19 15:55:33,619 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-19 15:55:33,627 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 15:55:33,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-19 15:55:33,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-19 15:55:34,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2021-11-19 15:55:34,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt [2021-11-19 15:55:34,261 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-11-19 15:55:34,264 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 15:55:34,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 03:55:34 BoogieIcfgContainer [2021-11-19 15:55:34,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 15:55:34,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 15:55:34,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 15:55:34,282 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 15:55:34,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:47:02" (3/4) ... [2021-11-19 15:55:34,287 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-19 15:55:34,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 15:55:34,287 INFO L158 Benchmark]: Toolchain (without parser) took 512958.07ms. Allocated memory was 62.9MB in the beginning and 937.4MB in the end (delta: 874.5MB). Free memory was 42.1MB in the beginning and 588.4MB in the end (delta: -546.2MB). Peak memory consumption was 331.0MB. Max. memory is 16.1GB. [2021-11-19 15:55:34,288 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 62.9MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 15:55:34,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.35ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 40.4MB in the end (delta: 1.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-19 15:55:34,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.60ms. Allocated memory is still 62.9MB. Free memory was 40.4MB in the beginning and 38.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 15:55:34,288 INFO L158 Benchmark]: Boogie Preprocessor took 76.78ms. Allocated memory is still 62.9MB. Free memory was 38.1MB in the beginning and 36.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 15:55:34,289 INFO L158 Benchmark]: RCFGBuilder took 727.81ms. Allocated memory was 62.9MB in the beginning and 98.6MB in the end (delta: 35.7MB). Free memory was 36.1MB in the beginning and 72.9MB in the end (delta: -36.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2021-11-19 15:55:34,289 INFO L158 Benchmark]: TraceAbstraction took 511484.84ms. Allocated memory was 98.6MB in the beginning and 937.4MB in the end (delta: 838.9MB). Free memory was 72.4MB in the beginning and 588.4MB in the end (delta: -516.0MB). Peak memory consumption was 564.4MB. Max. memory is 16.1GB. [2021-11-19 15:55:34,289 INFO L158 Benchmark]: Witness Printer took 4.88ms. Allocated memory is still 937.4MB. Free memory is still 588.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 15:55:34,290 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 62.9MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.35ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 40.4MB in the end (delta: 1.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.60ms. Allocated memory is still 62.9MB. Free memory was 40.4MB in the beginning and 38.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.78ms. Allocated memory is still 62.9MB. Free memory was 38.1MB in the beginning and 36.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 727.81ms. Allocated memory was 62.9MB in the beginning and 98.6MB in the end (delta: 35.7MB). Free memory was 36.1MB in the beginning and 72.9MB in the end (delta: -36.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * TraceAbstraction took 511484.84ms. Allocated memory was 98.6MB in the beginning and 937.4MB in the end (delta: 838.9MB). Free memory was 72.4MB in the beginning and 588.4MB in the end (delta: -516.0MB). Peak memory consumption was 564.4MB. Max. memory is 16.1GB. * Witness Printer took 4.88ms. Allocated memory is still 937.4MB. Free memory is still 588.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 647]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L629] const int len = 2; [L630] const int data = 1; [L631] SLL s = sll_circular_create(len, data); [L631] CALL, EXPR sll_circular_create(len, data) [L584] CALL, EXPR node_create(data) [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L584] RET, EXPR node_create(data) [L584] SLL head = node_create(data); [L585] SLL last = head; [L586] COND TRUE len > 1 [L587] CALL, EXPR node_create(data) [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L587] RET, EXPR node_create(data) [L587] SLL new_head = node_create(data); [L588] new_head->next = head [L589] head = new_head [L590] len-- [L586] COND FALSE !(len > 1) [L592] last->next = head [L593] return head; [L631] RET, EXPR sll_circular_create(len, data) [L631] SLL s = sll_circular_create(len, data); [L632] CALL sll_circular_insert(&s, data, len / 2) [L607] CALL, EXPR node_create(data) [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L607] RET, EXPR node_create(data) [L607] SLL new_node = node_create(data); [L608] SLL snd_to_last = ((void *)0); [L609] EXPR \read(*head) [L609] SLL last = *head; [L610] COND TRUE index > 0 [L611] snd_to_last = last [L612] EXPR last->next [L612] last = last->next [L613] index-- [L610] COND FALSE !(index > 0) [L615] COND TRUE \read(snd_to_last) [L616] snd_to_last->next = new_node [L617] new_node->next = last [L632] RET sll_circular_insert(&s, data, len / 2) [L633] EXPR \read(s) [L633] SLL ptr = s; [L634] int count = 0; [L636] EXPR ptr->data [L636] COND TRUE data != ptr->data [L647] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 511.4s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 112 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 119.0s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 193 ConstructedInterpolants, 13 QuantifiedInterpolants, 1790 SizeOfPredicates, 42 NumberOfNonLiveVariables, 556 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 59/69 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-19 15:55:34,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dce8d14f-828e-4c24-8d34-36e70caf8d58/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN