./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30338be39fffa4ca48f26b164131a7bd561f2b23 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30338be39fffa4ca48f26b164131a7bd561f2b23 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_37 term size 37 --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:06:04,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:06:04,337 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:06:04,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:06:04,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:06:04,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:06:04,345 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:06:04,346 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:06:04,347 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:06:04,348 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:06:04,349 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:06:04,349 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:06:04,349 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:06:04,350 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:06:04,351 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:06:04,351 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:06:04,352 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:06:04,353 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:06:04,354 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:06:04,355 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:06:04,356 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:06:04,357 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:06:04,358 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:06:04,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:06:04,359 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:06:04,359 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:06:04,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:06:04,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:06:04,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:06:04,362 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:06:04,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:06:04,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:06:04,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:06:04,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:06:04,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:06:04,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:06:04,364 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 15:06:04,374 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:06:04,374 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:06:04,374 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:06:04,375 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:06:04,375 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:06:04,375 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:06:04,375 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:06:04,375 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 15:06:04,375 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:06:04,375 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:06:04,375 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 15:06:04,376 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 15:06:04,376 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:06:04,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:06:04,376 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:06:04,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:06:04,377 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:06:04,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:06:04,377 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:06:04,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:06:04,377 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:06:04,377 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:06:04,377 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:06:04,378 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:06:04,378 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:06:04,378 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:06:04,378 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:06:04,378 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:06:04,378 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:06:04,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:06:04,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:06:04,379 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:06:04,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:06:04,379 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 15:06:04,379 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:06:04,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:06:04,379 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 15:06:04,379 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30338be39fffa4ca48f26b164131a7bd561f2b23 [2018-11-18 15:06:04,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:06:04,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:06:04,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:06:04,414 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:06:04,414 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:06:04,415 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 15:06:04,453 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/data/21ffdad5b/662d30c21c874425bf2e77c3ed9068fe/FLAG9d41e108d [2018-11-18 15:06:04,829 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:06:04,829 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 15:06:04,839 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/data/21ffdad5b/662d30c21c874425bf2e77c3ed9068fe/FLAG9d41e108d [2018-11-18 15:06:05,214 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/data/21ffdad5b/662d30c21c874425bf2e77c3ed9068fe [2018-11-18 15:06:05,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:06:05,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:06:05,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:06:05,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:06:05,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:06:05,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:06:05" (1/1) ... [2018-11-18 15:06:05,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc0d945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05, skipping insertion in model container [2018-11-18 15:06:05,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:06:05" (1/1) ... [2018-11-18 15:06:05,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:06:05,250 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:06:05,443 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:06:05,451 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:06:05,484 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:06:05,556 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:06:05,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05 WrapperNode [2018-11-18 15:06:05,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:06:05,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:06:05,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:06:05,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:06:05,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05" (1/1) ... [2018-11-18 15:06:05,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05" (1/1) ... [2018-11-18 15:06:05,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:06:05,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:06:05,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:06:05,583 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:06:05,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05" (1/1) ... [2018-11-18 15:06:05,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05" (1/1) ... [2018-11-18 15:06:05,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05" (1/1) ... [2018-11-18 15:06:05,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05" (1/1) ... [2018-11-18 15:06:05,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05" (1/1) ... [2018-11-18 15:06:05,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05" (1/1) ... [2018-11-18 15:06:05,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05" (1/1) ... [2018-11-18 15:06:05,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:06:05,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:06:05,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:06:05,612 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:06:05,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:06:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-18 15:06:05,654 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-18 15:06:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:06:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:06:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 15:06:05,654 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 15:06:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-11-18 15:06:05,654 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-11-18 15:06:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:06:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 15:06:05,655 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 15:06:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:06:05,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:06:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:06:05,655 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:06:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 15:06:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 15:06:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:06:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-18 15:06:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-18 15:06:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:06:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:06:05,902 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:06:05,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:06:05 BoogieIcfgContainer [2018-11-18 15:06:05,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:06:05,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:06:05,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:06:05,906 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:06:05,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:06:05" (1/3) ... [2018-11-18 15:06:05,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ed7aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:06:05, skipping insertion in model container [2018-11-18 15:06:05,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:06:05" (2/3) ... [2018-11-18 15:06:05,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ed7aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:06:05, skipping insertion in model container [2018-11-18 15:06:05,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:06:05" (3/3) ... [2018-11-18 15:06:05,908 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 15:06:05,914 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:06:05,919 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:06:05,928 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:06:05,949 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:06:05,949 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:06:05,949 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:06:05,949 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:06:05,949 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:06:05,949 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:06:05,949 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:06:05,949 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:06:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-18 15:06:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 15:06:05,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:06:05,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:06:05,968 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:06:05,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:06:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash -817814061, now seen corresponding path program 1 times [2018-11-18 15:06:05,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:06:06,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:06,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:06:06,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:06,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:06:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:06:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:06:06,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:06:06,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:06:06,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:06:06,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 15:06:06,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:06:06,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:06:06,096 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-11-18 15:06:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:06:06,114 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2018-11-18 15:06:06,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:06:06,115 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-18 15:06:06,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:06:06,122 INFO L225 Difference]: With dead ends: 96 [2018-11-18 15:06:06,122 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 15:06:06,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:06:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 15:06:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-18 15:06:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 15:06:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-18 15:06:06,152 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 29 [2018-11-18 15:06:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:06:06,152 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-18 15:06:06,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 15:06:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-18 15:06:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 15:06:06,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:06:06,153 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:06:06,153 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:06:06,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:06:06,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1947349429, now seen corresponding path program 1 times [2018-11-18 15:06:06,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:06:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:06,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:06:06,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:06,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:06:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:06:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:06:06,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:06:06,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 15:06:06,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:06:06,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 15:06:06,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 15:06:06,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:06:06,324 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 10 states. [2018-11-18 15:06:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:06:06,454 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-18 15:06:06,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:06:06,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-18 15:06:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:06:06,456 INFO L225 Difference]: With dead ends: 58 [2018-11-18 15:06:06,456 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 15:06:06,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:06:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 15:06:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-11-18 15:06:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 15:06:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-18 15:06:06,461 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 31 [2018-11-18 15:06:06,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:06:06,462 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-18 15:06:06,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 15:06:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-18 15:06:06,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 15:06:06,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:06:06,463 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:06:06,463 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:06:06,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:06:06,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1947351103, now seen corresponding path program 1 times [2018-11-18 15:06:06,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:06:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:06,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:06:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:06,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:06:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:06:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:06:06,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:06:06,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:06:06,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:06:06,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:06:06,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:06:06,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:06:06,520 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 5 states. [2018-11-18 15:06:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:06:06,550 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-18 15:06:06,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:06:06,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 15:06:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:06:06,551 INFO L225 Difference]: With dead ends: 84 [2018-11-18 15:06:06,551 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 15:06:06,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:06:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 15:06:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-18 15:06:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 15:06:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-18 15:06:06,558 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 31 [2018-11-18 15:06:06,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:06:06,558 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-18 15:06:06,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:06:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-18 15:06:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 15:06:06,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:06:06,559 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:06:06,559 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:06:06,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:06:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1222524613, now seen corresponding path program 1 times [2018-11-18 15:06:06,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:06:06,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:06,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:06:06,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:06,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:06:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:06:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:06:06,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:06:06,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:06:06,608 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:06:06,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:06:06,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:06:06,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:06:06,609 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-11-18 15:06:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:06:06,628 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-11-18 15:06:06,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:06:06,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-18 15:06:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:06:06,629 INFO L225 Difference]: With dead ends: 90 [2018-11-18 15:06:06,629 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 15:06:06,630 INFO L604 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 [2018-11-18 15:06:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 15:06:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-18 15:06:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 15:06:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-18 15:06:06,633 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 42 [2018-11-18 15:06:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:06:06,634 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-18 15:06:06,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:06:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-18 15:06:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 15:06:06,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:06:06,635 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:06:06,635 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:06:06,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:06:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1081976003, now seen corresponding path program 1 times [2018-11-18 15:06:06,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:06:06,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:06,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:06:06,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:06,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:06:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:06:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:06:06,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:06:06,707 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:06:06,708 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-18 15:06:06,709 INFO L202 CegarAbsIntRunner]: [0], [2], [4], [8], [14], [17], [30], [52], [53], [54], [58], [62], [64], [66], [71], [73], [77], [78], [79], [81], [84], [103], [107], [113], [115], [116], [117], [118], [119], [120], [123], [124], [125], [126], [127], [128], [129] [2018-11-18 15:06:06,734 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:06:06,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:06:06,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:06:06,958 INFO L272 AbstractInterpreter]: Visited 37 different actions 65 times. Merged at 6 different actions 12 times. Never widened. Performed 549 root evaluator evaluations with a maximum evaluation depth of 3. Performed 549 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-11-18 15:06:06,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:06:06,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:06:06,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:06:06,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:06:06,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:06:06,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:06:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:06:07,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:06:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:06:07,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:06:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:06:07,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:06:07,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-11-18 15:06:07,158 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:06:07,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:06:07,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:06:07,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:06:07,159 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-11-18 15:06:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:06:07,196 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-11-18 15:06:07,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:06:07,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-18 15:06:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:06:07,198 INFO L225 Difference]: With dead ends: 90 [2018-11-18 15:06:07,198 INFO L226 Difference]: Without dead ends: 58 [2018-11-18 15:06:07,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:06:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-18 15:06:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-18 15:06:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 15:06:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-11-18 15:06:07,202 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 42 [2018-11-18 15:06:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:06:07,203 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-11-18 15:06:07,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:06:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-18 15:06:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 15:06:07,204 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:06:07,204 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:06:07,204 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:06:07,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:06:07,204 INFO L82 PathProgramCache]: Analyzing trace with hash 535458685, now seen corresponding path program 1 times [2018-11-18 15:06:07,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:06:07,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:07,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:06:07,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:07,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:06:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:06:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:06:07,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:06:07,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:06:07,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-18 15:06:07,569 INFO L202 CegarAbsIntRunner]: [0], [2], [4], [8], [14], [17], [30], [52], [53], [54], [58], [62], [64], [66], [69], [71], [73], [77], [78], [79], [81], [84], [103], [107], [113], [115], [116], [117], [118], [119], [120], [123], [124], [125], [126], [127], [128], [129] [2018-11-18 15:06:07,571 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:06:07,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:06:07,673 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:06:07,673 INFO L272 AbstractInterpreter]: Visited 38 different actions 71 times. Merged at 9 different actions 15 times. Never widened. Performed 612 root evaluator evaluations with a maximum evaluation depth of 3. Performed 612 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 27 variables. [2018-11-18 15:06:07,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:06:07,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:06:07,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:06:07,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:06:07,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:06:07,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:06:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:06:07,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:06:07,812 INFO L477 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 11 treesize of output 8 [2018-11-18 15:06:07,814 INFO L477 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 8 treesize of output 7 [2018-11-18 15:06:07,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 15:06:07,898 INFO L477 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 11 treesize of output 8 [2018-11-18 15:06:07,900 INFO L477 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 8 treesize of output 7 [2018-11-18 15:06:07,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,910 INFO L477 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 11 treesize of output 8 [2018-11-18 15:06:07,911 INFO L477 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 8 treesize of output 7 [2018-11-18 15:06:07,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-11-18 15:06:07,971 INFO L477 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 23 treesize of output 19 [2018-11-18 15:06:07,974 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-18 15:06:07,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 15:06:07,986 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-18 15:06:07,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:07,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:11 [2018-11-18 15:06:08,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 15:06:08,018 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 15:06:08,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:08,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:08,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:08,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-11-18 15:06:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 15:06:08,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:06:08,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-18 15:06:08,221 INFO L477 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 13 treesize of output 11 [2018-11-18 15:06:08,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:06:08,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:06:08,233 INFO L477 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 9 [2018-11-18 15:06:08,235 INFO L477 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 [2018-11-18 15:06:08,235 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:06:08,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:06:08,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-18 15:06:08,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:54 [2018-11-18 15:06:08,377 INFO L477 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 14 treesize of output 12 [2018-11-18 15:06:08,378 INFO L477 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 [2018-11-18 15:06:08,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:08,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:08,383 INFO L477 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 14 treesize of output 12 [2018-11-18 15:06:08,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-11-18 15:06:08,385 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:08,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:08,403 INFO L477 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 14 treesize of output 12 [2018-11-18 15:06:08,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-11-18 15:06:08,405 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:08,408 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:08,409 INFO L477 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 14 treesize of output 12 [2018-11-18 15:06:08,410 INFO L477 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 [2018-11-18 15:06:08,410 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:08,412 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:08,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 15:06:08,422 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:42, output treesize:10 [2018-11-18 15:06:08,445 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 15:06:08,461 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:06:08,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [18] total 33 [2018-11-18 15:06:08,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:06:08,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 15:06:08,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 15:06:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 15:06:08,463 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 12 states. [2018-11-18 15:06:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:06:08,650 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-18 15:06:08,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:06:08,651 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-18 15:06:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:06:08,652 INFO L225 Difference]: With dead ends: 63 [2018-11-18 15:06:08,652 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 15:06:08,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 15:06:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 15:06:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-11-18 15:06:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 15:06:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-11-18 15:06:08,659 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 53 [2018-11-18 15:06:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:06:08,659 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-18 15:06:08,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 15:06:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-18 15:06:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 15:06:08,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:06:08,661 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:06:08,661 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:06:08,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:06:08,661 INFO L82 PathProgramCache]: Analyzing trace with hash 342351468, now seen corresponding path program 1 times [2018-11-18 15:06:08,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:06:08,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:08,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:06:08,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:06:08,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:06:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:06:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 15:06:09,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:06:09,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:06:09,075 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-18 15:06:09,075 INFO L202 CegarAbsIntRunner]: [0], [2], [4], [8], [12], [14], [19], [25], [30], [52], [53], [54], [58], [62], [64], [66], [69], [71], [73], [77], [78], [79], [81], [84], [103], [107], [113], [115], [116], [117], [118], [119], [120], [123], [124], [125], [126], [127], [128], [129] [2018-11-18 15:06:09,077 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:06:09,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:06:09,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:06:09,188 INFO L272 AbstractInterpreter]: Visited 40 different actions 91 times. Merged at 15 different actions 33 times. Never widened. Performed 738 root evaluator evaluations with a maximum evaluation depth of 3. Performed 738 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 29 variables. [2018-11-18 15:06:09,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:06:09,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:06:09,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:06:09,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:06:09,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:06:09,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:06:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:06:09,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:06:09,266 INFO L477 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 [2018-11-18 15:06:09,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:09,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:09,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 15:06:10,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:06:10,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:06:10,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:06:10,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-18 15:06:10,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-18 15:06:10,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:10,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:10,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:06:10,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:35 [2018-11-18 15:06:10,957 INFO L477 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 11 treesize of output 8 [2018-11-18 15:06:10,959 INFO L477 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 8 treesize of output 7 [2018-11-18 15:06:10,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:10,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:10,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:06:10,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2018-11-18 15:06:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 16 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 15:06:23,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:06:26,473 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_dll_append_~head.offset_BEFORE_CALL_4 Int) (node_create_~temp~0.offset Int) (v_dll_append_~head.base_BEFORE_CALL_4 Int)) (or (exists ((v_node_create_~temp~0.offset_45 Int) (|v_node_create_#t~malloc2.base_39| Int)) (and (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_#t~malloc2.base_39| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_#t~malloc2.base_39|) (+ v_node_create_~temp~0.offset_45 4) 0) (+ v_node_create_~temp~0.offset_45 8) 0)) v_dll_append_~head.base_BEFORE_CALL_4) v_dll_append_~head.offset_BEFORE_CALL_4)) (= (select |c_old(#valid)| |v_node_create_#t~malloc2.base_39|) 0))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_node_create_~temp~0.base (store (store (select |c_#memory_$Pointer$.base| c_node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0)) v_dll_append_~head.base_BEFORE_CALL_4) v_dll_append_~head.offset_BEFORE_CALL_4) 0)))) is different from false [2018-11-18 15:06:51,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-18 15:06:51,787 INFO L477 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 9 treesize of output 8 [2018-11-18 15:06:51,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:51,794 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-18 15:06:51,801 INFO L477 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 2 case distinctions, treesize of input 23 treesize of output 33 [2018-11-18 15:06:51,819 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:06:51,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-18 15:06:51,820 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:51,822 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 4 [2018-11-18 15:06:51,822 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:51,830 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-18 15:06:51,830 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:51,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 15:06:51,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 15:06:51,839 INFO L477 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 17 treesize of output 13 [2018-11-18 15:06:51,840 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 15:06:51,841 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 15:06:51,842 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:06:51,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 15:06:51,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 15:06:51,857 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:46, output treesize:18 [2018-11-18 15:06:54,055 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 15:06:58,292 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 15:06:58,295 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 15:06:58,298 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 15:07:00,514 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 15:07:00,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 15:07:00,520 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 15:07:00,522 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 15:07:06,702 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 15:07:06,706 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 15:07:06,710 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 15:07:12,943 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 15:07:13,443 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-18 15:07:13,468 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 15:07:13,725 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:07:13,726 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 34626 column 11: unknown constant v_prenex_14 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:114) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:120) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.checkEqualityStatus(Elim1Store.java:667) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:759) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 15:07:13,728 INFO L168 Benchmark]: Toolchain (without parser) took 68511.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.2 MB). Free memory was 956.4 MB in the beginning and 867.4 MB in the end (delta: 89.1 MB). Peak memory consumption was 373.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:07:13,729 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:07:13,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:07:13,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:07:13,730 INFO L168 Benchmark]: Boogie Preprocessor took 28.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:07:13,730 INFO L168 Benchmark]: RCFGBuilder took 291.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:07:13,730 INFO L168 Benchmark]: TraceAbstraction took 67823.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.4 MB). Free memory was 1.1 GB in the beginning and 867.4 MB in the end (delta: 241.6 MB). Peak memory consumption was 367.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:07:13,733 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 291.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 67823.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.4 MB). Free memory was 1.1 GB in the beginning and 867.4 MB in the end (delta: 241.6 MB). Peak memory consumption was 367.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 34626 column 11: unknown constant v_prenex_14 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 34626 column 11: unknown constant v_prenex_14: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 15:07:15,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:07:15,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:07:15,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:07:15,123 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:07:15,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:07:15,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:07:15,126 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:07:15,127 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:07:15,128 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:07:15,128 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:07:15,129 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:07:15,129 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:07:15,130 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:07:15,131 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:07:15,132 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:07:15,132 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:07:15,134 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:07:15,135 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:07:15,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:07:15,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:07:15,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:07:15,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:07:15,140 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:07:15,140 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:07:15,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:07:15,142 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:07:15,142 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:07:15,143 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:07:15,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:07:15,144 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:07:15,145 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:07:15,145 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:07:15,145 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:07:15,145 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:07:15,146 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:07:15,147 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 15:07:15,157 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:07:15,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:07:15,158 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:07:15,158 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:07:15,158 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:07:15,158 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:07:15,158 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:07:15,159 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:07:15,159 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:07:15,159 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:07:15,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:07:15,160 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:07:15,160 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:07:15,160 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:07:15,160 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:07:15,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:07:15,160 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:07:15,160 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 15:07:15,160 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 15:07:15,161 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:07:15,161 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:07:15,161 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:07:15,161 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:07:15,161 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:07:15,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:07:15,161 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:07:15,161 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:07:15,162 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:07:15,162 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:07:15,162 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:07:15,162 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:07:15,165 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 15:07:15,165 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:07:15,165 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 15:07:15,165 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 15:07:15,165 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30338be39fffa4ca48f26b164131a7bd561f2b23 [2018-11-18 15:07:15,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:07:15,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:07:15,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:07:15,209 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:07:15,209 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:07:15,210 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 15:07:15,245 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/data/68a82ce26/d3160cd52a62495e9a88978f5da719f0/FLAG35590e28b [2018-11-18 15:07:15,677 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:07:15,677 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 15:07:15,686 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/data/68a82ce26/d3160cd52a62495e9a88978f5da719f0/FLAG35590e28b [2018-11-18 15:07:15,695 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/data/68a82ce26/d3160cd52a62495e9a88978f5da719f0 [2018-11-18 15:07:15,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:07:15,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:07:15,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:07:15,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:07:15,702 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:07:15,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:07:15" (1/1) ... [2018-11-18 15:07:15,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d27473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:15, skipping insertion in model container [2018-11-18 15:07:15,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:07:15" (1/1) ... [2018-11-18 15:07:15,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:07:15,744 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:07:15,980 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:07:15,990 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:07:16,028 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:07:16,108 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:07:16,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16 WrapperNode [2018-11-18 15:07:16,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:07:16,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:07:16,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:07:16,109 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:07:16,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16" (1/1) ... [2018-11-18 15:07:16,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16" (1/1) ... [2018-11-18 15:07:16,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:07:16,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:07:16,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:07:16,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:07:16,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16" (1/1) ... [2018-11-18 15:07:16,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16" (1/1) ... [2018-11-18 15:07:16,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16" (1/1) ... [2018-11-18 15:07:16,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16" (1/1) ... [2018-11-18 15:07:16,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16" (1/1) ... [2018-11-18 15:07:16,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16" (1/1) ... [2018-11-18 15:07:16,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16" (1/1) ... [2018-11-18 15:07:16,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:07:16,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:07:16,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:07:16,154 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:07:16,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:07:16,187 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-18 15:07:16,187 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-18 15:07:16,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:07:16,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 15:07:16,187 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 15:07:16,188 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 15:07:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-11-18 15:07:16,188 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-11-18 15:07:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 15:07:16,188 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 15:07:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:07:16,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:07:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:07:16,188 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:07:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 15:07:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 15:07:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:07:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 15:07:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-18 15:07:16,189 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-18 15:07:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:07:16,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:07:16,451 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:07:16,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:07:16 BoogieIcfgContainer [2018-11-18 15:07:16,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:07:16,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:07:16,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:07:16,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:07:16,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:07:15" (1/3) ... [2018-11-18 15:07:16,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc99a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:07:16, skipping insertion in model container [2018-11-18 15:07:16,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:16" (2/3) ... [2018-11-18 15:07:16,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc99a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:07:16, skipping insertion in model container [2018-11-18 15:07:16,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:07:16" (3/3) ... [2018-11-18 15:07:16,459 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 15:07:16,466 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:07:16,471 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:07:16,479 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:07:16,497 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:07:16,497 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:07:16,497 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:07:16,497 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:07:16,497 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:07:16,498 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:07:16,498 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:07:16,498 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:07:16,498 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:07:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-18 15:07:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 15:07:16,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:07:16,513 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:07:16,515 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:07:16,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash -817814061, now seen corresponding path program 1 times [2018-11-18 15:07:16,521 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:07:16,521 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:07:16,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:07:16,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:07:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:07:16,619 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 15:07:16,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:07:16,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:07:16,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 15:07:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:07:16,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:07:16,635 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-11-18 15:07:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:07:16,651 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2018-11-18 15:07:16,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:07:16,652 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-18 15:07:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:07:16,658 INFO L225 Difference]: With dead ends: 96 [2018-11-18 15:07:16,659 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 15:07:16,661 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:07:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 15:07:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-18 15:07:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 15:07:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-18 15:07:16,687 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 29 [2018-11-18 15:07:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:07:16,688 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-18 15:07:16,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 15:07:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-18 15:07:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 15:07:16,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:07:16,690 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:07:16,690 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:07:16,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:16,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1947349429, now seen corresponding path program 1 times [2018-11-18 15:07:16,691 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:07:16,691 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:07:16,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:07:16,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:07:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:07:16,781 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:07:16,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:07:16,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:07:16,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:07:16,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:07:16,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:07:16,785 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 5 states. [2018-11-18 15:07:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:07:16,843 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-11-18 15:07:16,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:07:16,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 15:07:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:07:16,845 INFO L225 Difference]: With dead ends: 74 [2018-11-18 15:07:16,845 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 15:07:16,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:07:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 15:07:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-18 15:07:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 15:07:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-18 15:07:16,854 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 31 [2018-11-18 15:07:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:07:16,854 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-18 15:07:16,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:07:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-18 15:07:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 15:07:16,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:07:16,856 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:07:16,856 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:07:16,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1222526287, now seen corresponding path program 1 times [2018-11-18 15:07:16,857 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:07:16,857 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:07:16,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:07:16,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:07:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:07:16,947 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:07:16,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:07:16,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:07:16,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:07:16,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:07:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:07:16,949 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2018-11-18 15:07:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:07:16,983 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-18 15:07:16,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:07:16,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-18 15:07:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:07:16,985 INFO L225 Difference]: With dead ends: 80 [2018-11-18 15:07:16,985 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 15:07:16,986 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:07:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 15:07:16,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-18 15:07:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 15:07:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-18 15:07:16,992 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 42 [2018-11-18 15:07:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:07:16,993 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-18 15:07:16,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:07:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-18 15:07:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 15:07:16,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:07:16,994 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:07:16,994 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:07:16,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1081977677, now seen corresponding path program 1 times [2018-11-18 15:07:16,995 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:07:16,995 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:07:17,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:07:17,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:07:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:07:17,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:07:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:07:17,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:07:17,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:07:17,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:07:17,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:07:17,474 INFO L477 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 11 treesize of output 8 [2018-11-18 15:07:17,476 INFO L477 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 8 treesize of output 7 [2018-11-18 15:07:17,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:17,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:17,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:17,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-18 15:07:17,528 INFO L477 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 16 treesize of output 12 [2018-11-18 15:07:17,530 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-18 15:07:17,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:17,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:17,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:17,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-18 15:07:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 15:07:17,561 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:07:17,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:07:17,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 6] total 17 [2018-11-18 15:07:17,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 15:07:17,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 15:07:17,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-18 15:07:17,578 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 17 states. [2018-11-18 15:07:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:07:18,163 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-11-18 15:07:18,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 15:07:18,164 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-11-18 15:07:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:07:18,165 INFO L225 Difference]: With dead ends: 94 [2018-11-18 15:07:18,165 INFO L226 Difference]: Without dead ends: 67 [2018-11-18 15:07:18,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-11-18 15:07:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-18 15:07:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2018-11-18 15:07:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 15:07:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-11-18 15:07:18,171 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 42 [2018-11-18 15:07:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:07:18,172 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-11-18 15:07:18,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 15:07:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-18 15:07:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 15:07:18,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:07:18,173 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:07:18,173 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:07:18,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash 535458685, now seen corresponding path program 1 times [2018-11-18 15:07:18,173 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:07:18,174 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:07:18,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:07:18,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:07:18,309 INFO L477 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 11 treesize of output 8 [2018-11-18 15:07:18,312 INFO L477 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 8 treesize of output 7 [2018-11-18 15:07:18,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 15:07:18,390 INFO L477 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 11 treesize of output 8 [2018-11-18 15:07:18,392 INFO L477 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 8 treesize of output 7 [2018-11-18 15:07:18,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,407 INFO L477 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 11 treesize of output 8 [2018-11-18 15:07:18,409 INFO L477 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 8 treesize of output 7 [2018-11-18 15:07:18,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-18 15:07:18,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 15:07:18,472 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 15:07:18,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 15:07:18,487 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-18 15:07:18,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2018-11-18 15:07:18,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 15:07:18,519 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 15:07:18,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:18,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-18 15:07:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 15:07:18,552 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:07:18,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:07:18,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 15:07:18,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 15:07:18,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 15:07:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:07:18,555 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 12 states. [2018-11-18 15:07:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:07:19,025 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-18 15:07:19,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:07:19,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-18 15:07:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:07:19,027 INFO L225 Difference]: With dead ends: 63 [2018-11-18 15:07:19,027 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 15:07:19,027 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-18 15:07:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 15:07:19,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-11-18 15:07:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 15:07:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-11-18 15:07:19,034 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 53 [2018-11-18 15:07:19,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:07:19,034 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-18 15:07:19,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 15:07:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-18 15:07:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 15:07:19,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:07:19,035 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:07:19,035 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:07:19,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:19,036 INFO L82 PathProgramCache]: Analyzing trace with hash 342351468, now seen corresponding path program 1 times [2018-11-18 15:07:19,036 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:07:19,036 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:07:19,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:07:19,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:07:19,200 INFO L477 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 11 treesize of output 8 [2018-11-18 15:07:19,201 INFO L477 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 8 treesize of output 7 [2018-11-18 15:07:19,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:19,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:19,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:19,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-18 15:07:21,276 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))))) is different from true [2018-11-18 15:07:25,325 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 15:07:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-11-18 15:07:25,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:07:25,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:07:25,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:07:25,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:07:25,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:07:25,707 INFO L477 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 11 treesize of output 8 [2018-11-18 15:07:25,709 INFO L477 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 8 treesize of output 7 [2018-11-18 15:07:25,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:25,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:25,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:25,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-18 15:07:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-11-18 15:07:25,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:07:25,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:07:25,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-18 15:07:25,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 15:07:25,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 15:07:25,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=268, Unknown=2, NotChecked=32, Total=342 [2018-11-18 15:07:25,978 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 18 states. [2018-11-18 15:07:28,155 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 15:07:32,557 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 15:07:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:07:36,955 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-11-18 15:07:36,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 15:07:36,956 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-11-18 15:07:36,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:07:36,957 INFO L225 Difference]: With dead ends: 90 [2018-11-18 15:07:36,957 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 15:07:36,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=69, Invalid=485, Unknown=2, NotChecked=44, Total=600 [2018-11-18 15:07:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 15:07:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-18 15:07:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 15:07:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-18 15:07:36,963 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 56 [2018-11-18 15:07:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:07:36,963 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-18 15:07:36,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 15:07:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-18 15:07:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 15:07:36,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:07:36,964 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:07:36,964 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:07:36,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1046726519, now seen corresponding path program 1 times [2018-11-18 15:07:36,965 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:07:36,965 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:07:36,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:07:37,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:07:37,110 INFO L477 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 [2018-11-18 15:07:37,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:37,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:37,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 15:07:38,194 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-18 15:07:40,624 WARN L180 SmtUtils]: Spent 968.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 15:07:40,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:07:40,648 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:07:40,650 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:07:40,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-18 15:07:40,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-18 15:07:40,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:40,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:40,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:07:40,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:36 [2018-11-18 15:07:40,740 INFO L477 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 11 treesize of output 8 [2018-11-18 15:07:40,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 15:07:40,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:07:40,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:07:40,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:07:40,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:54 [2018-11-18 15:07:46,095 WARN L180 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 15:07:48,165 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 15:07:52,985 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 15:07:56,971 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 15:07:58,988 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_append_~last~0.offset (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32)) (dll_append_~new_last~0.offset (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)) (= |c_#memory_$Pointer$.base| (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (select |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32))))) (let ((.cse1 (select (select .cse2 |c_dll_append_#in~head.base|) |c_dll_append_#in~head.offset|))) (let ((.cse0 (store .cse2 .cse1 (store (select .cse2 .cse1) (bvadd dll_append_~last~0.offset (_ bv4 32)) dll_append_~new_last~0.base)))) (store .cse0 dll_append_~new_last~0.base (store (select .cse0 dll_append_~new_last~0.base) (bvadd dll_append_~new_last~0.offset (_ bv8 32)) .cse1)))))))) is different from true [2018-11-18 15:07:59,993 WARN L180 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-11-18 15:08:00,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:00,021 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:00,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:00,028 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:08:00,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 15:08:00,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:00,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:00,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:00,341 INFO L303 Elim1Store]: Index analysis took 140 ms [2018-11-18 15:08:00,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 104 [2018-11-18 15:08:00,349 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 15:08:00,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:00,366 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 15:08:00,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:00,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:00,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 89 [2018-11-18 15:08:00,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 15:08:00,514 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:00,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 81 [2018-11-18 15:08:00,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:00,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 56 [2018-11-18 15:08:00,685 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-18 15:08:00,805 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 15:08:00,928 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 15:08:01,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 15:08:01,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-18 15:08:01,223 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:245, output treesize:302 [2018-11-18 15:08:02,045 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-18 15:08:02,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 66 [2018-11-18 15:08:02,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 11 [2018-11-18 15:08:02,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-18 15:08:02,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:02,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-18 15:08:02,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 59 [2018-11-18 15:08:02,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-18 15:08:02,320 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2018-11-18 15:08:02,349 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 9 [2018-11-18 15:08:02,367 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,371 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 59 [2018-11-18 15:08:02,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:02,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:02,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-18 15:08:02,467 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-18 15:08:02,485 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 9 [2018-11-18 15:08:02,495 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,499 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:02,518 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:314, output treesize:4 [2018-11-18 15:08:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 16 not checked. [2018-11-18 15:08:04,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:08:05,112 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-18 15:08:05,257 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 15:08:05,506 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-18 15:08:05,778 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-18 15:08:11,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:08:11,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f4cf7c1-3681-4354-8e55-0134721cea09/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:08:11,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:08:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:11,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:15,880 INFO L477 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 [2018-11-18 15:08:15,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:15,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:15,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-11-18 15:08:16,297 INFO L477 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 11 treesize of output 8 [2018-11-18 15:08:16,300 INFO L477 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 8 treesize of output 7 [2018-11-18 15:08:16,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:16,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:16,317 INFO L477 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 11 treesize of output 8 [2018-11-18 15:08:16,319 INFO L477 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 8 treesize of output 7 [2018-11-18 15:08:16,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:16,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:16,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:16,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2018-11-18 15:08:32,811 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_append_~new_last~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (select |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))))) (let ((.cse1 (select (select .cse2 |c_dll_append_#in~head.base|) |c_dll_append_#in~head.offset|))) (let ((.cse0 (store .cse2 .cse1 (store (select .cse2 .cse1) (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| dll_append_~new_last~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| dll_append_~new_last~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |c_dll_append_#in~head.base|) |c_dll_append_#in~head.offset|) (_ bv4 32)) dll_append_~new_last~0.base)))) (store .cse0 dll_append_~new_last~0.base (store (select .cse0 dll_append_~new_last~0.base) (_ bv8 32) .cse1)))))) (= (select |c_old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)))) is different from true [2018-11-18 15:08:34,372 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 109 DAG size of output: 40 [2018-11-18 15:08:34,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:34,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:34,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-18 15:08:34,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:34,482 INFO L477 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 111 treesize of output 105 [2018-11-18 15:08:34,489 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 99 [2018-11-18 15:08:34,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:34,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:34,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:34,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 93 [2018-11-18 15:08:38,351 WARN L180 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2018-11-18 15:08:38,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:38,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 70 [2018-11-18 15:08:38,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:38,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 72 [2018-11-18 15:08:38,368 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:38,424 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:39,861 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 85 [2018-11-18 15:08:39,865 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-18 15:08:39,866 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:39,902 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:41,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:41,511 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:08:41,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-11-18 15:08:41,550 INFO L477 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 14 treesize of output 13 [2018-11-18 15:08:41,550 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:41,585 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:41,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:41,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-11-18 15:08:41,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 67 [2018-11-18 15:08:41,600 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:41,614 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:41,625 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:42,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 69 [2018-11-18 15:08:42,217 INFO L477 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 67 treesize of output 66 [2018-11-18 15:08:42,217 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:42,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:42,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:42,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:08:42,677 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:42,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 75 [2018-11-18 15:08:42,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:42,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:42,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 84 [2018-11-18 15:08:42,693 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 15:08:42,738 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:08:43,154 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:43,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:43,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 77 [2018-11-18 15:08:43,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:08:43,245 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:08:43,446 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:08:43,447 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_37 term size 37 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 15:08:43,449 INFO L168 Benchmark]: Toolchain (without parser) took 87751.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.9 MB). Free memory was 947.9 MB in the beginning and 941.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 284.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:43,449 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:08:43,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:43,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:43,450 INFO L168 Benchmark]: Boogie Preprocessor took 23.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:08:43,450 INFO L168 Benchmark]: RCFGBuilder took 297.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:43,451 INFO L168 Benchmark]: TraceAbstraction took 86996.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 1.1 GB in the beginning and 941.7 MB in the end (delta: 155.1 MB). Peak memory consumption was 284.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:43,452 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 297.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 86996.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 1.1 GB in the beginning and 941.7 MB in the end (delta: 155.1 MB). Peak memory consumption was 284.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_37 term size 37 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_37 term size 37: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...