./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cae663252cf3102da91695865874d633c1ee8349 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cae663252cf3102da91695865874d633c1ee8349 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 07:53:07,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 07:53:07,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 07:53:07,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 07:53:07,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 07:53:07,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 07:53:07,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 07:53:07,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 07:53:07,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 07:53:07,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 07:53:07,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 07:53:07,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 07:53:07,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 07:53:07,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 07:53:07,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 07:53:07,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 07:53:07,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 07:53:07,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 07:53:07,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 07:53:07,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 07:53:07,125 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 07:53:07,126 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 07:53:07,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 07:53:07,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 07:53:07,128 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 07:53:07,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 07:53:07,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 07:53:07,129 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 07:53:07,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 07:53:07,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 07:53:07,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 07:53:07,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 07:53:07,131 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 07:53:07,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 07:53:07,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 07:53:07,132 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 07:53:07,132 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 07:53:07,139 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 07:53:07,139 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 07:53:07,140 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 07:53:07,140 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 07:53:07,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 07:53:07,140 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 07:53:07,140 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 07:53:07,141 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 07:53:07,141 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 07:53:07,141 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 07:53:07,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 07:53:07,141 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 07:53:07,141 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 07:53:07,141 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 07:53:07,142 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 07:53:07,142 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 07:53:07,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 07:53:07,142 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 07:53:07,142 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 07:53:07,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 07:53:07,142 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 07:53:07,142 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 07:53:07,143 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 07:53:07,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 07:53:07,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 07:53:07,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 07:53:07,143 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 07:53:07,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 07:53:07,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> cae663252cf3102da91695865874d633c1ee8349 [2018-12-08 07:53:07,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 07:53:07,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 07:53:07,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 07:53:07,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 07:53:07,174 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 07:53:07,174 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-08 07:53:07,215 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/data/704e2e4d1/439ca5f62d764dc9b45c0a2e1c3595ea/FLAG02b036e33 [2018-12-08 07:53:07,720 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 07:53:07,721 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-08 07:53:07,727 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/data/704e2e4d1/439ca5f62d764dc9b45c0a2e1c3595ea/FLAG02b036e33 [2018-12-08 07:53:07,736 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/data/704e2e4d1/439ca5f62d764dc9b45c0a2e1c3595ea [2018-12-08 07:53:07,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 07:53:07,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 07:53:07,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 07:53:07,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 07:53:07,741 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 07:53:07,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:53:07" (1/1) ... [2018-12-08 07:53:07,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44bd7056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:07, skipping insertion in model container [2018-12-08 07:53:07,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:53:07" (1/1) ... [2018-12-08 07:53:07,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 07:53:07,766 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 07:53:07,915 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 07:53:07,921 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 07:53:07,983 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 07:53:08,005 INFO L195 MainTranslator]: Completed translation [2018-12-08 07:53:08,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:08 WrapperNode [2018-12-08 07:53:08,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 07:53:08,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 07:53:08,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 07:53:08,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 07:53:08,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:08" (1/1) ... [2018-12-08 07:53:08,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:08" (1/1) ... [2018-12-08 07:53:08,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:08" (1/1) ... [2018-12-08 07:53:08,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:08" (1/1) ... [2018-12-08 07:53:08,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:08" (1/1) ... [2018-12-08 07:53:08,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:08" (1/1) ... [2018-12-08 07:53:08,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:08" (1/1) ... [2018-12-08 07:53:08,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 07:53:08,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 07:53:08,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 07:53:08,037 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 07:53:08,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/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-12-08 07:53:08,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 07:53:08,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 07:53:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 07:53:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 07:53:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 07:53:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-08 07:53:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-08 07:53:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-08 07:53:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-12-08 07:53:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 07:53:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 07:53:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 07:53:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 07:53:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 07:53:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 07:53:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 07:53:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 07:53:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 07:53:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 07:53:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 07:53:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 07:53:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 07:53:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 07:53:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 07:53:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 07:53:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 07:53:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 07:53:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 07:53:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 07:53:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 07:53:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 07:53:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 07:53:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 07:53:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 07:53:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 07:53:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 07:53:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 07:53:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 07:53:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 07:53:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 07:53:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 07:53:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 07:53:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 07:53:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 07:53:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 07:53:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 07:53:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 07:53:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 07:53:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 07:53:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 07:53:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 07:53:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 07:53:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 07:53:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 07:53:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 07:53:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 07:53:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 07:53:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 07:53:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 07:53:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 07:53:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 07:53:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 07:53:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 07:53:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 07:53:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 07:53:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 07:53:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 07:53:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 07:53:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 07:53:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 07:53:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 07:53:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-08 07:53:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 07:53:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 07:53:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-08 07:53:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 07:53:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 07:53:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-08 07:53:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 07:53:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 07:53:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 07:53:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 07:53:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 07:53:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 07:53:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 07:53:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 07:53:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 07:53:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 07:53:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 07:53:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 07:53:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 07:53:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 07:53:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 07:53:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 07:53:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 07:53:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 07:53:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 07:53:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 07:53:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 07:53:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 07:53:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 07:53:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 07:53:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 07:53:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 07:53:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 07:53:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 07:53:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 07:53:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 07:53:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 07:53:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 07:53:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 07:53:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 07:53:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 07:53:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 07:53:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 07:53:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 07:53:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 07:53:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-08 07:53:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 07:53:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 07:53:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 07:53:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-08 07:53:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-08 07:53:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 07:53:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 07:53:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-12-08 07:53:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 07:53:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 07:53:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 07:53:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 07:53:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 07:53:08,359 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 07:53:08,359 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 07:53:08,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:53:08 BoogieIcfgContainer [2018-12-08 07:53:08,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 07:53:08,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 07:53:08,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 07:53:08,362 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 07:53:08,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 07:53:07" (1/3) ... [2018-12-08 07:53:08,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8f3229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:53:08, skipping insertion in model container [2018-12-08 07:53:08,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:08" (2/3) ... [2018-12-08 07:53:08,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8f3229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:53:08, skipping insertion in model container [2018-12-08 07:53:08,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:53:08" (3/3) ... [2018-12-08 07:53:08,364 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-08 07:53:08,370 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 07:53:08,375 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-12-08 07:53:08,384 INFO L257 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2018-12-08 07:53:08,398 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 07:53:08,399 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 07:53:08,399 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 07:53:08,399 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 07:53:08,399 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 07:53:08,399 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 07:53:08,399 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 07:53:08,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 07:53:08,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 07:53:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2018-12-08 07:53:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 07:53:08,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:08,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:53:08,416 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 07:53:08,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:08,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1063869761, now seen corresponding path program 1 times [2018-12-08 07:53:08,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:53:08,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:53:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:08,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:08,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:53:08,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 07:53:08,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 07:53:08,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 07:53:08,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 07:53:08,535 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2018-12-08 07:53:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:08,633 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2018-12-08 07:53:08,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 07:53:08,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 07:53:08,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:08,643 INFO L225 Difference]: With dead ends: 108 [2018-12-08 07:53:08,643 INFO L226 Difference]: Without dead ends: 101 [2018-12-08 07:53:08,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 07:53:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-08 07:53:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-08 07:53:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-08 07:53:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-08 07:53:08,681 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 13 [2018-12-08 07:53:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:08,682 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-08 07:53:08,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 07:53:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-08 07:53:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 07:53:08,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:08,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:53:08,683 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 07:53:08,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1063869760, now seen corresponding path program 1 times [2018-12-08 07:53:08,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:53:08,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:53:08,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:08,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:08,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:08,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:53:08,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 07:53:08,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 07:53:08,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 07:53:08,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 07:53:08,731 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 3 states. [2018-12-08 07:53:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:08,782 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-12-08 07:53:08,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 07:53:08,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 07:53:08,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:08,784 INFO L225 Difference]: With dead ends: 99 [2018-12-08 07:53:08,784 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 07:53:08,785 INFO L631 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-12-08 07:53:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 07:53:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-08 07:53:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-08 07:53:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-12-08 07:53:08,791 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 13 [2018-12-08 07:53:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:08,791 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-12-08 07:53:08,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 07:53:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-12-08 07:53:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 07:53:08,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:08,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:53:08,792 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 07:53:08,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:08,793 INFO L82 PathProgramCache]: Analyzing trace with hash -638174441, now seen corresponding path program 1 times [2018-12-08 07:53:08,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:53:08,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:53:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:08,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:08,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:53:08,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 07:53:08,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 07:53:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 07:53:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 07:53:08,848 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 6 states. [2018-12-08 07:53:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:08,955 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-12-08 07:53:08,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 07:53:08,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 07:53:08,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:08,957 INFO L225 Difference]: With dead ends: 103 [2018-12-08 07:53:08,958 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 07:53:08,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 07:53:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 07:53:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-08 07:53:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 07:53:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-08 07:53:08,965 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 19 [2018-12-08 07:53:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:08,965 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-08 07:53:08,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 07:53:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-08 07:53:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 07:53:08,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:08,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:53:08,967 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 07:53:08,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:08,967 INFO L82 PathProgramCache]: Analyzing trace with hash -638174440, now seen corresponding path program 1 times [2018-12-08 07:53:08,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:53:08,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:53:08,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:08,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:08,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:09,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:53:09,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 07:53:09,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 07:53:09,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 07:53:09,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 07:53:09,025 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 6 states. [2018-12-08 07:53:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:09,133 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-12-08 07:53:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 07:53:09,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 07:53:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:09,134 INFO L225 Difference]: With dead ends: 102 [2018-12-08 07:53:09,134 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 07:53:09,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 07:53:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 07:53:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2018-12-08 07:53:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-08 07:53:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2018-12-08 07:53:09,138 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 19 [2018-12-08 07:53:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:09,138 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2018-12-08 07:53:09,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 07:53:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2018-12-08 07:53:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 07:53:09,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:09,139 INFO L402 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] [2018-12-08 07:53:09,139 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 07:53:09,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:09,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1309582990, now seen corresponding path program 1 times [2018-12-08 07:53:09,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:53:09,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:53:09,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:09,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:09,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:09,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:53:09,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 07:53:09,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 07:53:09,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 07:53:09,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 07:53:09,179 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 5 states. [2018-12-08 07:53:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:09,195 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-12-08 07:53:09,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 07:53:09,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-08 07:53:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:09,196 INFO L225 Difference]: With dead ends: 106 [2018-12-08 07:53:09,196 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 07:53:09,196 INFO L631 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-12-08 07:53:09,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 07:53:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-08 07:53:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 07:53:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-08 07:53:09,200 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 25 [2018-12-08 07:53:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:09,201 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-08 07:53:09,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 07:53:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-08 07:53:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 07:53:09,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:09,202 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 07:53:09,202 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 07:53:09,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash -252497731, now seen corresponding path program 1 times [2018-12-08 07:53:09,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:53:09,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:53:09,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:09,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:09,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 07:53:09,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 07:53:09,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/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-12-08 07:53:09,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:09,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:53:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:09,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 07:53:09,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-08 07:53:09,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 07:53:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 07:53:09,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 07:53:09,336 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 6 states. [2018-12-08 07:53:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:09,364 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-12-08 07:53:09,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 07:53:09,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-12-08 07:53:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:09,365 INFO L225 Difference]: With dead ends: 112 [2018-12-08 07:53:09,365 INFO L226 Difference]: Without dead ends: 109 [2018-12-08 07:53:09,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 07:53:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-08 07:53:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-12-08 07:53:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-08 07:53:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-12-08 07:53:09,371 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 38 [2018-12-08 07:53:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:09,371 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-12-08 07:53:09,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 07:53:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-12-08 07:53:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 07:53:09,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:09,372 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:53:09,373 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 07:53:09,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash 653716206, now seen corresponding path program 2 times [2018-12-08 07:53:09,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:53:09,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:53:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:09,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:53:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 07:53:09,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 07:53:09,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/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-12-08 07:53:09,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 07:53:09,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 07:53:09,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 07:53:09,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:53:09,681 INFO L478 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-12-08 07:53:09,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:53:09,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:53:09,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 07:53:09,950 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 07:53:09,952 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 8284 column 44: unknown constant node_create_~temp~0.base 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$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:164) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:174) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:320) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:112) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:82) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) 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:456) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-08 07:53:09,960 INFO L168 Benchmark]: Toolchain (without parser) took 2221.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 951.7 MB in the beginning and 809.0 MB in the end (delta: 142.7 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. [2018-12-08 07:53:09,964 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 07:53:09,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-08 07:53:09,968 INFO L168 Benchmark]: Boogie Preprocessor took 30.96 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-08 07:53:09,969 INFO L168 Benchmark]: RCFGBuilder took 322.73 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: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. [2018-12-08 07:53:09,971 INFO L168 Benchmark]: TraceAbstraction took 1597.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 809.0 MB in the end (delta: 246.3 MB). Peak memory consumption was 246.3 MB. Max. memory is 11.5 GB. [2018-12-08 07:53:09,978 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.96 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 322.73 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: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1597.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 809.0 MB in the end (delta: 246.3 MB). Peak memory consumption was 246.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 8284 column 44: unknown constant node_create_~temp~0.base de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 8284 column 44: unknown constant node_create_~temp~0.base: 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-635dfa2 [2018-12-08 07:53:11,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 07:53:11,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 07:53:11,459 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 07:53:11,459 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 07:53:11,460 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 07:53:11,460 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 07:53:11,461 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 07:53:11,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 07:53:11,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 07:53:11,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 07:53:11,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 07:53:11,463 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 07:53:11,464 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 07:53:11,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 07:53:11,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 07:53:11,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 07:53:11,466 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 07:53:11,467 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 07:53:11,468 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 07:53:11,468 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 07:53:11,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 07:53:11,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 07:53:11,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 07:53:11,470 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 07:53:11,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 07:53:11,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 07:53:11,472 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 07:53:11,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 07:53:11,473 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 07:53:11,473 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 07:53:11,473 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 07:53:11,473 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 07:53:11,473 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 07:53:11,474 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 07:53:11,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 07:53:11,474 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-08 07:53:11,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 07:53:11,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 07:53:11,484 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 07:53:11,484 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 07:53:11,485 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 07:53:11,485 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 07:53:11,485 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 07:53:11,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 07:53:11,485 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 07:53:11,486 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 07:53:11,486 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 07:53:11,486 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 07:53:11,486 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 07:53:11,486 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 07:53:11,486 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 07:53:11,486 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 07:53:11,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 07:53:11,487 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 07:53:11,487 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 07:53:11,487 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 07:53:11,487 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 07:53:11,487 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 07:53:11,488 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 07:53:11,488 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 07:53:11,488 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 07:53:11,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 07:53:11,488 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 07:53:11,488 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 07:53:11,488 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-08 07:53:11,489 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 07:53:11,489 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 07:53:11,489 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> cae663252cf3102da91695865874d633c1ee8349 [2018-12-08 07:53:11,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 07:53:11,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 07:53:11,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 07:53:11,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 07:53:11,523 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 07:53:11,524 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-08 07:53:11,560 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/data/f13ce697f/0d28926932b0419b90bb0e0ac02408ca/FLAG15461a5ec [2018-12-08 07:53:12,060 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 07:53:12,061 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-08 07:53:12,067 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/data/f13ce697f/0d28926932b0419b90bb0e0ac02408ca/FLAG15461a5ec [2018-12-08 07:53:12,075 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/data/f13ce697f/0d28926932b0419b90bb0e0ac02408ca [2018-12-08 07:53:12,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 07:53:12,077 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 07:53:12,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 07:53:12,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 07:53:12,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 07:53:12,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:53:12" (1/1) ... [2018-12-08 07:53:12,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3782f26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:12, skipping insertion in model container [2018-12-08 07:53:12,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:53:12" (1/1) ... [2018-12-08 07:53:12,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 07:53:12,111 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 07:53:12,303 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 07:53:12,313 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 07:53:12,378 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 07:53:12,402 INFO L195 MainTranslator]: Completed translation [2018-12-08 07:53:12,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:12 WrapperNode [2018-12-08 07:53:12,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 07:53:12,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 07:53:12,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 07:53:12,403 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 07:53:12,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:12" (1/1) ... [2018-12-08 07:53:12,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:12" (1/1) ... [2018-12-08 07:53:12,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:12" (1/1) ... [2018-12-08 07:53:12,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:12" (1/1) ... [2018-12-08 07:53:12,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:12" (1/1) ... [2018-12-08 07:53:12,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:12" (1/1) ... [2018-12-08 07:53:12,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:12" (1/1) ... [2018-12-08 07:53:12,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 07:53:12,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 07:53:12,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 07:53:12,438 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 07:53:12,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/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-12-08 07:53:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 07:53:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 07:53:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 07:53:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 07:53:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 07:53:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-08 07:53:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-08 07:53:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-08 07:53:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-12-08 07:53:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 07:53:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 07:53:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 07:53:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 07:53:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-08 07:53:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 07:53:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 07:53:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 07:53:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 07:53:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-12-08 07:53:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 07:53:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 07:53:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-08 07:53:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 07:53:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 07:53:12,865 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 07:53:12,865 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 07:53:12,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:53:12 BoogieIcfgContainer [2018-12-08 07:53:12,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 07:53:12,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 07:53:12,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 07:53:12,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 07:53:12,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 07:53:12" (1/3) ... [2018-12-08 07:53:12,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c20f4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:53:12, skipping insertion in model container [2018-12-08 07:53:12,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:53:12" (2/3) ... [2018-12-08 07:53:12,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c20f4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:53:12, skipping insertion in model container [2018-12-08 07:53:12,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:53:12" (3/3) ... [2018-12-08 07:53:12,870 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-08 07:53:12,876 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 07:53:12,881 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-12-08 07:53:12,890 INFO L257 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2018-12-08 07:53:12,904 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 07:53:12,904 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 07:53:12,904 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 07:53:12,904 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 07:53:12,905 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 07:53:12,905 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 07:53:12,905 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 07:53:12,905 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 07:53:12,905 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 07:53:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2018-12-08 07:53:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 07:53:12,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:12,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:53:12,921 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 07:53:12,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1063869761, now seen corresponding path program 1 times [2018-12-08 07:53:12,928 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 07:53:12,928 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 07:53:12,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:12,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:53:13,015 INFO L478 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-12-08 07:53:13,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:53:13,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:53:13,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 07:53:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:13,026 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 07:53:13,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:53:13,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 07:53:13,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 07:53:13,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 07:53:13,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 07:53:13,040 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2018-12-08 07:53:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:13,175 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2018-12-08 07:53:13,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 07:53:13,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 07:53:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:13,182 INFO L225 Difference]: With dead ends: 108 [2018-12-08 07:53:13,182 INFO L226 Difference]: Without dead ends: 101 [2018-12-08 07:53:13,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 07:53:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-08 07:53:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-08 07:53:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-08 07:53:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-08 07:53:13,211 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 13 [2018-12-08 07:53:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:13,211 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-08 07:53:13,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 07:53:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-08 07:53:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 07:53:13,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:13,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:53:13,212 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 07:53:13,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1063869760, now seen corresponding path program 1 times [2018-12-08 07:53:13,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 07:53:13,212 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 07:53:13,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:13,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:53:13,281 INFO L478 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-12-08 07:53:13,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:53:13,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:53:13,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 07:53:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:13,294 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 07:53:13,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:53:13,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 07:53:13,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 07:53:13,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 07:53:13,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 07:53:13,297 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 3 states. [2018-12-08 07:53:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:13,444 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-12-08 07:53:13,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 07:53:13,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 07:53:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:13,446 INFO L225 Difference]: With dead ends: 99 [2018-12-08 07:53:13,446 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 07:53:13,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 07:53:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 07:53:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-08 07:53:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-08 07:53:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-12-08 07:53:13,452 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 13 [2018-12-08 07:53:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:13,452 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-12-08 07:53:13,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 07:53:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-12-08 07:53:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 07:53:13,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:13,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:53:13,453 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 07:53:13,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:13,453 INFO L82 PathProgramCache]: Analyzing trace with hash -638174441, now seen corresponding path program 1 times [2018-12-08 07:53:13,453 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 07:53:13,453 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 07:53:13,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:13,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:53:13,508 INFO L478 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-12-08 07:53:13,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:53:13,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:53:13,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 07:53:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:13,528 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 07:53:13,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:53:13,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 07:53:13,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 07:53:13,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 07:53:13,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 07:53:13,530 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 6 states. [2018-12-08 07:53:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:13,816 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-12-08 07:53:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 07:53:13,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 07:53:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:13,819 INFO L225 Difference]: With dead ends: 103 [2018-12-08 07:53:13,819 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 07:53:13,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 07:53:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 07:53:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-08 07:53:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 07:53:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-08 07:53:13,828 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 19 [2018-12-08 07:53:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:13,828 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-08 07:53:13,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 07:53:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-08 07:53:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 07:53:13,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:13,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:53:13,829 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 07:53:13,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:13,830 INFO L82 PathProgramCache]: Analyzing trace with hash -638174440, now seen corresponding path program 1 times [2018-12-08 07:53:13,830 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 07:53:13,830 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 07:53:13,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:13,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:53:13,894 INFO L478 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-12-08 07:53:13,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:53:13,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:53:13,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 07:53:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:13,933 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 07:53:13,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:53:13,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 07:53:13,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 07:53:13,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 07:53:13,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 07:53:13,935 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 6 states. [2018-12-08 07:53:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:14,260 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-12-08 07:53:14,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 07:53:14,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 07:53:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:14,262 INFO L225 Difference]: With dead ends: 102 [2018-12-08 07:53:14,262 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 07:53:14,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 07:53:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 07:53:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2018-12-08 07:53:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-08 07:53:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2018-12-08 07:53:14,266 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 19 [2018-12-08 07:53:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:14,266 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2018-12-08 07:53:14,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 07:53:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2018-12-08 07:53:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 07:53:14,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:14,267 INFO L402 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] [2018-12-08 07:53:14,267 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 07:53:14,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1309582990, now seen corresponding path program 1 times [2018-12-08 07:53:14,268 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 07:53:14,268 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 07:53:14,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:14,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:53:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:14,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 07:53:14,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:53:14,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 07:53:14,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 07:53:14,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 07:53:14,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 07:53:14,344 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 5 states. [2018-12-08 07:53:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:14,367 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-12-08 07:53:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 07:53:14,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-08 07:53:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:14,368 INFO L225 Difference]: With dead ends: 106 [2018-12-08 07:53:14,368 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 07:53:14,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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-12-08 07:53:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 07:53:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-08 07:53:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 07:53:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-08 07:53:14,374 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 25 [2018-12-08 07:53:14,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:14,374 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-08 07:53:14,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 07:53:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-08 07:53:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 07:53:14,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:14,376 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 07:53:14,376 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 07:53:14,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:14,376 INFO L82 PathProgramCache]: Analyzing trace with hash -252497731, now seen corresponding path program 1 times [2018-12-08 07:53:14,376 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 07:53:14,377 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 07:53:14,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:53:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:53:14,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:53:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:53:14,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 07:53:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 07:53:14,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 07:53:14,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-12-08 07:53:14,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 07:53:14,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 07:53:14,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-08 07:53:14,596 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 9 states. [2018-12-08 07:53:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:53:14,702 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-12-08 07:53:14,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 07:53:14,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-12-08 07:53:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:53:14,704 INFO L225 Difference]: With dead ends: 112 [2018-12-08 07:53:14,704 INFO L226 Difference]: Without dead ends: 109 [2018-12-08 07:53:14,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-08 07:53:14,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-08 07:53:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-12-08 07:53:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-08 07:53:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-12-08 07:53:14,708 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 38 [2018-12-08 07:53:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:53:14,708 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-12-08 07:53:14,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 07:53:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-12-08 07:53:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 07:53:14,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:53:14,709 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:53:14,709 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 07:53:14,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:53:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash 653716206, now seen corresponding path program 2 times [2018-12-08 07:53:14,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 07:53:14,710 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 07:53:14,723 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 07:53:14,841 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-08 07:53:14,841 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 07:53:14,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 07:53:14,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 07:53:14,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 07:53:14,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 07:53:14,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:53:14,952 INFO L478 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-12-08 07:53:14,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:53:14,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:53:14,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 07:53:16,968 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-12-08 07:53:19,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:53:19,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:53:19,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:53:19,023 INFO L478 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-12-08 07:53:19,028 INFO L478 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-12-08 07:53:19,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:53:19,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:53:19,054 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-12-08 07:53:19,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2018-12-08 07:53:19,498 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-08 07:53:19,510 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 07:53:19,511 INFO L478 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 23 treesize of output 33 [2018-12-08 07:53:19,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:53:19,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 07:53:19,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-12-08 07:53:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 19 not checked. [2018-12-08 07:53:19,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 07:53:23,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-08 07:53:23,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-12-08 07:53:23,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 07:53:23,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 07:53:23,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=8, NotChecked=42, Total=182 [2018-12-08 07:53:23,766 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 10 states. [2018-12-08 07:53:35,814 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (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-12-08 07:53:40,327 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-08 07:53:41,407 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-12-08 07:54:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:54:18,810 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2018-12-08 07:54:18,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 07:54:18,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-12-08 07:54:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:54:18,811 INFO L225 Difference]: With dead ends: 151 [2018-12-08 07:54:18,811 INFO L226 Difference]: Without dead ends: 151 [2018-12-08 07:54:18,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=49, Invalid=136, Unknown=9, NotChecked=78, Total=272 [2018-12-08 07:54:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-08 07:54:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 129. [2018-12-08 07:54:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-08 07:54:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-12-08 07:54:18,815 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 51 [2018-12-08 07:54:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:54:18,815 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-12-08 07:54:18,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 07:54:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-12-08 07:54:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 07:54:18,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:54:18,816 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:54:18,816 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 07:54:18,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:54:18,816 INFO L82 PathProgramCache]: Analyzing trace with hash 653716207, now seen corresponding path program 1 times [2018-12-08 07:54:18,816 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 07:54:18,816 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 07:54:18,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:54:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:54:18,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:54:18,995 INFO L478 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-12-08 07:54:18,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:54:19,008 INFO L478 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-12-08 07:54:19,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:54:19,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:54:19,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 07:54:19,706 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (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-12-08 07:54:23,207 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-08 07:54:24,822 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)) sll_create_~new_head~0.base (_ bv8 32))) (= (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base) (_ bv0 1)))) is different from true [2018-12-08 07:54:24,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:24,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:24,865 INFO L478 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 17 treesize of output 29 [2018-12-08 07:54:24,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:24,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 36 [2018-12-08 07:54:24,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:54:24,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:54:24,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:24,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:24,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:24,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-08 07:54:24,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 07:54:24,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 07:54:24,924 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:25 [2018-12-08 07:54:28,839 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)))) is different from true [2018-12-08 07:54:28,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:28,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:28,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:28,865 INFO L478 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 2 case distinctions, treesize of input 22 treesize of output 37 [2018-12-08 07:54:28,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-08 07:54:28,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-08 07:54:28,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:60 [2018-12-08 07:54:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 26 not checked. [2018-12-08 07:54:28,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 07:54:29,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 07:54:29,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/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-12-08 07:54:29,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:54:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:54:29,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:54:29,240 INFO L478 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-12-08 07:54:29,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:54:29,247 INFO L478 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-12-08 07:54:29,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:54:29,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:54:29,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 07:54:29,899 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-12-08 07:54:30,874 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)) v_prenex_6 (_ bv8 32))))) is different from true [2018-12-08 07:54:30,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:30,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:30,887 INFO L478 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 13 treesize of output 4 [2018-12-08 07:54:30,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:54:30,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:30,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 27 [2018-12-08 07:54:30,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2018-12-08 07:54:30,922 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 07:54:30,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 07:54:30,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 07:54:30,965 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:42 [2018-12-08 07:54:32,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:32,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:54:32,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-12-08 07:54:32,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-08 07:54:32,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-08 07:54:32,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:54:32,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 07:54:32,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:61 [2018-12-08 07:54:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 20 not checked. [2018-12-08 07:54:34,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 07:54:36,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 07:54:36,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2018-12-08 07:54:36,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-08 07:54:36,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 07:54:36,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=229, Unknown=9, NotChecked=170, Total=462 [2018-12-08 07:54:36,888 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 20 states. [2018-12-08 07:54:48,039 WARN L180 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-12-08 07:54:56,340 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-12-08 07:55:00,383 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1))))) is different from true [2018-12-08 07:55:03,912 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_6 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)) v_prenex_6 (_ bv8 32))))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)) sll_create_~new_head~0.base (_ bv8 32))) (= (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base) (_ bv0 1))))) is different from true [2018-12-08 07:55:15,371 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2018-12-08 07:56:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:56:21,049 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2018-12-08 07:56:21,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 07:56:21,050 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-12-08 07:56:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 07:56:21,051 INFO L225 Difference]: With dead ends: 173 [2018-12-08 07:56:21,051 INFO L226 Difference]: Without dead ends: 173 [2018-12-08 07:56:21,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=92, Invalid=383, Unknown=15, NotChecked=322, Total=812 [2018-12-08 07:56:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-08 07:56:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 143. [2018-12-08 07:56:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-08 07:56:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2018-12-08 07:56:21,055 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 51 [2018-12-08 07:56:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 07:56:21,055 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2018-12-08 07:56:21,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-08 07:56:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2018-12-08 07:56:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 07:56:21,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 07:56:21,056 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:56:21,056 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 07:56:21,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:56:21,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1430078092, now seen corresponding path program 1 times [2018-12-08 07:56:21,056 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 07:56:21,056 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 07:56:21,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:56:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:56:21,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:56:21,233 INFO L478 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-12-08 07:56:21,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:56:21,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:56:21,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 07:56:21,903 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-12-08 07:56:23,916 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-08 07:56:27,173 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 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_sll_create_#t~ret4.base| (_ bv1 1))))) is different from true [2018-12-08 07:56:27,957 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 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_sll_create_~new_head~0.base (_ bv1 1))))) is different from true [2018-12-08 07:56:29,296 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)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_sll_create_~head~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-08 07:56:31,300 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 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_sll_create_#res.base| (_ bv1 1))))) is different from true [2018-12-08 07:56:31,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:56:31,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:56:31,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-08 07:56:31,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 20 [2018-12-08 07:56:31,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:56:31,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:56:31,325 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-12-08 07:56:31,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2018-12-08 07:56:33,984 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |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) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-08 07:56:33,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:56:34,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:56:34,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:56:34,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:56:34,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 55 [2018-12-08 07:56:34,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:56:34,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-12-08 07:56:34,077 INFO L478 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 17 treesize of output 20 [2018-12-08 07:56:34,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:56:34,086 INFO L478 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 20 treesize of output 16 [2018-12-08 07:56:34,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 07:56:34,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:56:34,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:56:34,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 07:56:34,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:62, output treesize:60 [2018-12-08 07:56:34,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-08 07:56:34,216 INFO L478 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 21 treesize of output 12 [2018-12-08 07:56:34,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:56:34,230 INFO L478 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 7 treesize of output 1 [2018-12-08 07:56:34,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 07:56:34,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:56:34,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 07:56:34,251 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:66, output treesize:42 [2018-12-08 07:56:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 2 refuted. 3 times theorem prover too weak. 1 trivial. 18 not checked. [2018-12-08 07:56:34,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 07:56:34,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 07:56:34,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 07:56:34,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 07:56:34,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-12-08 07:56:40,757 WARN L180 SmtUtils]: Spent 789.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-08 07:56:40,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 07:56:40,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 07:56:40,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:56:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:56:40,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:56:40,814 INFO L478 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-12-08 07:56:40,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:56:40,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:56:40,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 07:56:48,169 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-08 07:56:55,571 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-08 07:57:06,216 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-08 07:57:13,622 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-08 07:57:13,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:57:13,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:57:13,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:57:13,642 INFO L478 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-12-08 07:57:13,645 INFO L478 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-12-08 07:57:13,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:57:13,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:57:13,665 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-12-08 07:57:13,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2018-12-08 07:57:14,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:57:14,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:57:14,042 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 07:57:14,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 07:57:14,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 07:57:14,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-12-08 07:57:14,114 INFO L478 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 17 treesize of output 20 [2018-12-08 07:57:14,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 07:57:14,122 INFO L478 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 20 treesize of output 16 [2018-12-08 07:57:14,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 07:57:14,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:57:14,148 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:57:14,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 07:57:14,184 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:75 [2018-12-08 07:57:14,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-08 07:57:14,335 INFO L478 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 7 treesize of output 1 [2018-12-08 07:57:14,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 07:57:14,352 INFO L478 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 33 treesize of output 20 [2018-12-08 07:57:14,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 07:57:14,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 07:57:14,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 07:57:14,383 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:84, output treesize:52 [2018-12-08 07:57:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 3 refuted. 5 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-08 07:57:14,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 07:57:14,659 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 07:57:14,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 07:57:14,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 07:57:14,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-12-08 07:57:21,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 07:57:21,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 36 [2018-12-08 07:57:21,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-08 07:57:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-08 07:57:21,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1073, Unknown=28, NotChecked=426, Total=1640 [2018-12-08 07:57:21,135 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand 37 states. [2018-12-08 07:58:05,791 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2018-12-08 07:58:18,061 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-08 07:59:01,927 WARN L180 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-12-08 07:59:25,219 WARN L180 SmtUtils]: Spent 10.17 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-08 07:59:40,372 WARN L180 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-12-08 07:59:42,081 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2018-12-08 07:59:56,705 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2018-12-08 08:00:23,939 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-12-08 08:00:34,505 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2018-12-08 08:02:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:02:53,742 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2018-12-08 08:02:53,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 08:02:53,743 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-12-08 08:02:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:02:53,744 INFO L225 Difference]: With dead ends: 176 [2018-12-08 08:02:53,744 INFO L226 Difference]: Without dead ends: 176 [2018-12-08 08:02:53,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 119.5s TimeCoverageRelationStatistics Valid=219, Invalid=2020, Unknown=41, NotChecked=582, Total=2862 [2018-12-08 08:02:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-08 08:02:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 144. [2018-12-08 08:02:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-08 08:02:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 173 transitions. [2018-12-08 08:02:53,749 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 173 transitions. Word has length 55 [2018-12-08 08:02:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:02:53,749 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 173 transitions. [2018-12-08 08:02:53,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-08 08:02:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 173 transitions. [2018-12-08 08:02:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 08:02:53,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:02:53,751 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:02:53,751 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 08:02:53,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:02:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1430078091, now seen corresponding path program 1 times [2018-12-08 08:02:53,751 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 08:02:53,752 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 08:02:53,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:02:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:02:53,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:02:53,989 INFO L478 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-12-08 08:02:53,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:02:53,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:02:53,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 08:02:56,007 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-12-08 08:02:56,014 INFO L478 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-12-08 08:02:56,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:02:56,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:02:56,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-08 08:02:56,870 WARN L180 SmtUtils]: Spent 816.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-08 08:02:57,683 WARN L180 SmtUtils]: Spent 796.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-08 08:02:58,332 WARN L180 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-08 08:02:59,425 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 22 [2018-12-08 08:02:59,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:02:59,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:02:59,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-08 08:02:59,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 20 [2018-12-08 08:02:59,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:02:59,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:02:59,457 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-12-08 08:02:59,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:33 [2018-12-08 08:03:01,875 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32)))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv8 32))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= |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) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base))))) is different from true [2018-12-08 08:03:01,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:01,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:01,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:01,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:01,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-12-08 08:03:01,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,009 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 08:03:02,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-12-08 08:03:02,119 INFO L478 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 17 treesize of output 20 [2018-12-08 08:03:02,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:02,131 INFO L478 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 20 treesize of output 16 [2018-12-08 08:03:02,131 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,142 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-08 08:03:02,225 INFO L478 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 17 treesize of output 20 [2018-12-08 08:03:02,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:02,234 INFO L478 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 20 treesize of output 16 [2018-12-08 08:03:02,234 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,242 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,253 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:02,285 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:98, output treesize:55 [2018-12-08 08:03:02,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-08 08:03:02,380 INFO L478 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 7 treesize of output 1 [2018-12-08 08:03:02,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,393 INFO L478 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-12-08 08:03:02,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-08 08:03:02,427 INFO L478 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 21 treesize of output 12 [2018-12-08 08:03:02,427 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,441 INFO L478 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 7 treesize of output 1 [2018-12-08 08:03:02,441 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,448 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:02,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:02,458 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:70, output treesize:22 [2018-12-08 08:03:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2018-12-08 08:03:02,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:03:03,124 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-08 08:03:03,267 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-08 08:03:03,337 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:03,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:04,408 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:04,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:05,012 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:05,044 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:05,341 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:05,360 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:05,606 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:05,635 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:05,796 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:05,811 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:05,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-12-08 08:03:05,933 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:190, output treesize:129 [2018-12-08 08:03:14,429 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-12-08 08:03:14,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:03:14,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:03:14,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:03:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:03:14,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:03:14,486 INFO L478 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-12-08 08:03:14,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:14,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:14,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 08:03:14,957 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-08 08:03:14,962 INFO L478 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-12-08 08:03:14,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:14,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:14,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-08 08:03:17,641 WARN L180 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-08 08:03:19,271 WARN L180 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-08 08:03:21,018 WARN L180 SmtUtils]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-08 08:03:22,579 WARN L180 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-08 08:03:22,584 INFO L478 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 0 case distinctions, treesize of input 17 treesize of output 17 [2018-12-08 08:03:22,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-08 08:03:22,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:22,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:22,604 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-12-08 08:03:22,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2018-12-08 08:03:23,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:23,069 INFO L478 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 25 [2018-12-08 08:03:23,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:23,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:23,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:23,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-12-08 08:03:23,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-12-08 08:03:23,261 INFO L478 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 17 treesize of output 20 [2018-12-08 08:03:23,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:23,271 INFO L478 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 20 treesize of output 16 [2018-12-08 08:03:23,271 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,281 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-08 08:03:23,345 INFO L478 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 17 treesize of output 20 [2018-12-08 08:03:23,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:03:23,353 INFO L478 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 20 treesize of output 16 [2018-12-08 08:03:23,353 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,360 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,369 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:23,396 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:88, output treesize:54 [2018-12-08 08:03:23,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-08 08:03:23,543 INFO L478 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-12-08 08:03:23,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,560 INFO L478 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 7 treesize of output 1 [2018-12-08 08:03:23,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-08 08:03:23,597 INFO L478 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 21 treesize of output 12 [2018-12-08 08:03:23,597 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,611 INFO L478 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 7 treesize of output 1 [2018-12-08 08:03:23,611 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:23,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:23,627 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:70, output treesize:22 [2018-12-08 08:03:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2018-12-08 08:03:23,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:03:23,778 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-08 08:03:23,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:24,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:25,604 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:25,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:26,360 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:26,379 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:26,755 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:26,770 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:27,005 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:27,031 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:03:27,207 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 08:03:27,219 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:03:27,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-12-08 08:03:27,326 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:190, output treesize:129 [2018-12-08 08:03:31,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:03:31,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2018-12-08 08:03:31,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-08 08:03:31,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-08 08:03:31,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1029, Unknown=9, NotChecked=198, Total=1332 [2018-12-08 08:03:31,321 INFO L87 Difference]: Start difference. First operand 144 states and 173 transitions. Second operand 33 states. [2018-12-08 08:03:44,901 WARN L180 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-08 08:03:53,426 WARN L180 SmtUtils]: Spent 8.18 s on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-08 08:04:00,150 WARN L180 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-08 08:04:07,731 WARN L180 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-08 08:04:17,064 WARN L180 SmtUtils]: Spent 8.92 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-08 08:04:29,359 WARN L180 SmtUtils]: Spent 2.81 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-08 08:04:39,473 WARN L180 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 42 [2018-12-08 08:04:40,159 WARN L180 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-12-08 08:04:41,534 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-12-08 08:04:42,176 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-12-08 08:04:50,732 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-12-08 08:04:51,190 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-12-08 08:04:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:04:58,985 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2018-12-08 08:04:58,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 08:04:58,986 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2018-12-08 08:04:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:04:58,987 INFO L225 Difference]: With dead ends: 193 [2018-12-08 08:04:58,987 INFO L226 Difference]: Without dead ends: 193 [2018-12-08 08:04:58,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 92.4s TimeCoverageRelationStatistics Valid=208, Invalid=2137, Unknown=19, NotChecked=288, Total=2652 [2018-12-08 08:04:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-08 08:04:58,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 147. [2018-12-08 08:04:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-08 08:04:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 176 transitions. [2018-12-08 08:04:58,991 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 176 transitions. Word has length 55 [2018-12-08 08:04:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:04:58,991 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 176 transitions. [2018-12-08 08:04:58,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-08 08:04:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 176 transitions. [2018-12-08 08:04:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 08:04:58,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:04:58,992 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:04:58,993 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 08:04:58,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1938366000, now seen corresponding path program 1 times [2018-12-08 08:04:58,993 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 08:04:58,993 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 08:04:59,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:04:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:04:59,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:04:59,145 INFO L478 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-12-08 08:04:59,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:04:59,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:04:59,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 08:04:59,195 INFO L478 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-12-08 08:04:59,196 INFO L478 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-12-08 08:04:59,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:04:59,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:04:59,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:04:59,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-08 08:04:59,230 INFO L478 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-12-08 08:04:59,231 INFO L478 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-12-08 08:04:59,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:04:59,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:04:59,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:04:59,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-08 08:04:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 08:04:59,256 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 08:04:59,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:04:59,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:04:59,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 08:04:59,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:04:59,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:04:59,260 INFO L87 Difference]: Start difference. First operand 147 states and 176 transitions. Second operand 12 states. [2018-12-08 08:05:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:05:00,169 INFO L93 Difference]: Finished difference Result 192 states and 231 transitions. [2018-12-08 08:05:00,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 08:05:00,170 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-12-08 08:05:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:05:00,171 INFO L225 Difference]: With dead ends: 192 [2018-12-08 08:05:00,171 INFO L226 Difference]: Without dead ends: 192 [2018-12-08 08:05:00,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-08 08:05:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-08 08:05:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2018-12-08 08:05:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-08 08:05:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 188 transitions. [2018-12-08 08:05:00,177 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 188 transitions. Word has length 58 [2018-12-08 08:05:00,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:05:00,178 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 188 transitions. [2018-12-08 08:05:00,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 08:05:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 188 transitions. [2018-12-08 08:05:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 08:05:00,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:05:00,179 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:05:00,179 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 08:05:00,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:05:00,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1938365999, now seen corresponding path program 1 times [2018-12-08 08:05:00,180 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 08:05:00,180 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 08:05:00,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:05:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:05:00,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:05:00,348 INFO L478 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-12-08 08:05:00,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 08:05:00,412 INFO L478 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-12-08 08:05:00,414 INFO L478 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-12-08 08:05:00,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,428 INFO L478 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-12-08 08:05:00,430 INFO L478 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-12-08 08:05:00,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-12-08 08:05:00,481 INFO L478 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-12-08 08:05:00,483 INFO L478 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-12-08 08:05:00,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,492 INFO L478 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-12-08 08:05:00,494 INFO L478 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 5 [2018-12-08 08:05:00,494 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:00,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-08 08:05:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 08:05:00,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 08:05:00,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:05:00,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:05:00,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 08:05:00,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:05:00,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:05:00,537 INFO L87 Difference]: Start difference. First operand 156 states and 188 transitions. Second operand 12 states. [2018-12-08 08:05:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:05:01,433 INFO L93 Difference]: Finished difference Result 213 states and 253 transitions. [2018-12-08 08:05:01,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 08:05:01,434 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-12-08 08:05:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:05:01,435 INFO L225 Difference]: With dead ends: 213 [2018-12-08 08:05:01,435 INFO L226 Difference]: Without dead ends: 213 [2018-12-08 08:05:01,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-08 08:05:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-08 08:05:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 170. [2018-12-08 08:05:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-08 08:05:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 204 transitions. [2018-12-08 08:05:01,439 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 204 transitions. Word has length 58 [2018-12-08 08:05:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:05:01,439 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 204 transitions. [2018-12-08 08:05:01,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 08:05:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 204 transitions. [2018-12-08 08:05:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 08:05:01,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:05:01,440 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:05:01,440 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 08:05:01,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:05:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash -407019286, now seen corresponding path program 1 times [2018-12-08 08:05:01,440 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 08:05:01,440 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 08:05:01,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:05:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:05:01,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:05:01,670 INFO L478 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-12-08 08:05:01,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:01,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:01,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 08:05:01,848 INFO L478 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 13 treesize of output 10 [2018-12-08 08:05:01,850 INFO L478 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 10 treesize of output 9 [2018-12-08 08:05:01,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:01,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:01,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:01,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-08 08:05:02,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:02,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:02,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:02,081 INFO L478 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 33 treesize of output 52 [2018-12-08 08:05:02,084 INFO L478 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 32 treesize of output 46 [2018-12-08 08:05:02,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:02,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:02,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:02,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:47 [2018-12-08 08:05:04,705 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= |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) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-08 08:05:04,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:04,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:04,728 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 08:05:04,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 107 [2018-12-08 08:05:04,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:04,869 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-08 08:05:04,875 INFO L478 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 17 treesize of output 20 [2018-12-08 08:05:04,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:04,886 INFO L478 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 20 treesize of output 16 [2018-12-08 08:05:04,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:04,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:04,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:05,011 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93 [2018-12-08 08:05:05,018 INFO L478 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 17 treesize of output 20 [2018-12-08 08:05:05,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:05,027 INFO L478 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 20 treesize of output 16 [2018-12-08 08:05:05,027 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:05,039 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:05,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:05,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:05,108 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:128, output treesize:124 [2018-12-08 08:05:05,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 22 [2018-12-08 08:05:05,252 INFO L478 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-12-08 08:05:05,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:05,267 INFO L478 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 7 treesize of output 1 [2018-12-08 08:05:05,267 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:05,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:05,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:05,318 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:137, output treesize:117 [2018-12-08 08:05:05,531 INFO L478 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 101 treesize of output 70 [2018-12-08 08:05:05,535 INFO L478 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 7 treesize of output 1 [2018-12-08 08:05:05,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:05,555 INFO L478 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 33 treesize of output 20 [2018-12-08 08:05:05,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:05,573 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-12-08 08:05:05,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:05,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:05,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:05,608 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:118, output treesize:50 [2018-12-08 08:05:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-08 08:05:05,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:05:06,337 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-08 08:05:06,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:06,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:06,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:06,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:06,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:06,611 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:68 [2018-12-08 08:05:24,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:05:24,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:05:24,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:05:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:05:24,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:05:24,274 INFO L478 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-12-08 08:05:24,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:24,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:24,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 08:05:24,363 INFO L478 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 13 treesize of output 10 [2018-12-08 08:05:24,365 INFO L478 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 10 treesize of output 9 [2018-12-08 08:05:24,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:24,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:24,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:24,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-08 08:05:24,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:24,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:24,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:24,405 INFO L478 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 33 treesize of output 52 [2018-12-08 08:05:24,407 INFO L478 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 32 treesize of output 46 [2018-12-08 08:05:24,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:24,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:24,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:24,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2018-12-08 08:05:24,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:24,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:24,994 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 08:05:24,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 113 [2018-12-08 08:05:24,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:25,139 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-08 08:05:25,147 INFO L478 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 17 treesize of output 20 [2018-12-08 08:05:25,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:25,162 INFO L478 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 20 treesize of output 16 [2018-12-08 08:05:25,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:25,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:25,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:25,284 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2018-12-08 08:05:25,290 INFO L478 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 17 treesize of output 20 [2018-12-08 08:05:25,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:05:25,298 INFO L478 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 20 treesize of output 16 [2018-12-08 08:05:25,298 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:25,308 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:25,332 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:25,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:25,378 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:127, output treesize:123 [2018-12-08 08:05:25,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 22 [2018-12-08 08:05:25,594 INFO L478 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-12-08 08:05:25,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:25,611 INFO L478 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 7 treesize of output 1 [2018-12-08 08:05:25,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:25,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:05:25,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:25,671 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:139, output treesize:119 [2018-12-08 08:05:26,139 INFO L478 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 103 treesize of output 72 [2018-12-08 08:05:26,145 INFO L478 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 7 treesize of output 1 [2018-12-08 08:05:26,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:26,166 INFO L478 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 35 treesize of output 22 [2018-12-08 08:05:26,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:05:26,184 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-12-08 08:05:26,184 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:26,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:26,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:26,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:120, output treesize:52 [2018-12-08 08:05:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-08 08:05:26,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:05:28,782 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-08 08:05:28,979 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:28,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:29,028 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:29,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:29,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 08:05:29,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:91 [2018-12-08 08:05:51,432 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-12-08 08:05:51,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:05:51,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 36 [2018-12-08 08:05:51,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-08 08:05:51,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-08 08:05:51,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1913, Unknown=14, NotChecked=88, Total=2162 [2018-12-08 08:05:51,449 INFO L87 Difference]: Start difference. First operand 170 states and 204 transitions. Second operand 37 states. [2018-12-08 08:06:00,885 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-08 08:06:05,317 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-08 08:06:08,765 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-12-08 08:06:09,296 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-12-08 08:06:10,373 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-12-08 08:06:10,767 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2018-12-08 08:06:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:06:12,641 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2018-12-08 08:06:12,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-08 08:06:12,642 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 59 [2018-12-08 08:06:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:06:12,642 INFO L225 Difference]: With dead ends: 190 [2018-12-08 08:06:12,643 INFO L226 Difference]: Without dead ends: 190 [2018-12-08 08:06:12,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 62.7s TimeCoverageRelationStatistics Valid=293, Invalid=3355, Unknown=16, NotChecked=118, Total=3782 [2018-12-08 08:06:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-08 08:06:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 172. [2018-12-08 08:06:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-08 08:06:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2018-12-08 08:06:12,646 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 59 [2018-12-08 08:06:12,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:06:12,646 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2018-12-08 08:06:12,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-08 08:06:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2018-12-08 08:06:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 08:06:12,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:06:12,647 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:06:12,647 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 08:06:12,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:06:12,647 INFO L82 PathProgramCache]: Analyzing trace with hash -407019285, now seen corresponding path program 1 times [2018-12-08 08:06:12,647 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 08:06:12,647 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81d3dabc-ffd1-438f-8118-73e6729b67f0/bin-2019/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 08:06:12,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:06:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:06:12,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:06:12,920 INFO L478 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-12-08 08:06:12,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:12,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:12,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 08:06:12,937 INFO L478 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-12-08 08:06:12,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:12,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:12,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-08 08:06:13,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:06:13,113 INFO L478 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 17 [2018-12-08 08:06:13,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:13,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:13,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:41 [2018-12-08 08:06:13,240 INFO L478 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 13 treesize of output 10 [2018-12-08 08:06:13,243 INFO L478 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 10 treesize of output 9 [2018-12-08 08:06:13,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:13,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:13,275 INFO L478 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 13 treesize of output 10 [2018-12-08 08:06:13,278 INFO L478 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 10 treesize of output 9 [2018-12-08 08:06:13,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:13,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:13,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:13,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:71 [2018-12-08 08:06:13,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:06:13,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:06:13,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:06:13,591 INFO L478 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 35 treesize of output 54 [2018-12-08 08:06:13,596 INFO L478 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 34 treesize of output 48 [2018-12-08 08:06:13,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:13,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:13,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:13,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:70 [2018-12-08 08:06:16,403 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32)))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv8 32))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= |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) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base))))) is different from true [2018-12-08 08:06:16,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:06:16,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:06:16,431 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 08:06:16,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-12-08 08:06:16,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:16,571 INFO L478 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 29 treesize of output 64 [2018-12-08 08:06:16,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:16,738 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2018-12-08 08:06:16,745 INFO L478 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 17 treesize of output 20 [2018-12-08 08:06:16,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:06:16,757 INFO L478 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 20 treesize of output 16 [2018-12-08 08:06:16,757 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:16,770 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:16,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:16,908 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 56 [2018-12-08 08:06:16,915 INFO L478 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 17 treesize of output 20 [2018-12-08 08:06:16,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:06:16,927 INFO L478 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 20 treesize of output 16 [2018-12-08 08:06:16,927 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:16,937 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:16,953 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:17,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:17,002 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:161, output treesize:129 [2018-12-08 08:06:17,398 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2018-12-08 08:06:17,403 INFO L478 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 30 treesize of output 17 [2018-12-08 08:06:17,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:17,428 INFO L478 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 7 treesize of output 1 [2018-12-08 08:06:17,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:17,444 INFO L478 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-12-08 08:06:17,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:17,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:06:17,516 INFO L478 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 103 treesize of output 72 [2018-12-08 08:06:17,521 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-12-08 08:06:17,522 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:17,553 INFO L478 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 7 treesize of output 1 [2018-12-08 08:06:17,553 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:17,574 INFO L478 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 33 treesize of output 20 [2018-12-08 08:06:17,574 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 08:06:17,591 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:17,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:17,614 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:164, output treesize:37 [2018-12-08 08:06:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-08 08:06:17,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:06:18,924 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-08 08:06:19,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:19,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:21,062 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:21,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:22,374 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:22,409 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:23,339 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:23,367 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:23,887 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:23,918 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:24,374 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:24,398 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 08:06:24,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-12-08 08:06:24,633 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:240, output treesize:309 [2018-12-08 08:06:39,327 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-08 08:06:39,529 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 08:06:39,530 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:893) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) 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:383) 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.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:456) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) 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) ... 40 more [2018-12-08 08:06:39,538 INFO L168 Benchmark]: Toolchain (without parser) took 807461.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 939.3 MB in the beginning and 908.1 MB in the end (delta: 31.3 MB). Peak memory consumption was 196.4 MB. Max. memory is 11.5 GB. [2018-12-08 08:06:39,540 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:06:39,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-12-08 08:06:39,541 INFO L168 Benchmark]: Boogie Preprocessor took 34.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-12-08 08:06:39,541 INFO L168 Benchmark]: RCFGBuilder took 428.21 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: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2018-12-08 08:06:39,542 INFO L168 Benchmark]: TraceAbstraction took 806670.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.8 MB). Free memory was 1.1 GB in the beginning and 908.1 MB in the end (delta: 152.1 MB). Peak memory consumption was 169.9 MB. Max. memory is 11.5 GB. [2018-12-08 08:06:39,546 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.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. * RCFGBuilder took 428.21 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: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 806670.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.8 MB). Free memory was 1.1 GB in the beginning and 908.1 MB in the end (delta: 152.1 MB). Peak memory consumption was 169.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...