./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 03:19:33,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 03:19:33,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 03:19:33,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 03:19:33,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 03:19:33,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 03:19:33,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 03:19:33,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 03:19:33,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 03:19:33,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 03:19:33,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 03:19:33,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 03:19:33,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 03:19:33,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 03:19:33,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 03:19:33,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 03:19:33,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 03:19:33,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 03:19:33,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 03:19:33,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 03:19:33,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 03:19:33,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 03:19:33,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 03:19:33,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 03:19:33,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 03:19:33,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 03:19:33,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 03:19:33,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 03:19:33,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 03:19:33,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 03:19:33,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 03:19:33,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 03:19:33,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 03:19:33,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 03:19:33,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 03:19:33,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 03:19:33,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 03:19:33,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 03:19:33,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 03:19:33,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 03:19:33,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 03:19:33,289 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-23 03:19:33,340 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 03:19:33,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 03:19:33,341 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 03:19:33,341 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 03:19:33,342 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 03:19:33,342 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 03:19:33,342 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 03:19:33,343 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 03:19:33,343 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 03:19:33,343 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 03:19:33,344 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 03:19:33,344 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 03:19:33,344 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 03:19:33,345 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 03:19:33,345 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 03:19:33,345 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 03:19:33,345 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 03:19:33,345 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 03:19:33,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 03:19:33,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 03:19:33,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 03:19:33,347 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 03:19:33,347 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 03:19:33,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 03:19:33,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 03:19:33,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 03:19:33,349 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 03:19:33,350 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 03:19:33,350 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 03:19:33,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 03:19:33,350 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 03:19:33,351 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 03:19:33,351 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 03:19:33,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 03:19:33,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 03:19:33,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:19:33,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 03:19:33,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 03:19:33,352 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 03:19:33,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 03:19:33,352 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 03:19:33,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 03:19:33,353 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_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/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_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2021-11-23 03:19:33,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 03:19:33,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 03:19:33,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 03:19:33,699 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 03:19:33,699 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 03:19:33,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-11-23 03:19:33,774 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/data/45458832d/4800b29bf5c84e5f98ee00cff457ac5a/FLAGcaeaffb20 [2021-11-23 03:19:34,365 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 03:19:34,366 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-11-23 03:19:34,392 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/data/45458832d/4800b29bf5c84e5f98ee00cff457ac5a/FLAGcaeaffb20 [2021-11-23 03:19:34,658 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/data/45458832d/4800b29bf5c84e5f98ee00cff457ac5a [2021-11-23 03:19:34,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 03:19:34,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 03:19:34,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 03:19:34,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 03:19:34,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 03:19:34,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:19:34" (1/1) ... [2021-11-23 03:19:34,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6cb882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:34, skipping insertion in model container [2021-11-23 03:19:34,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:19:34" (1/1) ... [2021-11-23 03:19:34,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 03:19:34,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 03:19:35,201 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_2d44f51c-4206-423a-aa8c-a3488a8a0742/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2021-11-23 03:19:35,209 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:19:35,225 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 03:19:35,275 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_2d44f51c-4206-423a-aa8c-a3488a8a0742/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2021-11-23 03:19:35,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:19:35,309 INFO L208 MainTranslator]: Completed translation [2021-11-23 03:19:35,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35 WrapperNode [2021-11-23 03:19:35,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 03:19:35,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 03:19:35,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 03:19:35,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 03:19:35,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35" (1/1) ... [2021-11-23 03:19:35,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35" (1/1) ... [2021-11-23 03:19:35,378 INFO L137 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2021-11-23 03:19:35,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 03:19:35,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 03:19:35,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 03:19:35,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 03:19:35,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35" (1/1) ... [2021-11-23 03:19:35,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35" (1/1) ... [2021-11-23 03:19:35,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35" (1/1) ... [2021-11-23 03:19:35,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35" (1/1) ... [2021-11-23 03:19:35,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35" (1/1) ... [2021-11-23 03:19:35,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35" (1/1) ... [2021-11-23 03:19:35,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35" (1/1) ... [2021-11-23 03:19:35,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 03:19:35,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 03:19:35,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 03:19:35,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 03:19:35,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35" (1/1) ... [2021-11-23 03:19:35,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:19:35,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:19:35,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 03:19:35,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 03:19:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 03:19:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 03:19:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 03:19:35,523 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 03:19:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 03:19:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 03:19:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 03:19:35,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 03:19:35,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 03:19:35,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 03:19:35,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 03:19:35,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 03:19:35,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 03:19:35,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 03:19:35,625 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 03:19:35,627 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 03:19:36,066 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 03:19:36,111 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 03:19:36,111 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 03:19:36,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:19:36 BoogieIcfgContainer [2021-11-23 03:19:36,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 03:19:36,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 03:19:36,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 03:19:36,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 03:19:36,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:19:34" (1/3) ... [2021-11-23 03:19:36,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cae47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:19:36, skipping insertion in model container [2021-11-23 03:19:36,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:35" (2/3) ... [2021-11-23 03:19:36,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cae47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:19:36, skipping insertion in model container [2021-11-23 03:19:36,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:19:36" (3/3) ... [2021-11-23 03:19:36,123 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2021-11-23 03:19:36,129 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 03:19:36,129 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2021-11-23 03:19:36,175 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 03:19:36,181 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 03:19:36,182 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-11-23 03:19:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 77 states have internal predecessors, (89), 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-23 03:19:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 03:19:36,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:36,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 03:19:36,207 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:36,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1731606218, now seen corresponding path program 1 times [2021-11-23 03:19:36,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:19:36,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693180131] [2021-11-23 03:19:36,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:36,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:19:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:36,515 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-23 03:19:36,516 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:19:36,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693180131] [2021-11-23 03:19:36,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693180131] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:19:36,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:19:36,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 03:19:36,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768422260] [2021-11-23 03:19:36,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:19:36,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:19:36,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:19:36,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:19:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:19:36,561 INFO L87 Difference]: Start difference. First operand has 81 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 77 states have internal predecessors, (89), 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, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:19:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:19:36,671 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2021-11-23 03:19:36,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:19:36,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-23 03:19:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:19:36,683 INFO L225 Difference]: With dead ends: 79 [2021-11-23 03:19:36,683 INFO L226 Difference]: Without dead ends: 77 [2021-11-23 03:19:36,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:19:36,689 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:19:36,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 112 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:19:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-23 03:19:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-11-23 03:19:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 37 states have (on average 2.189189189189189) internal successors, (81), 73 states have internal predecessors, (81), 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-23 03:19:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2021-11-23 03:19:36,730 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 6 [2021-11-23 03:19:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:19:36,731 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2021-11-23 03:19:36,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:19:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2021-11-23 03:19:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 03:19:36,732 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:36,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 03:19:36,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 03:19:36,733 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1731606219, now seen corresponding path program 1 times [2021-11-23 03:19:36,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:19:36,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605054952] [2021-11-23 03:19:36,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:36,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:19:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:36,788 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-23 03:19:36,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:19:36,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605054952] [2021-11-23 03:19:36,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605054952] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:19:36,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:19:36,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 03:19:36,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440444452] [2021-11-23 03:19:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:19:36,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:19:36,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:19:36,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:19:36,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:19:36,792 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:19:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:19:36,863 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2021-11-23 03:19:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:19:36,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-23 03:19:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:19:36,865 INFO L225 Difference]: With dead ends: 75 [2021-11-23 03:19:36,865 INFO L226 Difference]: Without dead ends: 75 [2021-11-23 03:19:36,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:19:36,867 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:19:36,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 114 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:19:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-23 03:19:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-11-23 03:19:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 37 states have (on average 2.135135135135135) internal successors, (79), 71 states have internal predecessors, (79), 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-23 03:19:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2021-11-23 03:19:36,877 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 6 [2021-11-23 03:19:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:19:36,877 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2021-11-23 03:19:36,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:19:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2021-11-23 03:19:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 03:19:36,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:36,879 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:19:36,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 03:19:36,879 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash -527582553, now seen corresponding path program 1 times [2021-11-23 03:19:36,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:19:36,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548206830] [2021-11-23 03:19:36,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:36,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:19:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:36,957 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-23 03:19:36,957 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:19:36,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548206830] [2021-11-23 03:19:36,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548206830] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:19:36,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:19:36,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:19:36,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591672757] [2021-11-23 03:19:36,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:19:36,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:19:36,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:19:36,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:19:36,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:19:36,962 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-23 03:19:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:19:37,143 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2021-11-23 03:19:37,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:19:37,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2021-11-23 03:19:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:19:37,146 INFO L225 Difference]: With dead ends: 77 [2021-11-23 03:19:37,147 INFO L226 Difference]: Without dead ends: 77 [2021-11-23 03:19:37,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:19:37,148 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:19:37,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 231 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:19:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-23 03:19:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2021-11-23 03:19:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 37 states have (on average 2.108108108108108) internal successors, (78), 70 states have internal predecessors, (78), 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-23 03:19:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2021-11-23 03:19:37,159 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 10 [2021-11-23 03:19:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:19:37,159 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2021-11-23 03:19:37,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-23 03:19:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2021-11-23 03:19:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 03:19:37,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:37,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:19:37,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 03:19:37,161 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash -527582552, now seen corresponding path program 1 times [2021-11-23 03:19:37,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:19:37,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772167216] [2021-11-23 03:19:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:37,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:19:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:37,249 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-23 03:19:37,249 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:19:37,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772167216] [2021-11-23 03:19:37,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772167216] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:19:37,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:19:37,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:19:37,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548583982] [2021-11-23 03:19:37,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:19:37,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:19:37,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:19:37,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:19:37,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:19:37,252 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-23 03:19:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:19:37,430 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2021-11-23 03:19:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:19:37,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2021-11-23 03:19:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:19:37,435 INFO L225 Difference]: With dead ends: 76 [2021-11-23 03:19:37,435 INFO L226 Difference]: Without dead ends: 76 [2021-11-23 03:19:37,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:19:37,437 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:19:37,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 243 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:19:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-23 03:19:37,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-11-23 03:19:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 37 states have (on average 2.081081081081081) internal successors, (77), 69 states have internal predecessors, (77), 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-23 03:19:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2021-11-23 03:19:37,445 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 10 [2021-11-23 03:19:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:19:37,446 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2021-11-23 03:19:37,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-23 03:19:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2021-11-23 03:19:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 03:19:37,451 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:37,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:19:37,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 03:19:37,452 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash -261215653, now seen corresponding path program 1 times [2021-11-23 03:19:37,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:19:37,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504919694] [2021-11-23 03:19:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:37,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:19:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:37,521 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-23 03:19:37,521 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:19:37,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504919694] [2021-11-23 03:19:37,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504919694] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:19:37,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:19:37,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:19:37,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994513281] [2021-11-23 03:19:37,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:19:37,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:19:37,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:19:37,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:19:37,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:19:37,524 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-23 03:19:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:19:37,559 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2021-11-23 03:19:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:19:37,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2021-11-23 03:19:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:19:37,563 INFO L225 Difference]: With dead ends: 77 [2021-11-23 03:19:37,563 INFO L226 Difference]: Without dead ends: 77 [2021-11-23 03:19:37,563 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-23 03:19:37,564 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:19:37,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 139 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:19:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-23 03:19:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2021-11-23 03:19:37,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 70 states have internal predecessors, (78), 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-23 03:19:37,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2021-11-23 03:19:37,572 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 10 [2021-11-23 03:19:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:19:37,572 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2021-11-23 03:19:37,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-23 03:19:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2021-11-23 03:19:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 03:19:37,573 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:37,573 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:19:37,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 03:19:37,574 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 435882560, now seen corresponding path program 1 times [2021-11-23 03:19:37,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:19:37,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840602407] [2021-11-23 03:19:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:37,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:19:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:19:37,667 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:19:37,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840602407] [2021-11-23 03:19:37,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840602407] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:19:37,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043350541] [2021-11-23 03:19:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:37,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:19:37,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:19:37,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:19:37,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 03:19:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:37,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 03:19:37,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:19:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:19:37,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:19:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:19:37,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043350541] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:19:37,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1432792053] [2021-11-23 03:19:37,950 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-23 03:19:37,950 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:19:37,956 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:19:37,961 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:19:37,962 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:19:38,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:38,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:38,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:19:38,253 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 03:19:38,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 45 [2021-11-23 03:19:38,292 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-23 03:19:38,299 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-23 03:19:38,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:19:38,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:19:38,336 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 19 treesize of output 1 [2021-11-23 03:19:38,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:38,383 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 25 treesize of output 13 [2021-11-23 03:19:38,390 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-23 03:19:38,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:38,401 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 25 treesize of output 13 [2021-11-23 03:19:38,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:38,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:38,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-23 03:19:38,597 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 03:19:38,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 45 [2021-11-23 03:19:38,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:38,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:38,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-23 03:19:38,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:19:38,761 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-23 03:19:38,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:38,776 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-23 03:19:38,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:19:38,793 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-23 03:19:38,861 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 03:19:38,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 27 [2021-11-23 03:19:38,908 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-23 03:19:38,919 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 13 treesize of output 9 [2021-11-23 03:19:38,930 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-23 03:19:38,943 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-23 03:19:38,960 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-23 03:19:39,000 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 03:19:39,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 27 [2021-11-23 03:19:39,061 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-23 03:19:39,071 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 13 treesize of output 9 [2021-11-23 03:19:39,084 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-23 03:19:39,093 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-23 03:19:39,109 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-23 03:19:39,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:39,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 250 [2021-11-23 03:19:39,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:19:39,307 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 251 treesize of output 239 [2021-11-23 03:19:39,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:19:39,322 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 248 treesize of output 236 [2021-11-23 03:19:39,418 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 03:19:39,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 27 [2021-11-23 03:19:39,468 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 13 treesize of output 9 [2021-11-23 03:19:39,477 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-23 03:19:39,486 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-23 03:19:39,508 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-23 03:19:39,520 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-23 03:19:39,569 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 03:19:39,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 27 [2021-11-23 03:19:39,617 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-23 03:19:39,626 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-23 03:19:39,638 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 13 treesize of output 9 [2021-11-23 03:19:39,651 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-23 03:19:39,664 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-23 03:19:39,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:39,807 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 270 treesize of output 250 [2021-11-23 03:19:39,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:19:39,822 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 251 treesize of output 239 [2021-11-23 03:19:39,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:19:39,836 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 254 treesize of output 242 [2021-11-23 03:19:40,174 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-23 03:19:40,192 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-23 03:19:40,330 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-23 03:19:40,355 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-23 03:19:40,629 INFO L354 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2021-11-23 03:19:40,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 396 treesize of output 401 [2021-11-23 03:19:40,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:19:40,756 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-23 03:19:40,810 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 105 for LOIs [2021-11-23 03:19:41,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 03:19:41,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-23 03:19:41,791 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Some non-self update cases but no top-level DER relation at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:340) 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.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) 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-23 03:19:41,794 INFO L158 Benchmark]: Toolchain (without parser) took 7131.66ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 94.6MB in the beginning and 104.0MB in the end (delta: -9.3MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2021-11-23 03:19:41,795 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 81.8MB. Free memory was 37.2MB in the beginning and 37.1MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 03:19:41,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 642.91ms. Allocated memory is still 127.9MB. Free memory was 94.4MB in the beginning and 96.7MB in the end (delta: -2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 03:19:41,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.49ms. Allocated memory is still 127.9MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 03:19:41,796 INFO L158 Benchmark]: Boogie Preprocessor took 62.49ms. Allocated memory is still 127.9MB. Free memory was 94.6MB in the beginning and 92.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 03:19:41,796 INFO L158 Benchmark]: RCFGBuilder took 671.78ms. Allocated memory is still 127.9MB. Free memory was 92.6MB in the beginning and 72.5MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-23 03:19:41,797 INFO L158 Benchmark]: TraceAbstraction took 5677.78ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 72.1MB in the beginning and 104.0MB in the end (delta: -31.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2021-11-23 03:19:41,799 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.28ms. Allocated memory is still 81.8MB. Free memory was 37.2MB in the beginning and 37.1MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 642.91ms. Allocated memory is still 127.9MB. Free memory was 94.4MB in the beginning and 96.7MB in the end (delta: -2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.49ms. Allocated memory is still 127.9MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.49ms. Allocated memory is still 127.9MB. Free memory was 94.6MB in the beginning and 92.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 671.78ms. Allocated memory is still 127.9MB. Free memory was 92.6MB in the beginning and 72.5MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5677.78ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 72.1MB in the beginning and 104.0MB in the end (delta: -31.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Some non-self update cases but no top-level DER relation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Some non-self update cases but no top-level DER relation: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-23 03:19:41,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/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_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 03:19:44,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 03:19:44,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 03:19:44,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 03:19:44,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 03:19:44,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 03:19:44,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 03:19:44,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 03:19:44,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 03:19:44,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 03:19:44,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 03:19:44,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 03:19:44,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 03:19:44,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 03:19:44,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 03:19:44,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 03:19:44,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 03:19:44,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 03:19:44,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 03:19:44,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 03:19:44,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 03:19:44,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 03:19:44,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 03:19:44,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 03:19:44,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 03:19:44,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 03:19:44,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 03:19:44,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 03:19:44,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 03:19:44,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 03:19:44,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 03:19:44,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 03:19:44,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 03:19:44,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 03:19:44,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 03:19:44,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 03:19:44,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 03:19:44,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 03:19:44,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 03:19:44,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 03:19:44,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 03:19:44,305 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-23 03:19:44,334 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 03:19:44,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 03:19:44,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 03:19:44,335 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 03:19:44,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 03:19:44,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 03:19:44,336 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 03:19:44,336 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 03:19:44,336 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 03:19:44,336 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 03:19:44,337 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 03:19:44,337 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 03:19:44,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 03:19:44,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 03:19:44,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 03:19:44,338 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 03:19:44,338 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 03:19:44,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 03:19:44,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 03:19:44,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 03:19:44,339 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 03:19:44,339 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 03:19:44,340 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 03:19:44,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 03:19:44,340 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 03:19:44,340 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-23 03:19:44,341 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-23 03:19:44,341 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 03:19:44,341 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 03:19:44,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 03:19:44,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 03:19:44,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 03:19:44,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:19:44,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 03:19:44,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 03:19:44,343 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-23 03:19:44,343 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-23 03:19:44,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 03:19:44,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 03:19:44,343 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_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/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_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2021-11-23 03:19:44,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 03:19:44,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 03:19:44,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 03:19:44,724 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 03:19:44,724 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 03:19:44,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-11-23 03:19:44,808 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/data/843cb11de/8d94e489f1094470937483eb7c09046b/FLAG0d0112ec2 [2021-11-23 03:19:45,359 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 03:19:45,360 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-11-23 03:19:45,376 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/data/843cb11de/8d94e489f1094470937483eb7c09046b/FLAG0d0112ec2 [2021-11-23 03:19:45,661 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/data/843cb11de/8d94e489f1094470937483eb7c09046b [2021-11-23 03:19:45,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 03:19:45,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 03:19:45,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 03:19:45,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 03:19:45,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 03:19:45,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:19:45" (1/1) ... [2021-11-23 03:19:45,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67798c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:45, skipping insertion in model container [2021-11-23 03:19:45,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:19:45" (1/1) ... [2021-11-23 03:19:45,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 03:19:45,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 03:19:46,144 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_2d44f51c-4206-423a-aa8c-a3488a8a0742/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2021-11-23 03:19:46,147 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:19:46,160 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 03:19:46,229 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_2d44f51c-4206-423a-aa8c-a3488a8a0742/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2021-11-23 03:19:46,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:19:46,271 INFO L208 MainTranslator]: Completed translation [2021-11-23 03:19:46,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46 WrapperNode [2021-11-23 03:19:46,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 03:19:46,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 03:19:46,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 03:19:46,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 03:19:46,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46" (1/1) ... [2021-11-23 03:19:46,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46" (1/1) ... [2021-11-23 03:19:46,348 INFO L137 Inliner]: procedures = 130, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2021-11-23 03:19:46,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 03:19:46,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 03:19:46,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 03:19:46,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 03:19:46,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46" (1/1) ... [2021-11-23 03:19:46,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46" (1/1) ... [2021-11-23 03:19:46,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46" (1/1) ... [2021-11-23 03:19:46,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46" (1/1) ... [2021-11-23 03:19:46,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46" (1/1) ... [2021-11-23 03:19:46,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46" (1/1) ... [2021-11-23 03:19:46,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46" (1/1) ... [2021-11-23 03:19:46,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 03:19:46,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 03:19:46,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 03:19:46,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 03:19:46,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46" (1/1) ... [2021-11-23 03:19:46,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:19:46,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:19:46,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 03:19:46,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 03:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-23 03:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 03:19:46,524 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 03:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 03:19:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 03:19:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 03:19:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 03:19:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 03:19:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 03:19:46,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-23 03:19:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 03:19:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-23 03:19:46,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 03:19:46,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 03:19:46,650 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 03:19:46,661 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 03:19:47,225 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 03:19:47,232 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 03:19:47,232 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 03:19:47,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:19:47 BoogieIcfgContainer [2021-11-23 03:19:47,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 03:19:47,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 03:19:47,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 03:19:47,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 03:19:47,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:19:45" (1/3) ... [2021-11-23 03:19:47,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d5e5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:19:47, skipping insertion in model container [2021-11-23 03:19:47,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:46" (2/3) ... [2021-11-23 03:19:47,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d5e5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:19:47, skipping insertion in model container [2021-11-23 03:19:47,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:19:47" (3/3) ... [2021-11-23 03:19:47,261 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2021-11-23 03:19:47,266 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 03:19:47,266 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2021-11-23 03:19:47,311 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 03:19:47,332 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 03:19:47,333 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-11-23 03:19:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 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-23 03:19:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 03:19:47,356 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:47,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:19:47,358 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:47,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:47,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520441, now seen corresponding path program 1 times [2021-11-23 03:19:47,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:19:47,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431568532] [2021-11-23 03:19:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:47,377 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:19:47,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:19:47,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:19:47,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-23 03:19:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:47,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 03:19:47,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:19:47,567 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-23 03:19:47,580 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-23 03:19:47,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:19:47,604 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-23 03:19:47,605 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:19:47,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431568532] [2021-11-23 03:19:47,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431568532] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 03:19:47,606 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:19:47,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-23 03:19:47,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989455826] [2021-11-23 03:19:47,609 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 03:19:47,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:19:47,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:19:47,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:19:47,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:19:47,644 INFO L87 Difference]: Start difference. First operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 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, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:19:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:19:47,823 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2021-11-23 03:19:47,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:19:47,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-23 03:19:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:19:47,851 INFO L225 Difference]: With dead ends: 94 [2021-11-23 03:19:47,852 INFO L226 Difference]: Without dead ends: 91 [2021-11-23 03:19:47,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-23 03:19:47,857 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:19:47,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:19:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-11-23 03:19:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-11-23 03:19:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 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-23 03:19:47,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2021-11-23 03:19:47,914 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 7 [2021-11-23 03:19:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:19:47,914 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2021-11-23 03:19:47,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:19:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2021-11-23 03:19:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 03:19:47,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:47,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:19:47,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-23 03:19:48,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:19:48,126 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520442, now seen corresponding path program 1 times [2021-11-23 03:19:48,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:19:48,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924665918] [2021-11-23 03:19:48,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:48,130 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:19:48,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:19:48,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:19:48,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-23 03:19:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:48,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 03:19:48,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:19:48,247 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-23 03:19:48,277 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-23 03:19:48,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:19:48,415 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-23 03:19:48,415 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:19:48,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924665918] [2021-11-23 03:19:48,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924665918] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 03:19:48,416 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:19:48,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-23 03:19:48,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499940259] [2021-11-23 03:19:48,417 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 03:19:48,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:19:48,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:19:48,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:19:48,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:19:48,420 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:19:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:19:48,781 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2021-11-23 03:19:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:19:48,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-23 03:19:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:19:48,785 INFO L225 Difference]: With dead ends: 89 [2021-11-23 03:19:48,785 INFO L226 Difference]: Without dead ends: 89 [2021-11-23 03:19:48,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-23 03:19:48,788 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:19:48,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:19:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-23 03:19:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-23 03:19:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 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-23 03:19:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2021-11-23 03:19:48,805 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 7 [2021-11-23 03:19:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:19:48,806 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2021-11-23 03:19:48,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:19:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2021-11-23 03:19:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 03:19:48,807 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:48,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:19:48,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-23 03:19:49,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:19:49,019 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:49,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468992, now seen corresponding path program 1 times [2021-11-23 03:19:49,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:19:49,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492128652] [2021-11-23 03:19:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:49,022 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:19:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:19:49,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:19:49,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-23 03:19:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:49,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 03:19:49,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:19:49,120 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-23 03:19:49,190 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-23 03:19:49,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:19:49,309 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-23 03:19:49,310 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:19:49,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492128652] [2021-11-23 03:19:49,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492128652] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 03:19:49,311 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:19:49,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-23 03:19:49,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962052228] [2021-11-23 03:19:49,311 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 03:19:49,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:19:49,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:19:49,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:19:49,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:19:49,313 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-23 03:19:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:19:49,685 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2021-11-23 03:19:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:19:49,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2021-11-23 03:19:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:19:49,689 INFO L225 Difference]: With dead ends: 93 [2021-11-23 03:19:49,689 INFO L226 Difference]: Without dead ends: 93 [2021-11-23 03:19:49,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:19:49,691 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 10 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:19:49,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 309 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:19:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-23 03:19:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2021-11-23 03:19:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 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-23 03:19:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2021-11-23 03:19:49,703 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 13 [2021-11-23 03:19:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:19:49,703 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2021-11-23 03:19:49,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-23 03:19:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2021-11-23 03:19:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 03:19:49,705 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:49,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:19:49,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-23 03:19:49,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:19:49,919 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:49,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:49,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468991, now seen corresponding path program 1 times [2021-11-23 03:19:49,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:19:49,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428515273] [2021-11-23 03:19:49,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:49,921 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:19:49,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:19:49,922 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:19:49,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-23 03:19:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:49,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 03:19:49,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:19:50,033 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-23 03:19:50,162 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-23 03:19:50,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:19:50,558 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-23 03:19:50,559 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:19:50,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428515273] [2021-11-23 03:19:50,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428515273] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 03:19:50,559 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:19:50,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-23 03:19:50,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552510148] [2021-11-23 03:19:50,560 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 03:19:50,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 03:19:50,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:19:50,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 03:19:50,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-23 03:19:50,561 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 03:19:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:19:51,307 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2021-11-23 03:19:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:19:51,309 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-11-23 03:19:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:19:51,310 INFO L225 Difference]: With dead ends: 92 [2021-11-23 03:19:51,310 INFO L226 Difference]: Without dead ends: 92 [2021-11-23 03:19:51,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 03:19:51,312 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 18 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-23 03:19:51,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 383 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-23 03:19:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-23 03:19:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2021-11-23 03:19:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 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-23 03:19:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-11-23 03:19:51,320 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 13 [2021-11-23 03:19:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:19:51,321 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-11-23 03:19:51,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 03:19:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-11-23 03:19:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 03:19:51,322 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:51,322 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:19:51,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-23 03:19:51,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:19:51,531 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:51,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:51,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295936, now seen corresponding path program 1 times [2021-11-23 03:19:51,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:19:51,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379501902] [2021-11-23 03:19:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:51,533 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:19:51,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:19:51,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:19:51,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-23 03:19:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:51,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 03:19:51,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:19:51,665 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-23 03:19:51,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:19:51,706 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-23 03:19:51,706 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:19:51,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379501902] [2021-11-23 03:19:51,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379501902] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 03:19:51,707 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:19:51,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-23 03:19:51,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012653163] [2021-11-23 03:19:51,708 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 03:19:51,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:19:51,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:19:51,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:19:51,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:19:51,710 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-23 03:19:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:19:51,735 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2021-11-23 03:19:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:19:51,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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 15 [2021-11-23 03:19:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:19:51,737 INFO L225 Difference]: With dead ends: 94 [2021-11-23 03:19:51,737 INFO L226 Difference]: Without dead ends: 94 [2021-11-23 03:19:51,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-23 03:19:51,741 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 8 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:19:51,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 271 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:19:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-23 03:19:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-11-23 03:19:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:19:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-11-23 03:19:51,771 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 15 [2021-11-23 03:19:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:19:51,771 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-11-23 03:19:51,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-23 03:19:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2021-11-23 03:19:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 03:19:51,774 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:19:51,774 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:19:51,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-23 03:19:51,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:19:51,996 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:19:51,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:19:51,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092864, now seen corresponding path program 1 times [2021-11-23 03:19:51,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:19:51,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836059701] [2021-11-23 03:19:51,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:19:51,998 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:19:51,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:19:51,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:19:52,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-23 03:19:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:19:52,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-23 03:19:52,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:19:52,190 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-23 03:19:52,230 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-23 03:19:52,426 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 03:19:52,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-11-23 03:19:52,693 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 03:19:52,693 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 33 treesize of output 29 [2021-11-23 03:19:52,937 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 03:19:52,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63 [2021-11-23 03:19:53,803 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 03:19:53,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 66 [2021-11-23 03:19:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 03:19:53,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:20:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:20:38,480 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:20:38,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836059701] [2021-11-23 03:20:38,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836059701] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:20:38,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1453265877] [2021-11-23 03:20:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:20:38,481 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 03:20:38,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 03:20:38,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 03:20:38,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-23 03:20:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:20:38,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-23 03:20:38,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:20:38,880 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-23 03:20:38,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2021-11-23 03:20:39,252 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 03:20:39,252 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 20 treesize of output 16 [2021-11-23 03:20:44,083 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 03:20:44,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2021-11-23 03:20:44,502 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-23 03:20:44,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2021-11-23 03:20:55,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:20:55,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:20:55,154 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-23 03:20:55,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2021-11-23 03:20:56,118 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-23 03:20:56,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 32 [2021-11-23 03:21:00,517 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-23 03:21:00,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 74 [2021-11-23 03:21:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 03:21:00,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:21:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 03:21:43,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1453265877] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 03:21:43,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:21:43,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 10, 11] total 33 [2021-11-23 03:21:43,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991715769] [2021-11-23 03:21:43,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:21:43,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 03:21:43,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:21:43,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 03:21:43,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=916, Unknown=31, NotChecked=0, Total=1122 [2021-11-23 03:21:43,293 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 03:21:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:21:43,509 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-11-23 03:21:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:21:43,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2021-11-23 03:21:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:21:43,511 INFO L225 Difference]: With dead ends: 103 [2021-11-23 03:21:43,512 INFO L226 Difference]: Without dead ends: 103 [2021-11-23 03:21:43,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 115 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 101.1s TimeCoverageRelationStatistics Valid=175, Invalid=916, Unknown=31, NotChecked=0, Total=1122 [2021-11-23 03:21:43,514 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 69 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:21:43,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 169 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 98 Unchecked, 0.2s Time] [2021-11-23 03:21:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-23 03:21:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2021-11-23 03:21:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 86 states have internal predecessors, (94), 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-23 03:21:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2021-11-23 03:21:43,522 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 41 [2021-11-23 03:21:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:21:43,523 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-11-23 03:21:43,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 03:21:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2021-11-23 03:21:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 03:21:43,525 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:21:43,525 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:21:43,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-23 03:21:43,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-23 03:21:43,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:21:43,928 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:21:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:21:43,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092863, now seen corresponding path program 1 times [2021-11-23 03:21:43,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:21:43,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002300874] [2021-11-23 03:21:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:21:43,929 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:21:43,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:21:43,930 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:21:43,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-23 03:21:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:21:44,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 03:21:44,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:21:44,148 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-23 03:21:44,168 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-23 03:21:44,275 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 17 treesize of output 15 [2021-11-23 03:21:44,282 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 12 treesize of output 10 [2021-11-23 03:21:44,608 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 03:21:44,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-11-23 03:21:44,618 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 03:21:44,618 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 25 treesize of output 21 [2021-11-23 03:21:44,878 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 03:21:44,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-11-23 03:21:45,238 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 03:21:45,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2021-11-23 03:21:46,414 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-23 03:21:46,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 36 [2021-11-23 03:21:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:21:46,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:21:54,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_55| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)))) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| .cse0))))) is different from false [2021-11-23 03:21:57,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) is different from false [2021-11-23 03:23:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 7 times theorem prover too weak. 0 trivial. 14 not checked. [2021-11-23 03:23:39,872 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:23:39,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002300874] [2021-11-23 03:23:39,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002300874] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:23:39,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [473661287] [2021-11-23 03:23:39,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:23:39,873 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 03:23:39,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 03:23:39,874 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 03:23:39,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-23 03:23:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:23:40,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 03:23:40,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:23:40,138 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-23 03:23:41,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-23 03:23:46,218 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 03:23:46,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 17 [2021-11-23 03:23:47,621 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 03:23:47,622 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 17 treesize of output 13 [2021-11-23 03:24:00,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:24:00,220 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-23 03:24:00,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 25 [2021-11-23 03:24:09,198 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 03:24:09,199 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 17 treesize of output 13 [2021-11-23 03:24:13,538 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 03:24:13,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2021-11-23 03:24:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 03:24:14,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:26:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 21 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 03:26:47,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [473661287] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:26:47,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057964834] [2021-11-23 03:26:47,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:26:47,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:26:47,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:26:47,715 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:26:47,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 03:26:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:26:47,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-23 03:26:47,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:26:47,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:26:47,869 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-23 03:26:55,872 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 03:26:55,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-11-23 03:26:55,883 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 03:26:55,883 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 25 treesize of output 21 [2021-11-23 03:27:06,419 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-11-23 03:27:06,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2021-11-23 03:27:14,532 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-11-23 03:27:14,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 50 [2021-11-23 03:27:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 03:27:16,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:27:26,142 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_81| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_81| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| .cse0))))) is different from false [2021-11-23 03:27:28,896 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) is different from false [2021-11-23 03:27:57,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))))) is different from false [2021-11-23 03:28:03,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_89| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_89|))))) is different from false [2021-11-23 03:28:05,212 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_89| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_89|))))) is different from true [2021-11-23 03:28:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 21 not checked. [2021-11-23 03:28:05,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057964834] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:28:05,293 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 03:28:05,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11, 10, 12, 10] total 54 [2021-11-23 03:28:05,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114444723] [2021-11-23 03:28:05,294 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 03:28:05,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-23 03:28:05,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:28:05,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-23 03:28:05,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1951, Unknown=113, NotChecked=594, Total=2970 [2021-11-23 03:28:05,299 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 55 states, 50 states have (on average 3.32) internal successors, (166), 40 states have internal predecessors, (166), 16 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (17), 13 states have call predecessors, (17), 16 states have call successors, (17) [2021-11-23 03:28:07,385 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_63| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_63|))) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_89| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_89|)))))) is different from false [2021-11-23 03:28:09,406 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-23 03:28:44,946 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_63| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_63|))) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= |c_#length| |c_old(#length)|) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_89| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_89|)))))) is different from false [2021-11-23 03:28:46,968 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-23 03:28:49,028 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-23 03:28:58,498 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_55| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)))) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| .cse0))))) (= |c_#length| |c_old(#length)|) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_81| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)))) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_81| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| .cse1))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from false [2021-11-23 03:29:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:29:03,314 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2021-11-23 03:29:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-23 03:29:03,316 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 50 states have (on average 3.32) internal successors, (166), 40 states have internal predecessors, (166), 16 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (17), 13 states have call predecessors, (17), 16 states have call successors, (17) Word has length 41 [2021-11-23 03:29:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:29:03,318 INFO L225 Difference]: With dead ends: 105 [2021-11-23 03:29:03,318 INFO L226 Difference]: Without dead ends: 105 [2021-11-23 03:29:03,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 179 SyntacticMatches, 12 SemanticMatches, 64 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 366.2s TimeCoverageRelationStatistics Valid=397, Invalid=2381, Unknown=132, NotChecked=1380, Total=4290 [2021-11-23 03:29:03,320 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 90 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 975 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 03:29:03,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 904 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 975 Unchecked, 0.6s Time] [2021-11-23 03:29:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-23 03:29:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-11-23 03:29:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 97 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:29:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2021-11-23 03:29:03,328 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 41 [2021-11-23 03:29:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:29:03,329 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2021-11-23 03:29:03,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 50 states have (on average 3.32) internal successors, (166), 40 states have internal predecessors, (166), 16 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (17), 13 states have call predecessors, (17), 16 states have call successors, (17) [2021-11-23 03:29:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2021-11-23 03:29:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 03:29:03,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:29:03,331 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:29:03,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-23 03:29:03,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 03:29:03,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-23 03:29:03,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:29:03,955 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:29:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:29:03,955 INFO L85 PathProgramCache]: Analyzing trace with hash 483750338, now seen corresponding path program 1 times [2021-11-23 03:29:03,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:29:03,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756583153] [2021-11-23 03:29:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:29:03,956 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:29:03,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:29:03,957 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:29:03,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-23 03:29:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:29:04,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 03:29:04,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:29:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 03:29:04,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:29:04,354 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 8 treesize of output 6 [2021-11-23 03:29:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 03:29:04,585 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:29:04,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756583153] [2021-11-23 03:29:04,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756583153] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 03:29:04,585 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:29:04,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-23 03:29:04,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493300530] [2021-11-23 03:29:04,585 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 03:29:04,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:29:04,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:29:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:29:04,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:29:04,587 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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-23 03:29:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:29:04,901 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2021-11-23 03:29:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:29:04,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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 43 [2021-11-23 03:29:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:29:04,903 INFO L225 Difference]: With dead ends: 102 [2021-11-23 03:29:04,904 INFO L226 Difference]: Without dead ends: 102 [2021-11-23 03:29:04,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-23 03:29:04,904 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 204 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:29:04,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:29:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-23 03:29:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-11-23 03:29:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:29:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2021-11-23 03:29:04,911 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 43 [2021-11-23 03:29:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:29:04,911 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2021-11-23 03:29:04,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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-23 03:29:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2021-11-23 03:29:04,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 03:29:04,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:29:04,914 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:29:04,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-23 03:29:05,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:29:05,126 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:29:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:29:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1027607010, now seen corresponding path program 1 times [2021-11-23 03:29:05,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:29:05,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674230766] [2021-11-23 03:29:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:29:05,128 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:29:05,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:29:05,129 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:29:05,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-23 03:29:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:29:05,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 03:29:05,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:29:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 03:29:05,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:29:05,466 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 03:29:05,467 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 19 treesize of output 18 [2021-11-23 03:29:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 03:29:05,543 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:29:05,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674230766] [2021-11-23 03:29:05,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674230766] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 03:29:05,544 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:29:05,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-23 03:29:05,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138231563] [2021-11-23 03:29:05,544 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 03:29:05,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:29:05,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:29:05,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:29:05,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:29:05,545 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-23 03:29:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:29:05,820 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2021-11-23 03:29:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 03:29:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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) Word has length 45 [2021-11-23 03:29:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:29:05,823 INFO L225 Difference]: With dead ends: 112 [2021-11-23 03:29:05,823 INFO L226 Difference]: Without dead ends: 112 [2021-11-23 03:29:05,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:29:05,825 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 135 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:29:05,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 98 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:29:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-23 03:29:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2021-11-23 03:29:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.463768115942029) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:29:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2021-11-23 03:29:05,833 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 45 [2021-11-23 03:29:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:29:05,833 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2021-11-23 03:29:05,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-23 03:29:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2021-11-23 03:29:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 03:29:05,835 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:29:05,836 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:29:05,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-23 03:29:06,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:29:06,048 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:29:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:29:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1027607011, now seen corresponding path program 1 times [2021-11-23 03:29:06,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:29:06,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101282385] [2021-11-23 03:29:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:29:06,049 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:29:06,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:29:06,051 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:29:06,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-23 03:29:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:29:06,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-23 03:29:06,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:29:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 03:29:06,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:29:06,619 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 03:29:06,619 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 22 treesize of output 26 [2021-11-23 03:29:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 03:29:07,023 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:29:07,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101282385] [2021-11-23 03:29:07,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101282385] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 03:29:07,024 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:29:07,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-23 03:29:07,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475277569] [2021-11-23 03:29:07,024 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 03:29:07,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:29:07,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:29:07,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:29:07,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:29:07,025 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 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-23 03:29:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:29:07,369 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2021-11-23 03:29:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:29:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 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 45 [2021-11-23 03:29:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:29:07,371 INFO L225 Difference]: With dead ends: 98 [2021-11-23 03:29:07,371 INFO L226 Difference]: Without dead ends: 98 [2021-11-23 03:29:07,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-11-23 03:29:07,373 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 129 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:29:07,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 109 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:29:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-23 03:29:07,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-11-23 03:29:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.434782608695652) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:29:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2021-11-23 03:29:07,378 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 45 [2021-11-23 03:29:07,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:29:07,378 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2021-11-23 03:29:07,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 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-23 03:29:07,379 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2021-11-23 03:29:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 03:29:07,380 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:29:07,381 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:29:07,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-23 03:29:07,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:29:07,593 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-23 03:29:07,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:29:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1027760007, now seen corresponding path program 1 times [2021-11-23 03:29:07,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:29:07,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964503305] [2021-11-23 03:29:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:29:07,594 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:29:07,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:29:07,595 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:29:07,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-23 03:29:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:29:07,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-23 03:29:07,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:29:07,914 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-23 03:29:08,237 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-23 03:29:08,255 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-23 03:29:08,584 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 20 treesize of output 16 [2021-11-23 03:29:08,593 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-23 03:29:13,701 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-23 03:29:13,702 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-23 03:29:13,760 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-23 03:29:13,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2021-11-23 03:29:13,897 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-23 03:29:13,897 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 63 treesize of output 55 [2021-11-23 03:29:14,750 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-23 03:29:14,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 46 [2021-11-23 03:29:14,761 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-23 03:29:14,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2021-11-23 03:29:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 03:29:15,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:29:30,386 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (let ((.cse3 (bvadd (_ bv8 32) .cse2))) (and (bvule (bvadd (_ bv4 32) .cse2) .cse3) (bvule .cse3 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))))) is different from false [2021-11-23 03:29:37,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (and (forall ((v_DerPreprocessor_4 (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))))) is different from false [2021-11-23 03:29:39,072 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (and (forall ((v_DerPreprocessor_4 (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))))) is different from true [2021-11-23 03:29:42,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (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|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (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|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select (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|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))))) is different from false [2021-11-23 03:29:44,384 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (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|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (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|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select (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|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))))) is different from true [2021-11-23 03:29:51,565 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_120| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120|) .cse1 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_#length| |v_node_create_~temp~0#1.base_120| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_120|) .cse1 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (not (bvult |v_node_create_~temp~0#1.base_120| |c_#StackHeapBarrier|)))) is different from true [2021-11-23 03:29:57,689 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 4521 treesize of output 4485 [2021-11-23 03:29:57,717 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 62652 treesize of output 61616 [2021-11-23 03:29:58,546 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:29:58,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964503305] [2021-11-23 03:29:58,546 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-23 03:29:58,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2085326053] [2021-11-23 03:29:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:29:58,547 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 03:29:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 03:29:58,548 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 03:29:58,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-11-23 03:29:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:29:58,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-23 03:29:58,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:29:59,190 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-23 03:29:59,209 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-23 03:30:03,537 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 38 treesize of output 30 [2021-11-23 03:30:03,547 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-23 03:30:19,952 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-23 03:30:19,953 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 89 [2021-11-23 03:30:20,110 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-23 03:30:20,110 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 90 treesize of output 82 [2021-11-23 03:30:20,159 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-23 03:30:20,159 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 79 treesize of output 79 [2021-11-23 03:30:20,220 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-23 03:30:20,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 63 [2021-11-23 03:30:21,421 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-23 03:30:21,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 50 [2021-11-23 03:30:21,431 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-23 03:30:21,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2021-11-23 03:30:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 03:30:22,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:30:50,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (let ((.cse1 (bvadd .cse0 (_ bv8 32)))) (and (bvule (bvadd .cse0 (_ bv4 32)) .cse1) (bvule .cse1 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.base_123| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_123| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_123|)))) (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse3 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_123| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))))))))) is different from false [2021-11-23 03:30:59,197 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (exists ((|v_node_create_~temp~0#1.base_123| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_123| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_123|)))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) .cse1 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_123| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123|) .cse1 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))))))))) is different from false [2021-11-23 03:31:02,834 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (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|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (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|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select (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|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (exists ((|v_node_create_~temp~0#1.base_123| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_123| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_123|)))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) .cse2 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_123| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123|) .cse2 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))))))) is different from false [2021-11-23 03:31:04,851 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (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|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (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|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select (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|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (exists ((|v_node_create_~temp~0#1.base_123| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_123| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_123|)))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) .cse2 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_123| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123|) .cse2 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))))))) is different from true [2021-11-23 03:32:36,078 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 239 treesize of output 231 [2021-11-23 03:32:36,090 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 567 treesize of output 539 [2021-11-23 03:32:57,741 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 16 treesize of output 14 [2021-11-23 03:33:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2021-11-23 03:33:10,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2085326053] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:33:10,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040640711] [2021-11-23 03:33:10,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:33:10,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:33:10,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:33:10,065 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:33:10,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d44f51c-4206-423a-aa8c-a3488a8a0742/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 03:33:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:33:10,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-23 03:33:10,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:33:10,164 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-23 03:33:16,211 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 03:33:16,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-11-23 03:33:17,043 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-23 03:33:22,366 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-11-23 03:33:22,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 62