./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.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_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/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_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/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_d896ec0d-4b5c-46b6-bd80-2087c698a154/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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:29:25,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:29:25,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:29:26,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:29:26,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:29:26,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:29:26,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:29:26,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:29:26,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:29:26,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:29:26,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:29:26,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:29:26,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:29:26,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:29:26,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:29:26,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:29:26,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:29:26,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:29:26,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:29:26,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:29:26,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:29:26,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:29:26,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:29:26,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:29:26,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:29:26,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:29:26,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:29:26,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:29:26,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:29:26,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:29:26,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:29:26,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:29:26,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:29:26,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:29:26,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:29:26,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:29:26,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:29:26,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:29:26,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:29:26,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:29:26,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:29:26,082 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 14:29:26,131 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:29:26,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:29:26,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:29:26,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:29:26,135 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:29:26,135 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:29:26,135 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:29:26,141 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 14:29:26,142 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:29:26,142 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:29:26,143 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 14:29:26,143 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 14:29:26,143 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:29:26,144 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 14:29:26,144 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 14:29:26,144 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 14:29:26,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:29:26,145 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:29:26,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 14:29:26,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:29:26,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:29:26,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:29:26,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:29:26,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:29:26,147 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:29:26,147 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:29:26,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:29:26,148 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:29:26,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:29:26,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:29:26,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:29:26,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:29:26,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:29:26,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:29:26,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:29:26,152 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 14:29:26,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 14:29:26,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:29:26,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:29:26,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:29:26,153 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_d896ec0d-4b5c-46b6-bd80-2087c698a154/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_d896ec0d-4b5c-46b6-bd80-2087c698a154/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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2021-11-19 14:29:26,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:29:26,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:29:26,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:29:26,474 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:29:26,475 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:29:26,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2021-11-19 14:29:26,560 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/data/a647aec85/ff71c361ecca4830b3afe689b7e801dc/FLAGeb511e1bf [2021-11-19 14:29:27,179 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:29:27,185 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2021-11-19 14:29:27,205 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/data/a647aec85/ff71c361ecca4830b3afe689b7e801dc/FLAGeb511e1bf [2021-11-19 14:29:27,459 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/data/a647aec85/ff71c361ecca4830b3afe689b7e801dc [2021-11-19 14:29:27,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:29:27,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:29:27,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:29:27,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:29:27,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:29:27,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:29:27" (1/1) ... [2021-11-19 14:29:27,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a7538f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:27, skipping insertion in model container [2021-11-19 14:29:27,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:29:27" (1/1) ... [2021-11-19 14:29:27,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:29:27,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:29:27,896 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_d896ec0d-4b5c-46b6-bd80-2087c698a154/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2021-11-19 14:29:27,900 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:29:27,908 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:29:27,963 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_d896ec0d-4b5c-46b6-bd80-2087c698a154/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2021-11-19 14:29:27,965 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:29:28,002 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:29:28,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28 WrapperNode [2021-11-19 14:29:28,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:29:28,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:29:28,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:29:28,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:29:28,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28" (1/1) ... [2021-11-19 14:29:28,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28" (1/1) ... [2021-11-19 14:29:28,095 INFO L137 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 172 [2021-11-19 14:29:28,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:29:28,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:29:28,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:29:28,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:29:28,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28" (1/1) ... [2021-11-19 14:29:28,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28" (1/1) ... [2021-11-19 14:29:28,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28" (1/1) ... [2021-11-19 14:29:28,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28" (1/1) ... [2021-11-19 14:29:28,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28" (1/1) ... [2021-11-19 14:29:28,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28" (1/1) ... [2021-11-19 14:29:28,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28" (1/1) ... [2021-11-19 14:29:28,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:29:28,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:29:28,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:29:28,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:29:28,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28" (1/1) ... [2021-11-19 14:29:28,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:29:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:29:28,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:29:28,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:29:28,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-19 14:29:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-19 14:29:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-19 14:29:28,265 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-19 14:29:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-19 14:29:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:29:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 14:29:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-19 14:29:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-19 14:29:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 14:29:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-19 14:29:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 14:29:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:29:28,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:29:28,409 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:29:28,411 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:29:28,745 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:29:28,816 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:29:28,816 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-19 14:29:28,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:29:28 BoogieIcfgContainer [2021-11-19 14:29:28,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:29:28,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:29:28,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:29:28,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:29:28,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:29:27" (1/3) ... [2021-11-19 14:29:28,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d96577b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:29:28, skipping insertion in model container [2021-11-19 14:29:28,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:28" (2/3) ... [2021-11-19 14:29:28,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d96577b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:29:28, skipping insertion in model container [2021-11-19 14:29:28,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:29:28" (3/3) ... [2021-11-19 14:29:28,828 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2021-11-19 14:29:28,834 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:29:28,834 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:29:28,884 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:29:28,891 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 14:29:28,891 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:29:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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 14:29:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-19 14:29:28,931 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:29:28,932 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:29:28,932 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:29:28,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:29:28,938 INFO L85 PathProgramCache]: Analyzing trace with hash -249418040, now seen corresponding path program 1 times [2021-11-19 14:29:28,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:29:28,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568613211] [2021-11-19 14:29:28,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:29:28,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:29:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:29:29,208 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 14:29:29,210 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:29:29,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568613211] [2021-11-19 14:29:29,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568613211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:29:29,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:29:29,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 14:29:29,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844108897] [2021-11-19 14:29:29,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:29:29,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 14:29:29,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:29:29,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 14:29:29,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 14:29:29,253 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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 14:29:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:29:29,351 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2021-11-19 14:29:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 14:29:29,358 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 14:29:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:29:29,375 INFO L225 Difference]: With dead ends: 55 [2021-11-19 14:29:29,376 INFO L226 Difference]: Without dead ends: 26 [2021-11-19 14:29:29,379 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 14:29:29,384 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:29:29,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 14:29:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-19 14:29:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2021-11-19 14:29:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 14:29:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2021-11-19 14:29:29,437 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2021-11-19 14:29:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:29:29,438 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2021-11-19 14:29:29,439 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 14:29:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2021-11-19 14:29:29,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-19 14:29:29,442 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:29:29,442 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 14:29:29,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 14:29:29,443 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:29:29,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:29:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash -436693828, now seen corresponding path program 1 times [2021-11-19 14:29:29,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:29:29,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083793133] [2021-11-19 14:29:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:29:29,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:29:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:29:29,640 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 14:29:29,640 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:29:29,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083793133] [2021-11-19 14:29:29,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083793133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:29:29,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:29:29,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 14:29:29,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626859334] [2021-11-19 14:29:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:29:29,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 14:29:29,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:29:29,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 14:29:29,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 14:29:29,646 INFO L87 Difference]: Start difference. First operand 24 states and 32 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 14:29:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:29:29,816 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2021-11-19 14:29:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 14:29:29,817 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 14:29:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:29:29,818 INFO L225 Difference]: With dead ends: 36 [2021-11-19 14:29:29,818 INFO L226 Difference]: Without dead ends: 25 [2021-11-19 14:29:29,819 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 14:29:29,820 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:29:29,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 14:29:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-19 14:29:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-11-19 14:29:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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 14:29:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2021-11-19 14:29:29,836 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 22 [2021-11-19 14:29:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:29:29,840 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-11-19 14:29:29,840 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 14:29:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2021-11-19 14:29:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-19 14:29:29,841 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:29:29,842 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 14:29:29,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 14:29:29,842 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:29:29,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:29:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash -764953388, now seen corresponding path program 1 times [2021-11-19 14:29:29,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:29:29,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368189301] [2021-11-19 14:29:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:29:29,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:29:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:29:31,391 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 14:29:31,392 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:29:31,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368189301] [2021-11-19 14:29:31,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368189301] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:29:31,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083513650] [2021-11-19 14:29:31,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:29:31,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:29:31,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:29:31,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:29:31,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 14:29:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:29:31,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 104 conjunts are in the unsatisfiable core [2021-11-19 14:29:31,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:29:31,799 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 14:29:32,142 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 14:29:32,272 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:29:32,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-19 14:29:32,392 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 14:29:32,542 INFO L354 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2021-11-19 14:29:32,543 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 40 treesize of output 28 [2021-11-19 14:29:32,764 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 59 treesize of output 39 [2021-11-19 14:29:32,773 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 14:29:32,774 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 39 treesize of output 35 [2021-11-19 14:29:32,785 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 25 treesize of output 21 [2021-11-19 14:29:32,795 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 14:29:32,797 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 14:29:32,903 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:29:32,904 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-11-19 14:29:37,155 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-19 14:29:37,156 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 2 case distinctions, treesize of input 123 treesize of output 126 [2021-11-19 14:29:37,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:29:37,179 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-19 14:29:37,180 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 107 treesize of output 79 [2021-11-19 14:29:37,204 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-19 14:29:37,205 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 3 case distinctions, treesize of input 92 treesize of output 94 [2021-11-19 14:29:37,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:29:37,224 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-19 14:29:37,224 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 73 treesize of output 61 [2021-11-19 14:29:37,227 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 14:29:37,914 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-19 14:29:37,915 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 258 treesize of output 198 [2021-11-19 14:29:37,936 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-19 14:29:37,937 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 234 treesize of output 198 [2021-11-19 14:29:37,956 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 176 treesize of output 164 [2021-11-19 14:29:37,983 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-19 14:29:37,983 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 161 treesize of output 149 [2021-11-19 14:29:38,112 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 14:29:38,166 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 14:29:38,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:29:38,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-19 14:29:38,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1971745331] [2021-11-19 14:29:38,353 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-19 14:29:38,353 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 14:29:38,357 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-19 14:29:38,363 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-19 14:29:38,364 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-19 14:29:38,397 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:29:38,399 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-19 14:29:38,399 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:29:38,400 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-19 14:29:38,401 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-19 14:29:38,401 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:29:38,402 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-11-19 14:29:38,403 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-11-19 14:29:38,411 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2d5e81db 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 14:29:38,415 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 14:29:38,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-19 14:29:38,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173493753] [2021-11-19 14:29:38,416 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 14:29:38,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-19 14:29:38,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:29:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-19 14:29:38,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1237, Unknown=1, NotChecked=0, Total=1332 [2021-11-19 14:29:38,419 INFO L87 Difference]: Start difference. First operand 25 states and 33 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 14:29:38,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 14:29:38,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=94, Invalid=1237, Unknown=1, NotChecked=0, Total=1332 [2021-11-19 14:29:38,421 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 14:29:38,422 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 14:29:38,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 14:29:38,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:29:38,649 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@2d5e81db 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 14:29:38,654 INFO L158 Benchmark]: Toolchain (without parser) took 11190.94ms. Allocated memory was 90.2MB in the beginning and 155.2MB in the end (delta: 65.0MB). Free memory was 60.3MB in the beginning and 92.4MB in the end (delta: -32.1MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2021-11-19 14:29:38,654 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 90.2MB. Free memory is still 45.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:29:38,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.00ms. Allocated memory was 90.2MB in the beginning and 125.8MB in the end (delta: 35.7MB). Free memory was 60.1MB in the beginning and 93.0MB in the end (delta: -32.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-19 14:29:38,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.03ms. Allocated memory is still 125.8MB. Free memory was 92.9MB in the beginning and 90.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-19 14:29:38,655 INFO L158 Benchmark]: Boogie Preprocessor took 76.82ms. Allocated memory is still 125.8MB. Free memory was 90.3MB in the beginning and 88.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:29:38,656 INFO L158 Benchmark]: RCFGBuilder took 645.45ms. Allocated memory is still 125.8MB. Free memory was 88.7MB in the beginning and 67.8MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-19 14:29:38,656 INFO L158 Benchmark]: TraceAbstraction took 9832.28ms. Allocated memory was 125.8MB in the beginning and 155.2MB in the end (delta: 29.4MB). Free memory was 67.7MB in the beginning and 92.4MB in the end (delta: -24.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2021-11-19 14:29:38,663 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 90.2MB. Free memory is still 45.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.00ms. Allocated memory was 90.2MB in the beginning and 125.8MB in the end (delta: 35.7MB). Free memory was 60.1MB in the beginning and 93.0MB in the end (delta: -32.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.03ms. Allocated memory is still 125.8MB. Free memory was 92.9MB in the beginning and 90.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.82ms. Allocated memory is still 125.8MB. Free memory was 90.3MB in the beginning and 88.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 645.45ms. Allocated memory is still 125.8MB. Free memory was 88.7MB in the beginning and 67.8MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9832.28ms. Allocated memory was 125.8MB in the beginning and 155.2MB in the end (delta: 29.4MB). Free memory was 67.7MB in the beginning and 92.4MB in the end (delta: -24.7MB). Peak memory consumption was 6.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@2d5e81db de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2d5e81db: 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 14:29:38,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/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_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/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_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/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_d896ec0d-4b5c-46b6-bd80-2087c698a154/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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:29:41,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:29:41,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:29:41,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:29:41,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:29:41,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:29:41,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:29:41,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:29:41,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:29:41,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:29:41,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:29:41,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:29:41,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:29:41,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:29:41,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:29:41,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:29:41,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:29:41,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:29:41,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:29:41,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:29:41,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:29:41,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:29:41,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:29:41,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:29:41,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:29:41,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:29:41,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:29:41,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:29:41,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:29:41,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:29:41,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:29:41,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:29:41,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:29:41,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:29:41,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:29:41,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:29:41,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:29:41,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:29:41,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:29:41,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:29:41,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:29:41,366 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-19 14:29:41,412 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:29:41,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:29:41,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:29:41,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:29:41,414 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:29:41,415 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:29:41,415 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:29:41,415 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:29:41,415 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:29:41,416 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:29:41,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:29:41,418 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:29:41,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:29:41,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:29:41,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:29:41,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:29:41,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:29:41,420 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:29:41,420 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 14:29:41,420 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 14:29:41,420 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:29:41,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:29:41,421 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:29:41,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:29:41,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:29:41,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 14:29:41,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:29:41,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:29:41,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:29:41,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:29:41,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:29:41,423 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 14:29:41,423 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 14:29:41,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:29:41,424 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:29:41,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:29:41,425 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_d896ec0d-4b5c-46b6-bd80-2087c698a154/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_d896ec0d-4b5c-46b6-bd80-2087c698a154/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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2021-11-19 14:29:41,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:29:41,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:29:41,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:29:41,855 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:29:41,856 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:29:41,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2021-11-19 14:29:41,922 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/data/d10b8fab4/f7f780d0a00e4b638effe7af28ddba96/FLAG108f1930f [2021-11-19 14:29:42,494 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:29:42,494 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2021-11-19 14:29:42,526 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/data/d10b8fab4/f7f780d0a00e4b638effe7af28ddba96/FLAG108f1930f [2021-11-19 14:29:42,789 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/data/d10b8fab4/f7f780d0a00e4b638effe7af28ddba96 [2021-11-19 14:29:42,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:29:42,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:29:42,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:29:42,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:29:42,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:29:42,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:29:42" (1/1) ... [2021-11-19 14:29:42,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325fd55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:42, skipping insertion in model container [2021-11-19 14:29:42,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:29:42" (1/1) ... [2021-11-19 14:29:42,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:29:42,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:29:43,317 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_d896ec0d-4b5c-46b6-bd80-2087c698a154/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2021-11-19 14:29:43,327 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:29:43,342 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:29:43,414 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_d896ec0d-4b5c-46b6-bd80-2087c698a154/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2021-11-19 14:29:43,416 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:29:43,464 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:29:43,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43 WrapperNode [2021-11-19 14:29:43,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:29:43,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:29:43,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:29:43,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:29:43,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43" (1/1) ... [2021-11-19 14:29:43,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43" (1/1) ... [2021-11-19 14:29:43,560 INFO L137 Inliner]: procedures = 130, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 173 [2021-11-19 14:29:43,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:29:43,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:29:43,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:29:43,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:29:43,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43" (1/1) ... [2021-11-19 14:29:43,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43" (1/1) ... [2021-11-19 14:29:43,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43" (1/1) ... [2021-11-19 14:29:43,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43" (1/1) ... [2021-11-19 14:29:43,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43" (1/1) ... [2021-11-19 14:29:43,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43" (1/1) ... [2021-11-19 14:29:43,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43" (1/1) ... [2021-11-19 14:29:43,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:29:43,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:29:43,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:29:43,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:29:43,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43" (1/1) ... [2021-11-19 14:29:43,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:29:43,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:29:43,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:29:43,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:29:43,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-19 14:29:43,717 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-19 14:29:43,717 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-19 14:29:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-19 14:29:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:29:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 14:29:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-19 14:29:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-19 14:29:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 14:29:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-19 14:29:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-19 14:29:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 14:29:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:29:43,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:29:43,853 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:29:43,862 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:29:44,371 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:29:44,379 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:29:44,384 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-19 14:29:44,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:29:44 BoogieIcfgContainer [2021-11-19 14:29:44,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:29:44,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:29:44,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:29:44,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:29:44,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:29:42" (1/3) ... [2021-11-19 14:29:44,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109e683b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:29:44, skipping insertion in model container [2021-11-19 14:29:44,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:29:43" (2/3) ... [2021-11-19 14:29:44,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109e683b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:29:44, skipping insertion in model container [2021-11-19 14:29:44,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:29:44" (3/3) ... [2021-11-19 14:29:44,396 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2021-11-19 14:29:44,403 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:29:44,403 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:29:44,462 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:29:44,472 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 14:29:44,473 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:29:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 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 14:29:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 14:29:44,497 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:29:44,498 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 14:29:44,498 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:29:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:29:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1111347289, now seen corresponding path program 1 times [2021-11-19 14:29:44,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:29:44,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111536926] [2021-11-19 14:29:44,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:29:44,522 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:29:44,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:29:44,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:29:44,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 14:29:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:29:44,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-19 14:29:44,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:29:44,832 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 14:29:44,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:29:44,943 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 14:29:44,943 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:29:44,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111536926] [2021-11-19 14:29:44,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111536926] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:29:44,945 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:29:44,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-19 14:29:44,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056914595] [2021-11-19 14:29:44,947 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:29:44,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 14:29:44,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:29:45,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 14:29:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 14:29:45,011 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 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 14:29:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:29:45,070 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2021-11-19 14:29:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 14:29:45,072 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 14:29:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:29:45,079 INFO L225 Difference]: With dead ends: 77 [2021-11-19 14:29:45,082 INFO L226 Difference]: Without dead ends: 34 [2021-11-19 14:29:45,085 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 14:29:45,089 INFO L933 BasicCegarLoop]: 55 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, 55 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 14:29:45,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:29:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-11-19 14:29:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-11-19 14:29:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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 14:29:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2021-11-19 14:29:45,126 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 25 [2021-11-19 14:29:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:29:45,127 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-11-19 14:29:45,128 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 14:29:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2021-11-19 14:29:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 14:29:45,130 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:29:45,130 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 14:29:45,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-19 14:29:45,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:29:45,347 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:29:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:29:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash -234931549, now seen corresponding path program 1 times [2021-11-19 14:29:45,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:29:45,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148386581] [2021-11-19 14:29:45,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:29:45,349 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:29:45,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:29:45,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:29:45,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 14:29:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:29:45,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 14:29:45,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:29:45,594 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 14:29:45,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:29:45,709 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 14:29:45,709 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:29:45,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148386581] [2021-11-19 14:29:45,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148386581] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:29:45,710 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:29:45,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-19 14:29:45,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074978800] [2021-11-19 14:29:45,710 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:29:45,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 14:29:45,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:29:45,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 14:29:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-19 14:29:45,713 INFO L87 Difference]: Start difference. First operand 34 states and 44 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 14:29:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:29:45,764 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2021-11-19 14:29:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 14:29:45,766 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 14:29:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:29:45,774 INFO L225 Difference]: With dead ends: 64 [2021-11-19 14:29:45,775 INFO L226 Difference]: Without dead ends: 37 [2021-11-19 14:29:45,776 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 14:29:45,778 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:29:45,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:29:45,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-19 14:29:45,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-11-19 14:29:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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 14:29:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2021-11-19 14:29:45,795 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 25 [2021-11-19 14:29:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:29:45,795 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2021-11-19 14:29:45,796 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 14:29:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2021-11-19 14:29:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-19 14:29:45,799 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:29:45,799 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 14:29:45,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-19 14:29:46,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:29:46,009 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:29:46,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:29:46,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1702704619, now seen corresponding path program 1 times [2021-11-19 14:29:46,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:29:46,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26229923] [2021-11-19 14:29:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:29:46,011 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:29:46,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:29:46,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:29:46,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-19 14:29:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:29:46,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 14:29:46,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:29:46,294 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 14:29:46,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:29:46,814 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 14:29:46,815 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:29:46,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26229923] [2021-11-19 14:29:46,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26229923] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:29:46,815 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:29:46,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-19 14:29:46,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602216603] [2021-11-19 14:29:46,816 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:29:46,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 14:29:46,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:29:46,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 14:29:46,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 14:29:46,817 INFO L87 Difference]: Start difference. First operand 35 states and 45 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 14:29:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:29:46,868 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2021-11-19 14:29:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 14:29:46,873 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 14:29:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:29:46,874 INFO L225 Difference]: With dead ends: 53 [2021-11-19 14:29:46,875 INFO L226 Difference]: Without dead ends: 36 [2021-11-19 14:29:46,875 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 14:29:46,877 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:29:46,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 95 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:29:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-11-19 14:29:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-11-19 14:29:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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 14:29:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2021-11-19 14:29:46,892 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 33 [2021-11-19 14:29:46,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:29:46,893 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2021-11-19 14:29:46,893 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 14:29:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2021-11-19 14:29:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-19 14:29:46,895 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:29:46,896 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 14:29:46,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-19 14:29:47,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:29:47,114 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:29:47,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:29:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1515040147, now seen corresponding path program 1 times [2021-11-19 14:29:47,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:29:47,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463230611] [2021-11-19 14:29:47,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:29:47,116 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:29:47,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:29:47,123 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:29:47,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-19 14:29:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:29:47,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-19 14:29:47,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:29:47,466 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 14:29:47,901 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 14:29:48,078 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-19 14:29:48,079 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 14:29:48,259 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 14:29:48,310 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 14:29:48,584 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-19 14:29:48,585 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 14:29:48,615 INFO L354 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-11-19 14:29:48,616 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 14:29:49,087 INFO L354 Elim1Store]: treesize reduction 41, result has 8.9 percent of original size [2021-11-19 14:29:49,088 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 120 treesize of output 74 [2021-11-19 14:29:49,112 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 14:29:49,113 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 65 treesize of output 61 [2021-11-19 14:29:49,126 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 22 treesize of output 18 [2021-11-19 14:29:49,133 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 11 treesize of output 7 [2021-11-19 14:29:49,134 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 14:29:49,382 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:29:49,387 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-11-19 14:29:52,084 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-19 14:29:52,084 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 181 treesize of output 184 [2021-11-19 14:29:52,345 INFO L354 Elim1Store]: treesize reduction 279, result has 15.2 percent of original size [2021-11-19 14:29:52,346 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 165 treesize of output 142 [2021-11-19 14:29:52,404 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-19 14:29:52,405 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 146 treesize of output 148 [2021-11-19 14:29:52,496 INFO L354 Elim1Store]: treesize reduction 82, result has 23.4 percent of original size [2021-11-19 14:29:52,497 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 111 treesize of output 105 [2021-11-19 14:30:01,311 INFO L354 Elim1Store]: treesize reduction 343, result has 9.7 percent of original size [2021-11-19 14:30:01,312 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 260 treesize of output 198 [2021-11-19 14:30:01,571 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-19 14:30:01,571 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 358 treesize of output 265 [2021-11-19 14:30:01,619 INFO L354 Elim1Store]: treesize reduction 65, result has 14.5 percent of original size [2021-11-19 14:30:01,620 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 335 treesize of output 303 [2021-11-19 14:30:01,647 INFO L354 Elim1Store]: treesize reduction 113, result has 8.9 percent of original size [2021-11-19 14:30:01,648 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 300 treesize of output 228 [2021-11-19 14:30:05,986 INFO L354 Elim1Store]: treesize reduction 81, result has 4.7 percent of original size [2021-11-19 14:30:05,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 239 treesize of output 117 [2021-11-19 14:30:06,018 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-19 14:30:06,020 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 75 [2021-11-19 14:30:06,441 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 14:30:06,539 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 14:30:06,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:30:06,800 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:30:06,802 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-11-19 14:30:06,805 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:30:06,806 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2021-11-19 14:30:08,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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_3)))) (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_2))) (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 14:30:39,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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_3)))) (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_2))) (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 14:30:39,952 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:30:39,953 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 273 [2021-11-19 14:30:39,958 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:30:39,959 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 458 [2021-11-19 14:30:39,964 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:30:39,965 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 565 [2021-11-19 14:30:53,408 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_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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 (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse1 (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|)) (.cse2 (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 ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_3)))) (store .cse0 |c_node_create_#res#1.base| (store (select .cse0 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_node_create_#res#1.base|)))) (store .cse3 |c_node_create_#res#1.base| (store (select .cse3 |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 ((.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_node_create_#res#1.base| (store (select .cse4 |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|))))) (exists ((|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_DerPreprocessor_2 (_ 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_4| (let ((.cse9 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse13 (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)) .cse9 v_DerPreprocessor_6))) (.cse11 (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)) .cse9 v_DerPreprocessor_5)))) (let ((.cse7 (select (select .cse11 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse8 (select (select .cse13 |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 ((.cse5 (let ((.cse6 (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_4) .cse9 |v_node_create_~data#1_26|)))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_DerPreprocessor_3))))) (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_DerPreprocessor_2))) (select (select (let ((.cse10 (store .cse11 .cse7 (store (select .cse11 .cse7) .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse10 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse10 |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 ((.cse12 (store .cse13 .cse7 (store (select .cse13 .cse7) .cse8 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse12 |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|)))))))))))) is different from false [2021-11-19 14:30:55,419 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_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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 (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse1 (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|)) (.cse2 (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 ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_3)))) (store .cse0 |c_node_create_#res#1.base| (store (select .cse0 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_node_create_#res#1.base|)))) (store .cse3 |c_node_create_#res#1.base| (store (select .cse3 |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 ((.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_node_create_#res#1.base| (store (select .cse4 |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|))))) (exists ((|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_DerPreprocessor_2 (_ 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_4| (let ((.cse9 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse13 (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)) .cse9 v_DerPreprocessor_6))) (.cse11 (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)) .cse9 v_DerPreprocessor_5)))) (let ((.cse7 (select (select .cse11 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse8 (select (select .cse13 |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 ((.cse5 (let ((.cse6 (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_4) .cse9 |v_node_create_~data#1_26|)))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_DerPreprocessor_3))))) (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_DerPreprocessor_2))) (select (select (let ((.cse10 (store .cse11 .cse7 (store (select .cse11 .cse7) .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse10 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse10 |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 ((.cse12 (store .cse13 .cse7 (store (select .cse13 .cse7) .cse8 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse12 |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|)))))))))))) is different from true [2021-11-19 14:30:57,093 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:30:57,094 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 824 [2021-11-19 14:30:57,098 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:30:57,100 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 931 [2021-11-19 14:30:57,105 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:30:57,106 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1116 [2021-11-19 14:31:22,393 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_7 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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 (exists ((|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_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 (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (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_6))) (.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_5)))) (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_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_1))))) (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_2 v_prenex_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_2 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 ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_2)))) (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_2 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|)))))))))) (= (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_8))) (.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_9)))) (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_#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_7) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_3))))) (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_2))) (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_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 ((.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_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|))) is different from false [2021-11-19 14:31:24,400 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_7 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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 (exists ((|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_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 (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (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_6))) (.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_5)))) (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_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_1))))) (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_2 v_prenex_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_2 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 ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_2)))) (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_2 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|)))))))))) (= (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_8))) (.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_9)))) (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_#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_7) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_3))))) (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_2))) (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_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 ((.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_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|))) is different from true [2021-11-19 14:32:17,293 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_29| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_29|)))) (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_7 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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 (exists ((|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_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 (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (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_6))) (.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_5)))) (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_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_1))))) (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_2 v_prenex_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_2 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 ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_2)))) (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_2 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| (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_29| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_8))) (.cse15 (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)) .cse13 v_DerPreprocessor_9)))) (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_#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_7) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_3))))) (store .cse9 |v_node_create_~temp~0#1.base_29| (store (select .cse9 |v_node_create_~temp~0#1.base_29|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_node_create_~temp~0#1.base_29|)))) (store .cse14 |v_node_create_~temp~0#1.base_29| (store (select .cse14 |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 (_ 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_29| (store (select .cse16 |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|))))))))) (not (bvult |v_node_create_~temp~0#1.base_29| |c_#StackHeapBarrier|)))) is different from true [2021-11-19 14:32:17,319 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 42773 treesize of output 42177 [2021-11-19 14:32:17,386 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:32:17,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463230611] [2021-11-19 14:32:17,387 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-19 14:32:17,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [148428553] [2021-11-19 14:32:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:32:17,388 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-19 14:32:17,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/cvc4 [2021-11-19 14:32:17,401 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-19 14:32:17,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-19 14:32:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:32:17,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-19 14:32:17,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:32:17,762 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 14:32:18,457 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 14:32:20,855 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-19 14:32:20,856 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 14:32:21,291 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 14:32:21,795 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-19 14:32:21,795 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 53 treesize of output 41 [2021-11-19 14:32:22,903 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 84 treesize of output 68 [2021-11-19 14:32:22,915 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 14:32:22,915 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 68 treesize of output 64 [2021-11-19 14:32:22,927 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 14:32:22,934 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 14:32:22,935 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 14:32:23,471 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:32:23,472 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-11-19 14:32:24,044 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-19 14:32:24,044 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 155 treesize of output 158 [2021-11-19 14:32:24,180 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-19 14:32:24,181 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 139 treesize of output 115 [2021-11-19 14:32:24,239 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-19 14:32:24,239 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 124 treesize of output 126 [2021-11-19 14:32:24,316 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-19 14:32:24,319 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 75 treesize of output 63 [2021-11-19 14:32:24,321 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 14:32:26,311 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-19 14:32:26,312 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 14:32:26,521 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-19 14:32:26,522 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 14:32:26,528 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:32:26,529 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 249 [2021-11-19 14:32:26,599 INFO L354 Elim1Store]: treesize reduction 298, result has 8.3 percent of original size [2021-11-19 14:32:26,599 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 14:32:27,053 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-19 14:32:27,053 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 14:32:27,058 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 14:32:27,421 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 14:32:27,436 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 14:32:27,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:32:27,469 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:32:27,471 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-11-19 14:32:27,475 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:32:27,476 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2021-11-19 14:32:29,533 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_12 (_ 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_13)))) (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_12))) (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 14:32:31,651 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_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_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_13)))) (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_12))) (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 14:32:54,640 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:32:54,641 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 270 [2021-11-19 14:32:54,650 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:32:54,651 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 455 [2021-11-19 14:32:54,655 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:32:54,656 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 562 [2021-11-19 14:33:07,085 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_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|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_DerPreprocessor_2 (_ 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_6))) (.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_5)))) (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_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_3))))) (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_2))) (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_13)))) (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_12))) (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 14:33:09,099 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_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|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_DerPreprocessor_2 (_ 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_6))) (.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_5)))) (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_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_3))))) (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_2))) (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_13)))) (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_12))) (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 14:33:10,688 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:33:10,690 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 824 [2021-11-19 14:33:10,695 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:33:10,697 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1009 [2021-11-19 14:33:10,702 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:33:10,704 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1116 [2021-11-19 14:33:34,695 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_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((|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_DerPreprocessor_2 (_ 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|))))) (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_6))) (.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_5)))) (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_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_3))))) (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_2))) (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|)))))))))) (= (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_19))) (.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_18)))) (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_17) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_13))))) (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_12))) (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 14:33:36,702 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_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((|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_DerPreprocessor_2 (_ 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|))))) (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_6))) (.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_5)))) (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_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_3))))) (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_2))) (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|)))))))))) (= (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_19))) (.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_18)))) (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_17) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_13))))) (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_12))) (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 14:34:34,564 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_33| (_ BitVec 32))) (or (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_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((|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_DerPreprocessor_2 (_ 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|))))) (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_6))) (.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_5)))) (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_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_3))))) (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_2))) (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|)))))))))) (= (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_19))) (.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_18)))) (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_17) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_13))))) (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_12))) (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 (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_33|))) (not (bvult |v_node_create_~temp~0#1.base_33| |c_#StackHeapBarrier|)))) is different from true [2021-11-19 14:34:34,597 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 226481 treesize of output 222149 [2021-11-19 14:34:35,020 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 9204862 treesize of output 9049890 [2021-11-19 14:34:46,390 WARN L227 SmtUtils]: Spent 11.36s on a formula simplification that was a NOOP. DAG size: 2706 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 14:34:57,225 WARN L227 SmtUtils]: Spent 10.82s on a formula simplification that was a NOOP. DAG size: 2703 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 14:34:57,300 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-19 14:34:57,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824724979] [2021-11-19 14:34:57,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:34:57,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:34:57,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:34:57,314 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:34:57,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d896ec0d-4b5c-46b6-bd80-2087c698a154/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 14:34:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:34:57,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-19 14:34:57,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:34:57,473 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 14:34:58,807 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-19 14:34:58,808 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 16 treesize of output 21 [2021-11-19 14:35:00,051 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 14:35:00,548 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-11-19 14:35:00,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 58 [2021-11-19 14:35:01,160 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 14:35:01,771 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-19 14:35:01,771 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 47 treesize of output 35 [2021-11-19 14:35:03,342 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:35:03,343 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-11-19 14:35:06,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:35:06,102 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-19 14:35:06,102 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 26 treesize of output 18 [2021-11-19 14:35:06,153 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-11-19 14:35:06,153 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 100 treesize of output 103 [2021-11-19 14:35:06,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:35:06,183 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-19 14:35:06,184 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 86 treesize of output 70 [2021-11-19 14:35:06,226 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-19 14:35:06,226 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 75 treesize of output 77 [2021-11-19 14:35:07,928 INFO L354 Elim1Store]: treesize reduction 152, result has 16.5 percent of original size [2021-11-19 14:35:07,928 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 213 treesize of output 153 [2021-11-19 14:35:08,102 INFO L354 Elim1Store]: treesize reduction 152, result has 16.5 percent of original size [2021-11-19 14:35:08,103 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 274 treesize of output 197 [2021-11-19 14:35:08,107 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:35:08,108 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 256 [2021-11-19 14:35:08,180 INFO L354 Elim1Store]: treesize reduction 298, result has 8.3 percent of original size [2021-11-19 14:35:08,180 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 256 treesize of output 159 [2021-11-19 14:35:08,740 INFO L354 Elim1Store]: treesize reduction 37, result has 9.8 percent of original size [2021-11-19 14:35:08,741 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 147 treesize of output 81 [2021-11-19 14:35:08,750 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-19 14:35:08,751 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 47 [2021-11-19 14:35:09,073 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 14:35:09,080 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 14:35:09,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:35:09,116 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:35:09,118 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-11-19 14:35:09,120 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:35:09,121 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2021-11-19 14:35:22,185 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:35:22,186 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 267 [2021-11-19 14:35:22,190 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:35:22,192 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 435 [2021-11-19 14:35:22,196 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:35:22,197 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 537 [2021-11-19 14:35:29,554 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_DerPreprocessor_22 (_ 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)) (v_DerPreprocessor_26 (_ BitVec 32))) (let ((.cse5 (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|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_25))) (.cse7 (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|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_26)))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (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|) (_ bv0 32) v_DerPreprocessor_24) (_ bv4 32) |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_23))))) (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_22))) (select (select (let ((.cse4 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse4 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse4 |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 (select (select (let ((.cse6 (store .cse7 .cse2 (store (select .cse7 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse6 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse6 |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|) (_ bv4 32)))) (and (= .cse3 (_ bv0 32)) (= .cse2 (_ bv0 32))) (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 14:36:23,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|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_22 (_ 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_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32))) (let ((.cse2 (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|)) (.cse1 (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|))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_23)))) (store .cse0 |c_node_create_#res#1.base| (store (select .cse0 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_22))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_node_create_#res#1.base|)))) (store .cse3 |c_node_create_#res#1.base| (store (select .cse3 |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_12|)) (bvadd (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_node_create_#res#1.base| (store (select .cse4 |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_12|) (_ bv4 32))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12|) (and (= .cse2 (_ bv0 32)) (= .cse1 (_ bv0 32))) (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_DerPreprocessor_22 (_ 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)) (v_DerPreprocessor_26 (_ BitVec 32))) (let ((.cse12 (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|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_26))) (.cse10 (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|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_25)))) (let ((.cse7 (select (select .cse10 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse8 (select (select .cse12 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (and (not (= (select (select (let ((.cse5 (let ((.cse6 (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|) (_ bv0 32) v_DerPreprocessor_24) (_ bv4 32) |v_node_create_~data#1_34|)))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_DerPreprocessor_23))))) (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_DerPreprocessor_22))) (select (select (let ((.cse9 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse9 |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_12|)) (bvadd (select (select (let ((.cse11 (store .cse12 .cse7 (store (select .cse12 .cse7) .cse8 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse11 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse11 |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_12|) (_ bv4 32))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12|)) (or (not (= .cse7 (_ bv0 32))) (not (= .cse8 (_ bv0 32)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|))))))))))) is different from false [2021-11-19 14:36:25,008 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|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_22 (_ 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_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32))) (let ((.cse2 (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|)) (.cse1 (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|))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_23)))) (store .cse0 |c_node_create_#res#1.base| (store (select .cse0 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_22))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_node_create_#res#1.base|)))) (store .cse3 |c_node_create_#res#1.base| (store (select .cse3 |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_12|)) (bvadd (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_node_create_#res#1.base| (store (select .cse4 |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_12|) (_ bv4 32))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12|) (and (= .cse2 (_ bv0 32)) (= .cse1 (_ bv0 32))) (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_DerPreprocessor_22 (_ 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)) (v_DerPreprocessor_26 (_ BitVec 32))) (let ((.cse12 (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|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_26))) (.cse10 (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|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_25)))) (let ((.cse7 (select (select .cse10 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse8 (select (select .cse12 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (and (not (= (select (select (let ((.cse5 (let ((.cse6 (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|) (_ bv0 32) v_DerPreprocessor_24) (_ bv4 32) |v_node_create_~data#1_34|)))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_DerPreprocessor_23))))) (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_DerPreprocessor_22))) (select (select (let ((.cse9 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse9 |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_12|)) (bvadd (select (select (let ((.cse11 (store .cse12 .cse7 (store (select .cse12 .cse7) .cse8 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse11 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse11 |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_12|) (_ bv4 32))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12|)) (or (not (= .cse7 (_ bv0 32))) (not (= .cse8 (_ bv0 32)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|))))))))))) is different from true [2021-11-19 14:37:18,959 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:37:18,961 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 814 [2021-11-19 14:37:18,964 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:37:18,965 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1012 [2021-11-19 14:37:18,970 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:37:18,972 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1132