./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P --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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:43:34,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:43:34,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:43:34,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:43:34,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:43:34,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:43:34,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:43:34,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:43:34,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:43:34,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:43:34,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:43:34,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:43:34,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:43:34,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:43:34,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:43:34,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:43:34,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:43:34,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:43:34,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:43:34,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:43:34,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:43:34,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:43:34,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:43:34,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:43:34,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:43:34,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:43:34,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:43:34,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:43:34,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:43:34,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:43:34,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:43:34,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:43:34,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:43:34,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:43:34,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:43:34,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:43:34,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:43:34,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:43:34,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:43:34,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:43:34,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:43:34,347 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 00:43:34,413 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:43:34,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:43:34,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:43:34,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:43:34,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:43:34,415 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:43:34,416 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:43:34,416 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:43:34,416 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:43:34,417 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:43:34,417 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:43:34,417 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:43:34,418 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:43:34,418 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:43:34,418 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:43:34,419 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:43:34,419 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:43:34,419 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:43:34,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:43:34,421 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:43:34,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:43:34,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:43:34,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:43:34,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:43:34,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:43:34,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:43:34,423 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:43:34,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:43:34,423 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:43:34,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:43:34,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:43:34,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:43:34,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:43:34,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:43:34,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:43:34,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:43:34,426 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:43:34,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:43:34,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:43:34,427 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:43:34,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:43:34,428 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_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/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_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2021-11-21 00:43:34,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:43:34,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:43:34,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:43:34,761 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:43:34,762 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:43:34,763 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2021-11-21 00:43:34,861 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/data/ebd6057ec/a765e285324a4a8cbe9ee0323d010b3f/FLAG16857b011 [2021-11-21 00:43:35,583 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:43:35,583 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2021-11-21 00:43:35,623 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/data/ebd6057ec/a765e285324a4a8cbe9ee0323d010b3f/FLAG16857b011 [2021-11-21 00:43:35,851 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/data/ebd6057ec/a765e285324a4a8cbe9ee0323d010b3f [2021-11-21 00:43:35,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:43:35,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:43:35,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:43:35,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:43:35,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:43:35,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:43:35" (1/1) ... [2021-11-21 00:43:35,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d395734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:35, skipping insertion in model container [2021-11-21 00:43:35,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:43:35" (1/1) ... [2021-11-21 00:43:35,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:43:35,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:43:36,458 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_5e40bcb4-4d9d-4963-a91f-09daa64725d5/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2021-11-21 00:43:36,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:43:36,484 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:43:36,575 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_5e40bcb4-4d9d-4963-a91f-09daa64725d5/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2021-11-21 00:43:36,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:43:36,625 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:43:36,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36 WrapperNode [2021-11-21 00:43:36,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:43:36,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:43:36,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:43:36,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:43:36,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36" (1/1) ... [2021-11-21 00:43:36,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36" (1/1) ... [2021-11-21 00:43:36,728 INFO L137 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 148 [2021-11-21 00:43:36,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:43:36,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:43:36,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:43:36,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:43:36,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36" (1/1) ... [2021-11-21 00:43:36,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36" (1/1) ... [2021-11-21 00:43:36,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36" (1/1) ... [2021-11-21 00:43:36,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36" (1/1) ... [2021-11-21 00:43:36,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36" (1/1) ... [2021-11-21 00:43:36,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36" (1/1) ... [2021-11-21 00:43:36,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36" (1/1) ... [2021-11-21 00:43:36,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:43:36,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:43:36,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:43:36,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:43:36,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36" (1/1) ... [2021-11-21 00:43:36,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:43:36,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:43:36,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:43:36,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:43:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 00:43:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 00:43:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 00:43:36,917 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 00:43:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 00:43:36,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:43:36,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:43:36,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 00:43:36,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 00:43:36,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:43:36,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 00:43:36,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 00:43:36,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:43:36,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:43:37,119 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:43:37,121 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:43:37,385 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:43:37,449 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:43:37,450 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-21 00:43:37,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:43:37 BoogieIcfgContainer [2021-11-21 00:43:37,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:43:37,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:43:37,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:43:37,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:43:37,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:43:35" (1/3) ... [2021-11-21 00:43:37,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c907de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:43:37, skipping insertion in model container [2021-11-21 00:43:37,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:43:36" (2/3) ... [2021-11-21 00:43:37,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c907de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:43:37, skipping insertion in model container [2021-11-21 00:43:37,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:43:37" (3/3) ... [2021-11-21 00:43:37,463 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2021-11-21 00:43:37,470 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:43:37,470 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:43:37,559 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:43:37,567 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-21 00:43:37,567 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:43:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 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-21 00:43:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-21 00:43:37,620 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:43:37,621 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:43:37,622 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:43:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:43:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash 24431895, now seen corresponding path program 1 times [2021-11-21 00:43:37,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:43:37,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970544180] [2021-11-21 00:43:37,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:43:37,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:43:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:43:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:43:37,885 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:43:37,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970544180] [2021-11-21 00:43:37,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970544180] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:43:37,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:43:37,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 00:43:37,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712221240] [2021-11-21 00:43:37,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:43:37,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:43:37,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:43:37,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:43:37,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:43:37,928 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 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) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:43:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:43:38,002 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2021-11-21 00:43:38,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:43:38,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-11-21 00:43:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:43:38,013 INFO L225 Difference]: With dead ends: 43 [2021-11-21 00:43:38,013 INFO L226 Difference]: Without dead ends: 21 [2021-11-21 00:43:38,016 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-21 00:43:38,020 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 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.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:43:38,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:43:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-21 00:43:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-11-21 00:43:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-21 00:43:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2021-11-21 00:43:38,061 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 11 [2021-11-21 00:43:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:43:38,061 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-11-21 00:43:38,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:43:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2021-11-21 00:43:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 00:43:38,064 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:43:38,064 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:43:38,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:43:38,065 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:43:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:43:38,068 INFO L85 PathProgramCache]: Analyzing trace with hash -683449569, now seen corresponding path program 1 times [2021-11-21 00:43:38,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:43:38,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644963] [2021-11-21 00:43:38,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:43:38,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:43:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:43:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:43:38,172 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:43:38,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644963] [2021-11-21 00:43:38,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644963] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:43:38,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525335333] [2021-11-21 00:43:38,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:43:38,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:43:38,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:43:38,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:43:38,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 00:43:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:43:38,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:43:38,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:43:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:43:38,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:43:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:43:38,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525335333] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:43:38,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1785497682] [2021-11-21 00:43:38,606 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-21 00:43:38,606 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 00:43:38,611 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 00:43:38,618 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 00:43:38,620 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 00:43:38,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:38,790 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-21 00:43:38,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2021-11-21 00:43:38,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:38,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-21 00:43:39,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 00:43:39,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-21 00:43:39,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:39,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-11-21 00:43:39,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:39,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-21 00:43:39,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:39,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-21 00:43:39,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:39,347 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:43:39,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2021-11-21 00:43:39,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:39,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:39,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:43:39,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:39,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:39,663 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:43:39,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:43:39,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:39,767 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:43:39,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2021-11-21 00:43:39,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:39,866 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 27 treesize of output 11 [2021-11-21 00:43:39,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:39,900 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 21 treesize of output 13 [2021-11-21 00:43:39,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:39,985 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 21 treesize of output 13 [2021-11-21 00:43:40,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:43:40,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 00:43:40,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:43:41,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:43:41,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 00:43:41,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:41,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:41,115 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:43:41,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:43:41,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:41,145 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:43:41,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2021-11-21 00:43:41,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:41,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:41,633 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:43:41,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:43:41,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:41,661 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:43:41,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2021-11-21 00:43:41,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:43:41,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 00:43:41,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 00:43:41,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:43:41,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:43:42,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:42,040 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 213 treesize of output 193 [2021-11-21 00:43:42,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:42,061 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 0 case distinctions, treesize of input 194 treesize of output 182 [2021-11-21 00:43:42,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:42,079 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 0 case distinctions, treesize of input 185 treesize of output 173 [2021-11-21 00:43:42,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:42,872 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 27 treesize of output 19 [2021-11-21 00:43:42,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:42,909 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 21 treesize of output 13 [2021-11-21 00:43:42,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:42,928 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 27 treesize of output 11 [2021-11-21 00:43:43,940 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 7 treesize of output 3 [2021-11-21 00:43:44,061 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 7 treesize of output 3 [2021-11-21 00:43:44,396 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 7 treesize of output 3 [2021-11-21 00:43:44,431 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 7 treesize of output 3 [2021-11-21 00:43:45,026 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-21 00:43:45,058 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-21 00:43:45,081 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-21 00:43:45,271 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 50 for LOIs [2021-11-21 00:43:47,073 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 00:43:51,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1785497682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:43:51,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:43:51,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 4, 4] total 13 [2021-11-21 00:43:51,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486063073] [2021-11-21 00:43:51,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:43:51,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-21 00:43:51,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:43:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-21 00:43:51,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:43:51,704 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-21 00:43:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:43:52,001 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2021-11-21 00:43:52,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-21 00:43:52,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 17 [2021-11-21 00:43:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:43:52,003 INFO L225 Difference]: With dead ends: 28 [2021-11-21 00:43:52,003 INFO L226 Difference]: Without dead ends: 20 [2021-11-21 00:43:52,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:43:52,005 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:43:52,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 23 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2021-11-21 00:43:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-21 00:43:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-21 00:43:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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-21 00:43:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2021-11-21 00:43:52,014 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 17 [2021-11-21 00:43:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:43:52,014 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-11-21 00:43:52,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-21 00:43:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2021-11-21 00:43:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-21 00:43:52,016 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:43:52,016 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:43:52,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:43:52,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:43:52,245 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:43:52,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:43:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash 189853392, now seen corresponding path program 1 times [2021-11-21 00:43:52,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:43:52,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203449989] [2021-11-21 00:43:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:43:52,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:43:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:43:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 00:43:52,322 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:43:52,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203449989] [2021-11-21 00:43:52,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203449989] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:43:52,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983871278] [2021-11-21 00:43:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:43:52,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:43:52,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:43:52,330 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:43:52,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 00:43:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:43:52,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:43:52,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:43:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:43:52,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:43:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 00:43:52,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983871278] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:43:52,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [880574950] [2021-11-21 00:43:52,544 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-21 00:43:52,544 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 00:43:52,545 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 00:43:52,545 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 00:43:52,545 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 00:43:52,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:52,602 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-21 00:43:52,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2021-11-21 00:43:52,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:52,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:52,676 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-21 00:43:52,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2021-11-21 00:43:52,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 00:43:52,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-21 00:43:52,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:52,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-21 00:43:52,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:52,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-11-21 00:43:52,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:52,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-21 00:43:53,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:53,041 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:43:53,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2021-11-21 00:43:53,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:53,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:53,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:43:53,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:53,255 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:43:53,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2021-11-21 00:43:53,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:53,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:53,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:43:53,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:53,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:53,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 217 [2021-11-21 00:43:53,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:53,455 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 204 [2021-11-21 00:43:53,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:53,469 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 118 [2021-11-21 00:43:54,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:43:54,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 00:43:54,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 00:43:54,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:43:54,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:43:54,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:54,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:54,857 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:43:54,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:43:54,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:54,882 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:43:54,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2021-11-21 00:43:55,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:55,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:55,833 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:43:55,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:43:55,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:55,865 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:43:55,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2021-11-21 00:43:55,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 00:43:55,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:43:55,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:43:55,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 00:43:55,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:43:56,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:56,099 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 191 treesize of output 171 [2021-11-21 00:43:56,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:56,113 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 0 case distinctions, treesize of input 172 treesize of output 160 [2021-11-21 00:43:56,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:56,126 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 0 case distinctions, treesize of input 163 treesize of output 151 [2021-11-21 00:43:56,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:56,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:43:56,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 131 [2021-11-21 00:43:56,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:56,884 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 118 [2021-11-21 00:43:56,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:43:56,905 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 54 [2021-11-21 00:43:57,801 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 7 treesize of output 3 [2021-11-21 00:43:57,992 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 7 treesize of output 3 [2021-11-21 00:43:58,221 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 7 treesize of output 3 [2021-11-21 00:43:58,285 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 7 treesize of output 3 [2021-11-21 00:43:59,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:00,520 INFO L354 Elim1Store]: treesize reduction 143, result has 35.3 percent of original size [2021-11-21 00:44:00,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 373 treesize of output 424 [2021-11-21 00:44:00,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:00,749 INFO L354 Elim1Store]: treesize reduction 109, result has 32.3 percent of original size [2021-11-21 00:44:00,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 426 treesize of output 449 [2021-11-21 00:44:00,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:44:00,865 INFO L354 Elim1Store]: treesize reduction 40, result has 42.0 percent of original size [2021-11-21 00:44:00,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 451 treesize of output 469 [2021-11-21 00:44:01,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:44:01,938 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:44:01,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2021-11-21 00:44:02,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2021-11-21 00:44:02,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:02,337 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 78 treesize of output 58 [2021-11-21 00:44:02,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:02,553 INFO L354 Elim1Store]: treesize reduction 15, result has 48.3 percent of original size [2021-11-21 00:44:02,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 31 [2021-11-21 00:44:03,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:03,027 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:44:03,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2021-11-21 00:44:03,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:44:03,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:03,513 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:44:03,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 10 [2021-11-21 00:44:03,904 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-21 00:44:03,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:04,002 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:44:04,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2021-11-21 00:44:04,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:44:04,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:04,197 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:44:04,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 17 [2021-11-21 00:44:04,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:04,331 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-11-21 00:44:04,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 17 [2021-11-21 00:44:05,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:44:05,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:05,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:05,272 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:44:05,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 42 [2021-11-21 00:44:05,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:44:05,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:05,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:05,697 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:44:05,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 42 [2021-11-21 00:44:06,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:44:06,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:06,176 INFO L354 Elim1Store]: treesize reduction 44, result has 40.5 percent of original size [2021-11-21 00:44:06,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 223 treesize of output 230 [2021-11-21 00:44:06,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:06,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:06,733 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:44:06,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 28 [2021-11-21 00:44:07,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:44:07,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:07,135 INFO L354 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2021-11-21 00:44:07,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 243 treesize of output 233 [2021-11-21 00:44:07,315 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-21 00:44:07,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:07,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:07,637 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:44:07,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 13 [2021-11-21 00:44:10,899 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 50 for LOIs [2021-11-21 00:44:12,729 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 00:44:18,832 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-21 00:44:18,832 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:44:18,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-11-21 00:44:18,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043239059] [2021-11-21 00:44:18,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:44:18,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:44:18,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:44:18,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:44:18,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-11-21 00:44:18,835 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-21 00:44:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:44:18,884 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-11-21 00:44:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:44:18,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2021-11-21 00:44:18,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:44:18,886 INFO L225 Difference]: With dead ends: 38 [2021-11-21 00:44:18,886 INFO L226 Difference]: Without dead ends: 23 [2021-11-21 00:44:18,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-11-21 00:44:18,888 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:44:18,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:44:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-11-21 00:44:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-11-21 00:44:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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-21 00:44:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2021-11-21 00:44:18,897 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 18 [2021-11-21 00:44:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:44:18,897 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2021-11-21 00:44:18,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-21 00:44:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2021-11-21 00:44:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-21 00:44:18,899 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:44:18,899 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:44:18,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-21 00:44:19,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-21 00:44:19,105 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:44:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:44:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash -518586424, now seen corresponding path program 2 times [2021-11-21 00:44:19,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:44:19,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225376271] [2021-11-21 00:44:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:44:19,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:44:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:44:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:44:20,068 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:44:20,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225376271] [2021-11-21 00:44:20,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225376271] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:44:20,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23682735] [2021-11-21 00:44:20,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 00:44:20,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:44:20,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:44:20,070 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:44:20,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-21 00:44:20,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-21 00:44:20,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:44:20,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 98 conjunts are in the unsatisfiable core [2021-11-21 00:44:20,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:44:20,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 00:44:20,425 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-21 00:44:20,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:20,529 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 27 treesize of output 11 [2021-11-21 00:44:20,737 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 48 treesize of output 32 [2021-11-21 00:44:20,744 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 32 treesize of output 28 [2021-11-21 00:44:20,750 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-21 00:44:20,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2021-11-21 00:44:21,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:21,939 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 26 treesize of output 18 [2021-11-21 00:44:21,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:21,955 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 75 treesize of output 55 [2021-11-21 00:44:21,974 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-11-21 00:44:21,975 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 64 treesize of output 67 [2021-11-21 00:44:21,988 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-21 00:44:21,988 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 50 treesize of output 50 [2021-11-21 00:44:22,479 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:44:22,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 147 [2021-11-21 00:44:22,491 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:44:22,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 125 [2021-11-21 00:44:22,525 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-21 00:44:22,525 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 120 treesize of output 97 [2021-11-21 00:44:22,620 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-21 00:44:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:44:22,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:44:22,713 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-21 00:44:22,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [808865664] [2021-11-21 00:44:22,716 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-21 00:44:22,716 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 00:44:22,717 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 00:44:22,717 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 00:44:22,717 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 00:44:22,741 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@768b7542 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.applyComplexEliminationRules(ElimStorePlain.java:388) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:278) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:264) 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-21 00:44:22,744 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-21 00:44:22,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-11-21 00:44:22,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939676270] [2021-11-21 00:44:22,745 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-21 00:44:22,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-21 00:44:22,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:44:22,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-21 00:44:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2021-11-21 00:44:22,748 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 16 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-21 00:44:22,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 00:44:22,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2021-11-21 00:44:22,750 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-21 00:44:22,751 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-21 00:44:22,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-21 00:44:22,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:44:22,977 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@768b7542 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-21 00:44:22,980 INFO L158 Benchmark]: Toolchain (without parser) took 47123.67ms. Allocated memory was 94.4MB in the beginning and 262.1MB in the end (delta: 167.8MB). Free memory was 59.0MB in the beginning and 169.1MB in the end (delta: -110.1MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2021-11-21 00:44:22,980 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 94.4MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:44:22,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 768.97ms. Allocated memory is still 94.4MB. Free memory was 58.9MB in the beginning and 61.1MB in the end (delta: -2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 00:44:22,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.48ms. Allocated memory is still 94.4MB. Free memory was 61.1MB in the beginning and 58.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:44:22,981 INFO L158 Benchmark]: Boogie Preprocessor took 79.05ms. Allocated memory is still 94.4MB. Free memory was 58.7MB in the beginning and 56.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:44:22,981 INFO L158 Benchmark]: RCFGBuilder took 641.48ms. Allocated memory is still 94.4MB. Free memory was 56.9MB in the beginning and 40.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-21 00:44:22,982 INFO L158 Benchmark]: TraceAbstraction took 45524.01ms. Allocated memory was 94.4MB in the beginning and 262.1MB in the end (delta: 167.8MB). Free memory was 39.5MB in the beginning and 169.1MB in the end (delta: -129.6MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2021-11-21 00:44:22,984 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.38ms. Allocated memory is still 94.4MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 768.97ms. Allocated memory is still 94.4MB. Free memory was 58.9MB in the beginning and 61.1MB in the end (delta: -2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.48ms. Allocated memory is still 94.4MB. Free memory was 61.1MB in the beginning and 58.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.05ms. Allocated memory is still 94.4MB. Free memory was 58.7MB in the beginning and 56.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 641.48ms. Allocated memory is still 94.4MB. Free memory was 56.9MB in the beginning and 40.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45524.01ms. Allocated memory was 94.4MB in the beginning and 262.1MB in the end (delta: 167.8MB). Free memory was 39.5MB in the beginning and 169.1MB in the end (delta: -129.6MB). Peak memory consumption was 40.4MB. 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@768b7542 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@768b7542: 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-21 00:44:23,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/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_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P --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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:44:25,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:44:25,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:44:25,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:44:25,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:44:25,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:44:25,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:44:25,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:44:25,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:44:25,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:44:25,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:44:25,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:44:25,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:44:25,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:44:25,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:44:25,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:44:25,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:44:25,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:44:25,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:44:25,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:44:25,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:44:25,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:44:25,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:44:25,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:44:25,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:44:25,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:44:25,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:44:25,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:44:25,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:44:25,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:44:25,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:44:25,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:44:25,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:44:25,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:44:25,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:44:25,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:44:25,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:44:25,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:44:25,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:44:25,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:44:25,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:44:25,792 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-21 00:44:25,840 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:44:25,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:44:25,841 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:44:25,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:44:25,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:44:25,843 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:44:25,843 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:44:25,843 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:44:25,844 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:44:25,844 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:44:25,845 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:44:25,845 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:44:25,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:44:25,847 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:44:25,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:44:25,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:44:25,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:44:25,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:44:25,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:44:25,849 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 00:44:25,849 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 00:44:25,849 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:44:25,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:44:25,850 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:44:25,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:44:25,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:44:25,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 00:44:25,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:44:25,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:44:25,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:44:25,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:44:25,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:44:25,852 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 00:44:25,852 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 00:44:25,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:44:25,853 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:44:25,853 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:44:25,853 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_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/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_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2021-11-21 00:44:26,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:44:26,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:44:26,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:44:26,309 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:44:26,310 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:44:26,312 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2021-11-21 00:44:26,387 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/data/a6c70ec97/0666c2d4a66b4e2c86199bb17c83b431/FLAGcbecb4cdb [2021-11-21 00:44:27,012 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:44:27,013 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2021-11-21 00:44:27,030 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/data/a6c70ec97/0666c2d4a66b4e2c86199bb17c83b431/FLAGcbecb4cdb [2021-11-21 00:44:27,297 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/data/a6c70ec97/0666c2d4a66b4e2c86199bb17c83b431 [2021-11-21 00:44:27,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:44:27,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:44:27,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:44:27,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:44:27,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:44:27,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:27,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@684171b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27, skipping insertion in model container [2021-11-21 00:44:27,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:27,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:44:27,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:44:27,775 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_5e40bcb4-4d9d-4963-a91f-09daa64725d5/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2021-11-21 00:44:27,779 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:44:27,793 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:44:27,846 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_5e40bcb4-4d9d-4963-a91f-09daa64725d5/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2021-11-21 00:44:27,847 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:44:27,886 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:44:27,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27 WrapperNode [2021-11-21 00:44:27,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:44:27,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:44:27,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:44:27,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:44:27,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:27,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:27,952 INFO L137 Inliner]: procedures = 131, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2021-11-21 00:44:27,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:44:27,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:44:27,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:44:27,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:44:27,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:27,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:27,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:27,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:27,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:28,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:28,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:28,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:44:28,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:44:28,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:44:28,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:44:28,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27" (1/1) ... [2021-11-21 00:44:28,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:44:28,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:44:28,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:44:28,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:44:28,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-21 00:44:28,103 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 00:44:28,103 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 00:44:28,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 00:44:28,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:44:28,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:44:28,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 00:44:28,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 00:44:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:44:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-21 00:44:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 00:44:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 00:44:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:44:28,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:44:28,305 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:44:28,307 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:44:28,879 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:44:28,887 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:44:28,893 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-21 00:44:28,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:44:28 BoogieIcfgContainer [2021-11-21 00:44:28,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:44:28,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:44:28,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:44:28,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:44:28,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:44:27" (1/3) ... [2021-11-21 00:44:28,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11413299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:44:28, skipping insertion in model container [2021-11-21 00:44:28,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:27" (2/3) ... [2021-11-21 00:44:28,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11413299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:44:28, skipping insertion in model container [2021-11-21 00:44:28,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:44:28" (3/3) ... [2021-11-21 00:44:28,909 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2021-11-21 00:44:28,917 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:44:28,917 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:44:29,002 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:44:29,025 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-21 00:44:29,025 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:44:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 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-21 00:44:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-21 00:44:29,056 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:44:29,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:44:29,057 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:44:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:44:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash -246443823, now seen corresponding path program 1 times [2021-11-21 00:44:29,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:44:29,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204993719] [2021-11-21 00:44:29,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:44:29,092 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:44:29,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:44:29,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:44:29,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 00:44:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:44:29,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-21 00:44:29,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:44:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:44:29,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:44:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:44:29,554 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:44:29,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204993719] [2021-11-21 00:44:29,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204993719] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:44:29,556 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:44:29,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 00:44:29,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859310109] [2021-11-21 00:44:29,560 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:44:29,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 00:44:29,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:44:29,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 00:44:29,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:44:29,624 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 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) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:44:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:44:29,677 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2021-11-21 00:44:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 00:44:29,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2021-11-21 00:44:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:44:29,693 INFO L225 Difference]: With dead ends: 62 [2021-11-21 00:44:29,693 INFO L226 Difference]: Without dead ends: 28 [2021-11-21 00:44:29,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 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-21 00:44:29,707 INFO L933 BasicCegarLoop]: 44 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, 44 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-21 00:44:29,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:44:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-11-21 00:44:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-11-21 00:44:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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-21 00:44:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-11-21 00:44:29,756 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 19 [2021-11-21 00:44:29,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:44:29,757 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-11-21 00:44:29,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:44:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2021-11-21 00:44:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-21 00:44:29,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:44:29,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:44:29,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-21 00:44:29,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:44:29,977 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:44:29,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:44:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1738034235, now seen corresponding path program 1 times [2021-11-21 00:44:29,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:44:29,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364897985] [2021-11-21 00:44:29,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:44:29,983 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:44:29,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:44:29,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:44:30,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 00:44:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:44:30,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 00:44:30,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:44:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:44:30,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:44:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:44:30,339 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:44:30,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364897985] [2021-11-21 00:44:30,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364897985] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:44:30,340 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:44:30,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 00:44:30,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299592695] [2021-11-21 00:44:30,342 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:44:30,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:44:30,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:44:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:44:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:44:30,349 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:44:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:44:30,394 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2021-11-21 00:44:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:44:30,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2021-11-21 00:44:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:44:30,396 INFO L225 Difference]: With dead ends: 55 [2021-11-21 00:44:30,397 INFO L226 Difference]: Without dead ends: 33 [2021-11-21 00:44:30,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-21 00:44:30,399 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:44:30,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:44:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-11-21 00:44:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-11-21 00:44:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-21 00:44:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2021-11-21 00:44:30,411 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 19 [2021-11-21 00:44:30,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:44:30,411 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2021-11-21 00:44:30,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:44:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2021-11-21 00:44:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-21 00:44:30,414 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:44:30,417 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:44:30,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 00:44:30,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:44:30,633 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:44:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:44:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1136271419, now seen corresponding path program 1 times [2021-11-21 00:44:30,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:44:30,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889050535] [2021-11-21 00:44:30,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:44:30,635 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:44:30,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:44:30,637 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:44:30,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 00:44:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:44:30,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:44:30,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:44:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-21 00:44:31,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:44:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-21 00:44:31,890 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:44:31,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889050535] [2021-11-21 00:44:31,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889050535] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:44:31,891 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:44:31,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-21 00:44:31,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903155580] [2021-11-21 00:44:31,891 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:44:31,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:44:31,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:44:31,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:44:31,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:44:31,894 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 00:44:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:44:31,963 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2021-11-21 00:44:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:44:31,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2021-11-21 00:44:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:44:31,966 INFO L225 Difference]: With dead ends: 46 [2021-11-21 00:44:31,966 INFO L226 Difference]: Without dead ends: 34 [2021-11-21 00:44:31,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:44:31,969 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 42 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:44:31,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:44:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-11-21 00:44:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-11-21 00:44:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 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-21 00:44:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-11-21 00:44:31,981 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 37 [2021-11-21 00:44:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:44:31,983 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-11-21 00:44:31,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 00:44:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2021-11-21 00:44:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-21 00:44:31,988 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:44:31,988 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:44:32,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 00:44:32,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:44:32,206 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:44:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:44:32,206 INFO L85 PathProgramCache]: Analyzing trace with hash -300753136, now seen corresponding path program 1 times [2021-11-21 00:44:32,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:44:32,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093648866] [2021-11-21 00:44:32,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:44:32,208 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:44:32,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:44:32,212 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:44:32,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 00:44:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:44:32,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-21 00:44:32,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:44:32,843 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-21 00:44:32,975 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-21 00:44:33,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:44:33,258 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 27 treesize of output 11 [2021-11-21 00:44:33,292 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 13 treesize of output 9 [2021-11-21 00:44:33,800 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 46 treesize of output 34 [2021-11-21 00:44:33,808 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 34 treesize of output 30 [2021-11-21 00:44:33,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2021-11-21 00:44:33,827 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-21 00:44:37,005 INFO L354 Elim1Store]: treesize reduction 108, result has 16.3 percent of original size [2021-11-21 00:44:37,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 121 [2021-11-21 00:44:37,164 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 00:44:37,165 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 102 treesize of output 86 [2021-11-21 00:44:37,206 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-21 00:44:37,207 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 91 treesize of output 91 [2021-11-21 00:44:37,329 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 00:44:37,330 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 67 [2021-11-21 00:44:38,488 INFO L354 Elim1Store]: treesize reduction 92, result has 15.6 percent of original size [2021-11-21 00:44:38,488 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 3 case distinctions, treesize of input 147 treesize of output 116 [2021-11-21 00:44:38,587 INFO L354 Elim1Store]: treesize reduction 84, result has 16.8 percent of original size [2021-11-21 00:44:38,588 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 3 case distinctions, treesize of input 139 treesize of output 124 [2021-11-21 00:44:38,631 INFO L354 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2021-11-21 00:44:38,632 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 131 treesize of output 95 [2021-11-21 00:44:39,239 INFO L354 Elim1Store]: treesize reduction 134, result has 21.2 percent of original size [2021-11-21 00:44:39,240 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 313 treesize of output 165 [2021-11-21 00:44:39,539 INFO L354 Elim1Store]: treesize reduction 124, result has 21.5 percent of original size [2021-11-21 00:44:39,540 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 280 treesize of output 198 [2021-11-21 00:44:39,589 INFO L354 Elim1Store]: treesize reduction 131, result has 7.7 percent of original size [2021-11-21 00:44:39,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 161 [2021-11-21 00:44:39,849 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-11-21 00:44:39,850 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 82 treesize of output 41 [2021-11-21 00:44:39,858 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-21 00:44:40,094 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-21 00:44:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:44:40,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:44:45,037 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_insert_~last~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~last~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse2 v_DerPreprocessor_3)))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 |ULTIMATE.start_sll_insert_~last~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse2 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 |ULTIMATE.start_sll_insert_~last~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-21 00:45:01,307 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) .cse3 v_DerPreprocessor_3)))) (store .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)))) (store .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse5 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-21 00:45:25,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_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_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) .cse3 v_DerPreprocessor_3)))) (store .cse0 |c_node_create_#res#1.base| (store (select .cse0 |c_node_create_#res#1.base|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 |c_node_create_#res#1.base|)))) (store .cse4 |c_node_create_#res#1.base| (store (select .cse4 |c_node_create_#res#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse5 |c_node_create_#res#1.base| (store (select .cse5 |c_node_create_#res#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|))) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|) (not (= (let ((.cse11 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse15 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse13 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse7 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse9 (select (select .cse13 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse10 (bvadd (_ bv4 32) (select (select .cse15 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)))) (select (select (let ((.cse6 (let ((.cse8 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 v_DerPreprocessor_3))))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse7 v_DerPreprocessor_2))) (select (select (let ((.cse12 (store .cse13 .cse9 (store (select .cse13 .cse9) .cse10 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse12 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse12 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse7 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)) (select (select (let ((.cse14 (store .cse15 .cse9 (store (select .cse15 .cse9) .cse10 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse7 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)))))) is different from false [2021-11-21 00:45:27,654 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_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_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) .cse3 v_DerPreprocessor_3)))) (store .cse0 |c_node_create_#res#1.base| (store (select .cse0 |c_node_create_#res#1.base|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 |c_node_create_#res#1.base|)))) (store .cse4 |c_node_create_#res#1.base| (store (select .cse4 |c_node_create_#res#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse5 |c_node_create_#res#1.base| (store (select .cse5 |c_node_create_#res#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|))) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|) (not (= (let ((.cse11 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse15 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse13 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse7 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse9 (select (select .cse13 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse10 (bvadd (_ bv4 32) (select (select .cse15 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)))) (select (select (let ((.cse6 (let ((.cse8 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 v_DerPreprocessor_3))))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse7 v_DerPreprocessor_2))) (select (select (let ((.cse12 (store .cse13 .cse9 (store (select .cse13 .cse9) .cse10 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse12 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse12 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse7 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)) (select (select (let ((.cse14 (store .cse15 .cse9 (store (select .cse15 .cse9) .cse10 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse7 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)))))) is different from true [2021-11-21 00:45:51,657 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2| (_ 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_insert_~head#1.base_BEFORE_CALL_2| (_ 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))) (or (= (let ((.cse5 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse9 (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|) .cse5 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_9))) (.cse7 (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|) .cse5 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_8)))) (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse3 (select (select .cse7 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse9 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) .cse5 v_DerPreprocessor_7) |node_create_~temp~0#1.offset| |node_create_~data#1|)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_DerPreprocessor_3))))) (store .cse0 |c_node_create_~temp~0#1.base| (store (select .cse0 |c_node_create_~temp~0#1.base|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |c_node_create_~temp~0#1.base|)))) (store .cse6 |c_node_create_~temp~0#1.base| (store (select .cse6 |c_node_create_~temp~0#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)) (select (select (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse8 |c_node_create_~temp~0#1.base| (store (select .cse8 |c_node_create_~temp~0#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|))) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse15 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse19 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse15 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse17 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse15 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse11 (bvadd (_ bv4 32) v_prenex_1)) (.cse13 (select (select .cse17 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse14 (bvadd (_ bv4 32) (select (select .cse19 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)))) (select (select (let ((.cse10 (let ((.cse12 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse15 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_prenex_2))))) (store .cse10 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse10 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_prenex_4))) (select (select (let ((.cse16 (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse16 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse16 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_prenex_3))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)) (select (select (let ((.cse18 (store .cse19 .cse13 (store (select .cse19 .cse13) .cse14 v_prenex_1)))) (store .cse18 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse18 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|))))))))))) is different from false [2021-11-21 00:45:53,669 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2| (_ 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_insert_~head#1.base_BEFORE_CALL_2| (_ 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))) (or (= (let ((.cse5 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse9 (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|) .cse5 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_9))) (.cse7 (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|) .cse5 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_8)))) (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse3 (select (select .cse7 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse9 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) .cse5 v_DerPreprocessor_7) |node_create_~temp~0#1.offset| |node_create_~data#1|)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_DerPreprocessor_3))))) (store .cse0 |c_node_create_~temp~0#1.base| (store (select .cse0 |c_node_create_~temp~0#1.base|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |c_node_create_~temp~0#1.base|)))) (store .cse6 |c_node_create_~temp~0#1.base| (store (select .cse6 |c_node_create_~temp~0#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)) (select (select (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse8 |c_node_create_~temp~0#1.base| (store (select .cse8 |c_node_create_~temp~0#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|))) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse15 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse19 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse15 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse17 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse15 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse11 (bvadd (_ bv4 32) v_prenex_1)) (.cse13 (select (select .cse17 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse14 (bvadd (_ bv4 32) (select (select .cse19 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)))) (select (select (let ((.cse10 (let ((.cse12 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse15 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_prenex_2))))) (store .cse10 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse10 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_prenex_4))) (select (select (let ((.cse16 (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse16 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse16 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_prenex_3))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)) (select (select (let ((.cse18 (store .cse19 .cse13 (store (select .cse19 .cse13) .cse14 v_prenex_1)))) (store .cse18 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse18 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|))))))))))) is different from true [2021-11-21 00:47:01,774 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_23|))) (forall ((|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2| (_ 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_insert_~head#1.base_BEFORE_CALL_2| (_ 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))) (or (= (let ((.cse5 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_23| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_23|) .cse5 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_9))) (.cse7 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_23| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_23|) .cse5 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_8)))) (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse3 (select (select .cse7 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse9 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |v_node_create_~temp~0#1.base_23| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_23|) .cse5 v_DerPreprocessor_7) |node_create_~temp~0#1.offset| |node_create_~data#1|)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_DerPreprocessor_3))))) (store .cse0 |v_node_create_~temp~0#1.base_23| (store (select .cse0 |v_node_create_~temp~0#1.base_23|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |v_node_create_~temp~0#1.base_23|)))) (store .cse6 |v_node_create_~temp~0#1.base_23| (store (select .cse6 |v_node_create_~temp~0#1.base_23|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)) (select (select (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse8 |v_node_create_~temp~0#1.base_23| (store (select .cse8 |v_node_create_~temp~0#1.base_23|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|))) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse15 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse19 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse15 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse17 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse15 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse11 (bvadd (_ bv4 32) v_prenex_1)) (.cse13 (select (select .cse17 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse14 (bvadd (_ bv4 32) (select (select .cse19 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|)))) (select (select (let ((.cse10 (let ((.cse12 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse15 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_prenex_2))))) (store .cse10 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse10 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_prenex_4))) (select (select (let ((.cse16 (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse16 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse16 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_prenex_3))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|)) (select (select (let ((.cse18 (store .cse19 .cse13 (store (select .cse19 .cse13) .cse14 v_prenex_1)))) (store .cse18 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse18 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_2|))))))))))) (not (bvult |v_node_create_~temp~0#1.base_23| |c_#StackHeapBarrier|)))) is different from true [2021-11-21 00:47:01,815 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 182469 treesize of output 179777 [2021-11-21 00:47:02,294 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:47:02,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093648866] [2021-11-21 00:47:02,295 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-21 00:47:02,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1125782855] [2021-11-21 00:47:02,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:47:02,296 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:47:02,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:47:02,298 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:47:02,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-21 00:47:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:47:02,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-21 00:47:02,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:47:03,149 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-21 00:47:03,229 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-21 00:47:03,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:47:03,682 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 27 treesize of output 11 [2021-11-21 00:47:04,835 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 45 treesize of output 33 [2021-11-21 00:47:04,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2021-11-21 00:47:04,852 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-21 00:47:04,859 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-21 00:47:05,607 INFO L354 Elim1Store]: treesize reduction 108, result has 16.3 percent of original size [2021-11-21 00:47:05,608 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 117 treesize of output 120 [2021-11-21 00:47:05,707 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 00:47:05,707 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 101 treesize of output 85 [2021-11-21 00:47:05,737 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-21 00:47:05,737 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 90 treesize of output 90 [2021-11-21 00:47:05,849 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 00:47:05,850 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 67 [2021-11-21 00:47:07,346 INFO L354 Elim1Store]: treesize reduction 92, result has 15.6 percent of original size [2021-11-21 00:47:07,347 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 3 case distinctions, treesize of input 147 treesize of output 116 [2021-11-21 00:47:07,427 INFO L354 Elim1Store]: treesize reduction 84, result has 16.8 percent of original size [2021-11-21 00:47:07,427 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 3 case distinctions, treesize of input 139 treesize of output 124 [2021-11-21 00:47:07,461 INFO L354 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2021-11-21 00:47:07,463 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 131 treesize of output 95 [2021-11-21 00:47:08,155 INFO L354 Elim1Store]: treesize reduction 134, result has 21.2 percent of original size [2021-11-21 00:47:08,155 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 313 treesize of output 165 [2021-11-21 00:47:08,332 INFO L354 Elim1Store]: treesize reduction 124, result has 21.5 percent of original size [2021-11-21 00:47:08,333 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 280 treesize of output 198 [2021-11-21 00:47:08,375 INFO L354 Elim1Store]: treesize reduction 131, result has 7.7 percent of original size [2021-11-21 00:47:08,376 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 247 treesize of output 161 [2021-11-21 00:47:08,989 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-11-21 00:47:08,989 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 82 treesize of output 41 [2021-11-21 00:47:08,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-11-21 00:47:09,272 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-21 00:47:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:47:09,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:47:13,763 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_insert_~last~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~last~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse2 v_DerPreprocessor_12)))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 |ULTIMATE.start_sll_insert_~last~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse2 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 |ULTIMATE.start_sll_insert_~last~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-21 00:47:49,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse5 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse7 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse3 (select (select .cse7 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse4 (bvadd (select (select .cse9 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|) (_ bv4 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_DerPreprocessor_3))))) (store .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)) (select (select (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|))))))) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse11 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse13 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)))) (select (select (let ((.cse10 (store |c_#memory_int| .cse12 (store (select |c_#memory_int| .cse12) .cse13 v_DerPreprocessor_3)))) (store .cse10 |c_node_create_#res#1.base| (store (select .cse10 |c_node_create_#res#1.base|) .cse11 v_DerPreprocessor_2))) (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse12 (store (select |c_#memory_$Pointer$.base| .cse12) .cse13 |c_node_create_#res#1.base|)))) (store .cse14 |c_node_create_#res#1.base| (store (select .cse14 |c_node_create_#res#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)) (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse12 (store (select |c_#memory_$Pointer$.offset| .cse12) .cse13 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse15 |c_node_create_#res#1.base| (store (select .cse15 |c_node_create_#res#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)))))) is different from false [2021-11-21 00:47:51,677 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse5 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse7 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse3 (select (select .cse7 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse4 (bvadd (select (select .cse9 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|) (_ bv4 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_DerPreprocessor_3))))) (store .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)) (select (select (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|))))))) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse11 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse13 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)))) (select (select (let ((.cse10 (store |c_#memory_int| .cse12 (store (select |c_#memory_int| .cse12) .cse13 v_DerPreprocessor_3)))) (store .cse10 |c_node_create_#res#1.base| (store (select .cse10 |c_node_create_#res#1.base|) .cse11 v_DerPreprocessor_2))) (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse12 (store (select |c_#memory_$Pointer$.base| .cse12) .cse13 |c_node_create_#res#1.base|)))) (store .cse14 |c_node_create_#res#1.base| (store (select .cse14 |c_node_create_#res#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)) (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse12 (store (select |c_#memory_$Pointer$.offset| .cse12) .cse13 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse15 |c_node_create_#res#1.base| (store (select .cse15 |c_node_create_#res#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)))))) is different from true [2021-11-21 00:48:21,956 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ 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_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32))) (and (not (= (let ((.cse5 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse7 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse1 (bvadd (_ bv4 32) v_prenex_6)) (.cse3 (select (select .cse7 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse4 (bvadd (select (select .cse9 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|) (_ bv4 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_prenex_7))))) (store .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_9))) (select (select (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_8))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)) (select (select (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 v_prenex_6)))) (store .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_10))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|)) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))))) (= (let ((.cse15 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse19 (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|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_18))) (.cse17 (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|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_17)))) (let ((.cse11 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse13 (select (select .cse17 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse14 (bvadd (_ bv4 32) (select (select .cse19 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)))) (select (select (let ((.cse10 (let ((.cse12 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) .cse15 v_DerPreprocessor_16) |node_create_~temp~0#1.offset| |node_create_~data#1|)))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_DerPreprocessor_3))))) (store .cse10 |c_node_create_~temp~0#1.base| (store (select .cse10 |c_node_create_~temp~0#1.base|) .cse11 v_DerPreprocessor_2))) (select (select (let ((.cse16 (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 |c_node_create_~temp~0#1.base|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)) (select (select (let ((.cse18 (store .cse19 .cse13 (store (select .cse19 .cse13) .cse14 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse18 |c_node_create_~temp~0#1.base| (store (select .cse18 |c_node_create_~temp~0#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) is different from false [2021-11-21 00:48:23,961 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ 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_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32))) (and (not (= (let ((.cse5 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse7 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse1 (bvadd (_ bv4 32) v_prenex_6)) (.cse3 (select (select .cse7 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse4 (bvadd (select (select .cse9 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|) (_ bv4 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_prenex_7))))) (store .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_9))) (select (select (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_8))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)) (select (select (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 v_prenex_6)))) (store .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_10))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|)) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))))) (= (let ((.cse15 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse19 (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|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_18))) (.cse17 (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|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_17)))) (let ((.cse11 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse13 (select (select .cse17 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse14 (bvadd (_ bv4 32) (select (select .cse19 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)))) (select (select (let ((.cse10 (let ((.cse12 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) .cse15 v_DerPreprocessor_16) |node_create_~temp~0#1.offset| |node_create_~data#1|)))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_DerPreprocessor_3))))) (store .cse10 |c_node_create_~temp~0#1.base| (store (select .cse10 |c_node_create_~temp~0#1.base|) .cse11 v_DerPreprocessor_2))) (select (select (let ((.cse16 (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 |c_node_create_~temp~0#1.base|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)) (select (select (let ((.cse18 (store .cse19 .cse13 (store (select .cse19 .cse13) .cse14 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse18 |c_node_create_~temp~0#1.base| (store (select .cse18 |c_node_create_~temp~0#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) is different from true [2021-11-21 00:49:30,137 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_27| (_ BitVec 32))) (or (not (bvult |v_node_create_~temp~0#1.base_27| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ 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_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32))) (and (not (= (let ((.cse5 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse7 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse1 (bvadd (_ bv4 32) v_prenex_6)) (.cse3 (select (select .cse7 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse4 (bvadd (select (select .cse9 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|) (_ bv4 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_prenex_7))))) (store .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_9))) (select (select (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_8))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)) (select (select (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 v_prenex_6)))) (store .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_10))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|)) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))))) (= (let ((.cse15 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_27| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_27|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_18))) (.cse17 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_27| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_27|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_17)))) (let ((.cse11 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse13 (select (select .cse17 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse14 (bvadd (_ bv4 32) (select (select .cse19 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_4|)))) (select (select (let ((.cse10 (let ((.cse12 (store |c_#memory_int| |v_node_create_~temp~0#1.base_27| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_27|) .cse15 v_DerPreprocessor_16) |node_create_~temp~0#1.offset| |node_create_~data#1|)))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_DerPreprocessor_3))))) (store .cse10 |v_node_create_~temp~0#1.base_27| (store (select .cse10 |v_node_create_~temp~0#1.base_27|) .cse11 v_DerPreprocessor_2))) (select (select (let ((.cse16 (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 |v_node_create_~temp~0#1.base_27|)))) (store .cse16 |v_node_create_~temp~0#1.base_27| (store (select .cse16 |v_node_create_~temp~0#1.base_27|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|)) (select (select (let ((.cse18 (store .cse19 .cse13 (store (select .cse19 .cse13) .cse14 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse18 |v_node_create_~temp~0#1.base_27| (store (select .cse18 |v_node_create_~temp~0#1.base_27|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_6|))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_27|)))))) is different from true [2021-11-21 00:49:30,171 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 142949 treesize of output 142293 [2021-11-21 00:49:30,732 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 42121135 treesize of output 41175771 [2021-11-21 00:50:18,294 WARN L227 SmtUtils]: Spent 47.55s on a formula simplification that was a NOOP. DAG size: 5976 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-21 00:51:05,104 WARN L227 SmtUtils]: Spent 46.78s on a formula simplification that was a NOOP. DAG size: 5973 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-21 00:51:05,259 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-21 00:51:05,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747830085] [2021-11-21 00:51:05,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:51:05,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:51:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:51:05,266 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:51:05,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e40bcb4-4d9d-4963-a91f-09daa64725d5/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-21 00:51:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:51:05,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-21 00:51:05,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:51:05,996 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-21 00:51:06,343 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-21 00:51:07,000 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 13 treesize of output 9 [2021-11-21 00:51:07,012 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 13 treesize of output 9 [2021-11-21 00:51:07,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:51:07,034 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 27 treesize of output 11 [2021-11-21 00:51:08,189 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 27 treesize of output 23 [2021-11-21 00:51:08,195 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-21 00:51:09,297 INFO L354 Elim1Store]: treesize reduction 108, result has 16.3 percent of original size [2021-11-21 00:51:09,298 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 97 treesize of output 100 [2021-11-21 00:51:09,447 INFO L354 Elim1Store]: treesize reduction 71, result has 32.4 percent of original size [2021-11-21 00:51:09,448 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 81 treesize of output 86 [2021-11-21 00:51:09,538 INFO L354 Elim1Store]: treesize reduction 80, result has 23.8 percent of original size [2021-11-21 00:51:09,539 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 86 treesize of output 86 [2021-11-21 00:51:09,562 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:51:09,562 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 83 treesize of output 83 [2021-11-21 00:51:14,182 INFO L354 Elim1Store]: treesize reduction 80, result has 26.6 percent of original size [2021-11-21 00:51:14,183 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 3 case distinctions, treesize of input 158 treesize of output 147 [2021-11-21 00:51:14,405 INFO L354 Elim1Store]: treesize reduction 58, result has 42.6 percent of original size [2021-11-21 00:51:14,406 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 3 case distinctions, treesize of input 166 treesize of output 173 [2021-11-21 00:51:14,512 INFO L354 Elim1Store]: treesize reduction 33, result has 38.9 percent of original size [2021-11-21 00:51:14,512 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 171 treesize of output 157 [2021-11-21 00:51:21,026 INFO L354 Elim1Store]: treesize reduction 148, result has 18.7 percent of original size [2021-11-21 00:51:21,027 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 256 treesize of output 234 [2021-11-21 00:51:25,263 INFO L354 Elim1Store]: treesize reduction 216, result has 16.6 percent of original size [2021-11-21 00:51:25,264 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 244 treesize of output 233 [2021-11-21 00:51:25,318 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-11-21 00:51:25,318 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 232 treesize of output 212 [2021-11-21 00:51:26,663 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-11-21 00:51:26,664 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 75 treesize of output 38 [2021-11-21 00:51:26,669 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 32 treesize of output 24 [2021-11-21 00:51:27,081 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-21 00:51:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:51:27,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:51:31,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_insert_~last~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~last~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse2 v_DerPreprocessor_21)))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 |ULTIMATE.start_sll_insert_~last~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse2 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 |ULTIMATE.start_sll_insert_~last~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-21 00:51:33,735 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~last~0#1.offset_24| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_24| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse2 v_DerPreprocessor_21)))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_24|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse2 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_24|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-21 00:52:36,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~last~0#1.offset_24| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_24| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (or (= (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) .cse3 v_DerPreprocessor_21)))) (store .cse0 |c_node_create_#res#1.base| (store (select .cse0 |c_node_create_#res#1.base|) .cse1 v_DerPreprocessor_2))) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 |c_node_create_#res#1.base|)))) (store .cse4 |c_node_create_#res#1.base| (store (select .cse4 |c_node_create_#res#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_24|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse5 |c_node_create_#res#1.base| (store (select .cse5 |c_node_create_#res#1.base|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_24|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12|) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|))) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse11 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse15 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse13 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse7 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse9 (select (select .cse13 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse10 (bvadd (_ bv4 32) (select (select .cse15 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)))) (select (select (let ((.cse6 (let ((.cse8 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse11 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 v_DerPreprocessor_3))))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse7 v_DerPreprocessor_2))) (select (select (let ((.cse12 (store .cse13 .cse9 (store (select .cse13 .cse9) .cse10 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse12 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse12 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse7 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (select (select (let ((.cse14 (store .cse15 .cse9 (store (select .cse15 .cse9) .cse10 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse7 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))))))) is different from false [2021-11-21 00:53:04,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~last~0#1.offset_24| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_24| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse5 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse7 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse1 (bvadd (_ bv4 32) v_prenex_11)) (.cse3 (select (select .cse7 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse9 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_DerPreprocessor_3))))) (store .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_12))) (select (select (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (select (select (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 v_prenex_11)))) (store .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|))) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse15 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse19 (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|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_26))) (.cse17 (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|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_27)))) (let ((.cse11 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse13 (select (select .cse17 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse14 (bvadd (_ bv4 32) (select (select .cse19 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)))) (select (select (let ((.cse10 (let ((.cse12 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) .cse15 v_DerPreprocessor_25) |node_create_~temp~0#1.offset| |node_create_~data#1|)))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_DerPreprocessor_21))))) (store .cse10 |c_node_create_~temp~0#1.base| (store (select .cse10 |c_node_create_~temp~0#1.base|) .cse11 v_DerPreprocessor_2))) (select (select (let ((.cse16 (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 |c_node_create_~temp~0#1.base|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.base_24|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (select (select (let ((.cse18 (store .cse19 .cse13 (store (select .cse19 .cse13) .cse14 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse18 |c_node_create_~temp~0#1.base| (store (select .cse18 |c_node_create_~temp~0#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_24|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)))))))) is different from false [2021-11-21 00:53:06,187 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~last~0#1.offset_24| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_24| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse5 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse7 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse1 (bvadd (_ bv4 32) v_prenex_11)) (.cse3 (select (select .cse7 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse9 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_DerPreprocessor_3))))) (store .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_12))) (select (select (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (select (select (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 v_prenex_11)))) (store .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|))) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse15 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse19 (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|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_26))) (.cse17 (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|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_27)))) (let ((.cse11 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse13 (select (select .cse17 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse14 (bvadd (_ bv4 32) (select (select .cse19 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)))) (select (select (let ((.cse10 (let ((.cse12 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) .cse15 v_DerPreprocessor_25) |node_create_~temp~0#1.offset| |node_create_~data#1|)))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_DerPreprocessor_21))))) (store .cse10 |c_node_create_~temp~0#1.base| (store (select .cse10 |c_node_create_~temp~0#1.base|) .cse11 v_DerPreprocessor_2))) (select (select (let ((.cse16 (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 |c_node_create_~temp~0#1.base|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.base_24|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (select (select (let ((.cse18 (store .cse19 .cse13 (store (select .cse19 .cse13) .cse14 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse18 |c_node_create_~temp~0#1.base| (store (select .cse18 |c_node_create_~temp~0#1.base|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_24|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)))))))) is different from true [2021-11-21 00:54:11,569 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_31| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_sll_insert_~last~0#1.offset_24| (_ BitVec 32)) (|ULTIMATE.start_sll_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_24| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~last~0#1.offset_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_22| (_ BitVec 32)) (|v_node_create_~data#1_20| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse5 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_22|))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_6))) (.cse7 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 (_ bv0 32)) |v_node_create_~temp~0#1.offset_22| v_DerPreprocessor_5)))) (let ((.cse1 (bvadd (_ bv4 32) v_prenex_11)) (.cse3 (select (select .cse7 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse9 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse5 v_DerPreprocessor_4) |v_node_create_~temp~0#1.offset_22| |v_node_create_~data#1_20|)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_DerPreprocessor_3))))) (store .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 v_prenex_12))) (select (select (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|)))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.base_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (select (select (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 v_prenex_11)))) (store .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| (store (select .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|) .cse1 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_14|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21|))) (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_21| |c_#StackHeapBarrier|))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse15 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_31| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_31|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_26))) (.cse17 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_31|) .cse15 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_27)))) (let ((.cse11 (bvadd (_ bv4 32) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse13 (select (select .cse17 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse14 (bvadd (_ bv4 32) (select (select .cse19 |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|)))) (select (select (let ((.cse10 (let ((.cse12 (store |c_#memory_int| |v_node_create_~temp~0#1.base_31| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_31|) .cse15 v_DerPreprocessor_25) |node_create_~temp~0#1.offset| |node_create_~data#1|)))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_DerPreprocessor_21))))) (store .cse10 |v_node_create_~temp~0#1.base_31| (store (select .cse10 |v_node_create_~temp~0#1.base_31|) .cse11 v_DerPreprocessor_2))) (select (select (let ((.cse16 (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 |v_node_create_~temp~0#1.base_31|)))) (store .cse16 |v_node_create_~temp~0#1.base_31| (store (select .cse16 |v_node_create_~temp~0#1.base_31|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.base_24|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (select (select (let ((.cse18 (store .cse19 .cse13 (store (select .cse19 .cse13) .cse14 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (store .cse18 |v_node_create_~temp~0#1.base_31| (store (select .cse18 |v_node_create_~temp~0#1.base_31|) .cse11 |v_ULTIMATE.start_sll_insert_~last~0#1.offset_24|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_31|))) (not (bvult |v_node_create_~temp~0#1.base_31| |c_#StackHeapBarrier|)))) is different from true [2021-11-21 00:54:26,940 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 10302101 treesize of output 9475713 [2021-11-21 00:54:31,558 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 33352252001 treesize of output 33123491673