./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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 1c66d86f2cb93b92fe110cb1d9c29158a00f0747 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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 1c66d86f2cb93b92fe110cb1d9c29158a00f0747 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 11:41:11,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:41:11,633 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:41:11,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:41:11,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:41:11,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:41:11,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:41:11,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:41:11,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:41:11,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:41:11,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:41:11,645 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:41:11,646 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:41:11,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:41:11,647 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:41:11,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:41:11,648 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:41:11,649 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:41:11,651 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:41:11,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:41:11,652 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:41:11,653 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:41:11,655 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:41:11,655 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:41:11,655 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:41:11,656 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:41:11,656 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:41:11,657 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:41:11,657 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:41:11,658 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:41:11,658 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:41:11,659 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:41:11,659 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:41:11,659 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:41:11,660 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:41:11,660 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:41:11,660 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 11:41:11,670 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:41:11,670 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:41:11,671 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:41:11,671 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:41:11,671 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:41:11,671 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:41:11,672 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:41:11,672 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:41:11,672 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:41:11,672 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:41:11,672 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:41:11,672 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:41:11,672 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:41:11,672 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 11:41:11,672 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 11:41:11,673 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 11:41:11,673 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:41:11,673 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:41:11,673 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:41:11,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:41:11,673 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:41:11,673 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:41:11,674 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:41:11,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:41:11,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:41:11,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:41:11,674 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:41:11,674 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:41:11,674 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_c24197e1-666f-445e-a378-d3ee5ea44c3b/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 -> 1c66d86f2cb93b92fe110cb1d9c29158a00f0747 [2018-11-28 11:41:11,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:41:11,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:41:11,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:41:11,707 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:41:11,707 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:41:11,707 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:41:11,743 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/data/b04170276/c392f7d3e0e64b54b628e2a7ee981373/FLAGe9cc29fe4 [2018-11-28 11:41:12,182 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:41:12,183 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/sv-benchmarks/c/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:41:12,192 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/data/b04170276/c392f7d3e0e64b54b628e2a7ee981373/FLAGe9cc29fe4 [2018-11-28 11:41:12,204 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/data/b04170276/c392f7d3e0e64b54b628e2a7ee981373 [2018-11-28 11:41:12,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:41:12,208 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 11:41:12,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:41:12,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:41:12,211 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:41:12,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:12" (1/1) ... [2018-11-28 11:41:12,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd24d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:12, skipping insertion in model container [2018-11-28 11:41:12,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:12" (1/1) ... [2018-11-28 11:41:12,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:41:12,247 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:41:12,427 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:41:12,488 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:41:12,518 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:41:12,553 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:41:12,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:12 WrapperNode [2018-11-28 11:41:12,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:41:12,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:41:12,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:41:12,555 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:41:12,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:12" (1/1) ... [2018-11-28 11:41:12,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:12" (1/1) ... [2018-11-28 11:41:12,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:12" (1/1) ... [2018-11-28 11:41:12,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:12" (1/1) ... [2018-11-28 11:41:12,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:12" (1/1) ... [2018-11-28 11:41:12,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:12" (1/1) ... [2018-11-28 11:41:12,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:12" (1/1) ... [2018-11-28 11:41:12,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:41:12,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:41:12,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:41:12,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:41:12,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:12,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:41:12,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:41:12,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 11:41:12,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 11:41:12,632 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 11:41:12,632 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-28 11:41:12,632 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-28 11:41:12,632 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-28 11:41:12,632 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-11-28 11:41:12,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:41:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 11:41:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 11:41:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 11:41:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 11:41:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 11:41:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 11:41:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 11:41:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 11:41:12,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 11:41:12,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 11:41:12,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 11:41:12,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 11:41:12,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 11:41:12,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 11:41:12,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 11:41:12,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 11:41:12,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 11:41:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 11:41:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 11:41:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 11:41:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 11:41:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 11:41:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 11:41:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 11:41:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 11:41:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 11:41:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 11:41:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 11:41:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 11:41:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 11:41:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 11:41:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 11:41:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 11:41:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 11:41:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 11:41:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 11:41:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 11:41:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 11:41:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 11:41:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 11:41:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 11:41:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 11:41:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 11:41:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 11:41:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 11:41:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 11:41:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 11:41:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 11:41:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 11:41:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 11:41:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 11:41:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 11:41:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 11:41:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 11:41:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 11:41:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 11:41:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 11:41:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 11:41:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 11:41:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 11:41:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 11:41:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 11:41:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 11:41:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 11:41:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 11:41:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 11:41:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 11:41:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 11:41:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 11:41:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 11:41:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 11:41:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 11:41:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 11:41:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 11:41:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 11:41:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 11:41:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 11:41:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 11:41:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 11:41:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 11:41:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 11:41:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 11:41:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 11:41:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 11:41:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 11:41:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 11:41:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 11:41:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 11:41:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 11:41:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 11:41:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 11:41:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 11:41:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 11:41:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 11:41:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 11:41:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 11:41:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 11:41:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 11:41:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 11:41:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 11:41:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 11:41:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 11:41:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 11:41:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 11:41:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 11:41:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 11:41:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 11:41:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-28 11:41:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:41:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:41:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:41:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-28 11:41:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-28 11:41:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:41:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:41:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-11-28 11:41:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:41:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 11:41:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:41:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:41:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:41:13,015 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:41:13,015 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 11:41:13,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:13 BoogieIcfgContainer [2018-11-28 11:41:13,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:41:13,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:41:13,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:41:13,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:41:13,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:41:12" (1/3) ... [2018-11-28 11:41:13,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b46778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:41:13, skipping insertion in model container [2018-11-28 11:41:13,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:12" (2/3) ... [2018-11-28 11:41:13,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b46778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:41:13, skipping insertion in model container [2018-11-28 11:41:13,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:13" (3/3) ... [2018-11-28 11:41:13,021 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:41:13,029 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:41:13,036 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-11-28 11:41:13,049 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-11-28 11:41:13,070 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:41:13,071 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:41:13,071 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 11:41:13,071 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:41:13,071 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:41:13,071 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:41:13,071 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:41:13,071 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:41:13,072 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:41:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-11-28 11:41:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 11:41:13,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:13,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:13,093 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 11:41:13,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1363076523, now seen corresponding path program 1 times [2018-11-28 11:41:13,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:13,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:13,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:13,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:13,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:13,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:41:13,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:41:13,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:41:13,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:41:13,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:41:13,241 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2018-11-28 11:41:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:13,333 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-11-28 11:41:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:41:13,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 11:41:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:13,341 INFO L225 Difference]: With dead ends: 97 [2018-11-28 11:41:13,341 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 11:41:13,342 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-11-28 11:41:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 11:41:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-28 11:41:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 11:41:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-11-28 11:41:13,370 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 13 [2018-11-28 11:41:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:13,370 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-11-28 11:41:13,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:41:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-11-28 11:41:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 11:41:13,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:13,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:13,371 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 11:41:13,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:13,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1363076524, now seen corresponding path program 1 times [2018-11-28 11:41:13,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:13,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:13,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:13,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:13,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:13,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:41:13,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:41:13,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:41:13,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:41:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:41:13,431 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 3 states. [2018-11-28 11:41:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:13,508 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-11-28 11:41:13,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:41:13,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 11:41:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:13,511 INFO L225 Difference]: With dead ends: 88 [2018-11-28 11:41:13,511 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 11:41:13,512 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-11-28 11:41:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 11:41:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-28 11:41:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 11:41:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-11-28 11:41:13,520 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 13 [2018-11-28 11:41:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:13,520 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-11-28 11:41:13,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:41:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-11-28 11:41:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 11:41:13,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:13,521 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-11-28 11:41:13,521 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 11:41:13,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1814254063, now seen corresponding path program 1 times [2018-11-28 11:41:13,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:13,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:13,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:13,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:13,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:13,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:41:13,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:41:13,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:41:13,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:41:13,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:41:13,579 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 6 states. [2018-11-28 11:41:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:13,703 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-11-28 11:41:13,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:41:13,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 11:41:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:13,705 INFO L225 Difference]: With dead ends: 92 [2018-11-28 11:41:13,706 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 11:41:13,706 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-11-28 11:41:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 11:41:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-11-28 11:41:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 11:41:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-11-28 11:41:13,711 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2018-11-28 11:41:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:13,712 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-11-28 11:41:13,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:41:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-11-28 11:41:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 11:41:13,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:13,713 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-11-28 11:41:13,713 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 11:41:13,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1814254064, now seen corresponding path program 1 times [2018-11-28 11:41:13,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:13,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:13,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:13,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:13,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:13,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:41:13,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:41:13,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:41:13,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:41:13,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:41:13,801 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 6 states. [2018-11-28 11:41:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:13,916 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-11-28 11:41:13,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:41:13,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 11:41:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:13,918 INFO L225 Difference]: With dead ends: 91 [2018-11-28 11:41:13,918 INFO L226 Difference]: Without dead ends: 91 [2018-11-28 11:41:13,919 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-11-28 11:41:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-28 11:41:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-11-28 11:41:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 11:41:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-11-28 11:41:13,924 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 19 [2018-11-28 11:41:13,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:13,925 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-11-28 11:41:13,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:41:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-28 11:41:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:41:13,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:13,926 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-11-28 11:41:13,926 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 11:41:13,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:13,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1942189562, now seen corresponding path program 1 times [2018-11-28 11:41:13,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:13,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:13,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:13,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:13,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:13,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:41:13,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:41:13,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:41:13,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:41:13,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:41:13,964 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 5 states. [2018-11-28 11:41:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:13,992 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-11-28 11:41:13,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:41:13,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-28 11:41:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:13,993 INFO L225 Difference]: With dead ends: 95 [2018-11-28 11:41:13,993 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 11:41:13,993 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-11-28 11:41:13,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 11:41:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-11-28 11:41:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 11:41:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-11-28 11:41:13,999 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 25 [2018-11-28 11:41:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:13,999 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-11-28 11:41:13,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:41:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-11-28 11:41:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 11:41:14,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:14,000 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-11-28 11:41:14,001 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 11:41:14,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash 802124793, now seen corresponding path program 1 times [2018-11-28 11:41:14,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:14,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:14,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 11:41:14,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:14,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:14,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:14,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:14,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:14,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:14,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 11:41:14,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:41:14,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:41:14,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:41:14,169 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 6 states. [2018-11-28 11:41:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:14,204 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-11-28 11:41:14,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:41:14,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-28 11:41:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:14,205 INFO L225 Difference]: With dead ends: 101 [2018-11-28 11:41:14,205 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 11:41:14,206 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-11-28 11:41:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 11:41:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2018-11-28 11:41:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 11:41:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-11-28 11:41:14,212 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 38 [2018-11-28 11:41:14,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:14,212 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-11-28 11:41:14,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:41:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-11-28 11:41:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 11:41:14,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:14,213 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-11-28 11:41:14,214 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 11:41:14,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:14,214 INFO L82 PathProgramCache]: Analyzing trace with hash -908956582, now seen corresponding path program 2 times [2018-11-28 11:41:14,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:14,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:14,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:14,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:14,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 11:41:14,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:14,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:14,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:41:14,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:41:14,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:41:14,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:14,574 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-11-28 11:41:14,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:14,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:14,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:41:14,874 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:41:14,875 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 7700 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-11-28 11:41:14,878 INFO L168 Benchmark]: Toolchain (without parser) took 2670.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.0 MB in the beginning and 829.8 MB in the end (delta: 126.2 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:41:14,879 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:41:14,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:41:14,880 INFO L168 Benchmark]: Boogie Preprocessor took 40.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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:41:14,880 INFO L168 Benchmark]: RCFGBuilder took 420.26 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.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:41:14,881 INFO L168 Benchmark]: TraceAbstraction took 1861.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 829.8 MB in the end (delta: 242.5 MB). Peak memory consumption was 242.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:41:14,883 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 420.26 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.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1861.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 829.8 MB in the end (delta: 242.5 MB). Peak memory consumption was 242.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 7700 column 44: unknown constant node_create_~temp~0.base de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 7700 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-0cd3be1 [2018-11-28 11:41:16,308 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:41:16,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:41:16,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:41:16,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:41:16,317 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:41:16,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:41:16,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:41:16,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:41:16,321 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:41:16,322 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:41:16,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:41:16,322 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:41:16,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:41:16,324 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:41:16,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:41:16,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:41:16,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:41:16,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:41:16,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:41:16,329 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:41:16,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:41:16,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:41:16,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:41:16,332 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:41:16,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:41:16,333 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:41:16,334 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:41:16,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:41:16,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:41:16,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:41:16,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:41:16,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:41:16,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:41:16,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:41:16,337 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:41:16,337 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-11-28 11:41:16,348 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:41:16,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:41:16,349 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:41:16,349 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:41:16,349 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:41:16,349 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:41:16,349 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:41:16,350 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:41:16,350 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:41:16,350 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:41:16,350 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:41:16,350 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:41:16,350 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:41:16,351 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 11:41:16,351 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 11:41:16,351 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 11:41:16,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:41:16,351 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 11:41:16,351 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 11:41:16,351 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:41:16,351 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:41:16,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:41:16,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:41:16,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:41:16,352 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:41:16,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:41:16,352 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:41:16,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:41:16,352 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 11:41:16,352 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:41:16,352 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 11:41:16,353 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_c24197e1-666f-445e-a378-d3ee5ea44c3b/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 -> 1c66d86f2cb93b92fe110cb1d9c29158a00f0747 [2018-11-28 11:41:16,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:41:16,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:41:16,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:41:16,394 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:41:16,395 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:41:16,395 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:41:16,440 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/data/fee2ee368/6c9bfa35474c4c2291e6988df31aea3c/FLAGce7d43673 [2018-11-28 11:41:16,795 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:41:16,796 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/sv-benchmarks/c/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:41:16,804 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/data/fee2ee368/6c9bfa35474c4c2291e6988df31aea3c/FLAGce7d43673 [2018-11-28 11:41:17,194 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/data/fee2ee368/6c9bfa35474c4c2291e6988df31aea3c [2018-11-28 11:41:17,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:41:17,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 11:41:17,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:41:17,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:41:17,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:41:17,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:17" (1/1) ... [2018-11-28 11:41:17,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c66ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17, skipping insertion in model container [2018-11-28 11:41:17,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:17" (1/1) ... [2018-11-28 11:41:17,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:41:17,236 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:41:17,457 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:41:17,466 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:41:17,502 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:41:17,580 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:41:17,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17 WrapperNode [2018-11-28 11:41:17,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:41:17,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:41:17,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:41:17,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:41:17,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 11:41:17,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 11:41:17,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 11:41:17,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 11:41:17,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 11:41:17,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 11:41:17,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... [2018-11-28 11:41:17,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:41:17,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:41:17,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:41:17,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:41:17,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:17,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:41:17,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:41:17,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 11:41:17,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 11:41:17,663 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 11:41:17,663 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-28 11:41:17,663 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-28 11:41:17,663 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-28 11:41:17,663 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-11-28 11:41:17,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:41:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 11:41:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 11:41:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 11:41:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 11:41:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 11:41:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 11:41:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 11:41:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 11:41:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 11:41:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 11:41:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 11:41:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 11:41:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 11:41:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 11:41:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 11:41:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 11:41:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 11:41:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 11:41:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 11:41:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 11:41:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 11:41:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 11:41:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 11:41:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 11:41:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 11:41:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 11:41:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 11:41:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 11:41:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 11:41:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 11:41:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 11:41:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 11:41:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 11:41:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 11:41:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 11:41:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 11:41:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 11:41:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 11:41:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 11:41:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 11:41:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 11:41:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 11:41:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 11:41:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 11:41:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 11:41:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 11:41:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 11:41:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 11:41:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 11:41:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 11:41:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 11:41:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 11:41:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 11:41:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 11:41:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 11:41:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 11:41:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 11:41:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 11:41:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 11:41:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 11:41:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 11:41:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 11:41:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 11:41:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 11:41:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 11:41:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 11:41:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 11:41:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 11:41:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 11:41:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 11:41:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 11:41:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 11:41:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 11:41:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 11:41:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 11:41:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 11:41:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 11:41:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 11:41:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 11:41:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 11:41:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 11:41:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 11:41:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 11:41:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 11:41:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 11:41:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 11:41:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 11:41:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 11:41:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 11:41:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 11:41:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 11:41:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 11:41:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 11:41:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 11:41:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 11:41:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 11:41:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 11:41:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 11:41:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 11:41:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 11:41:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 11:41:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 11:41:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 11:41:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 11:41:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 11:41:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 11:41:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 11:41:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-28 11:41:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:41:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:41:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-28 11:41:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-28 11:41:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-28 11:41:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:41:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:41:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-11-28 11:41:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:41:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 11:41:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-28 11:41:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:41:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:41:18,112 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:41:18,112 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 11:41:18,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:18 BoogieIcfgContainer [2018-11-28 11:41:18,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:41:18,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:41:18,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:41:18,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:41:18,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:41:17" (1/3) ... [2018-11-28 11:41:18,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b492508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:41:18, skipping insertion in model container [2018-11-28 11:41:18,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:17" (2/3) ... [2018-11-28 11:41:18,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b492508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:41:18, skipping insertion in model container [2018-11-28 11:41:18,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:18" (3/3) ... [2018-11-28 11:41:18,119 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:41:18,127 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:41:18,135 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-11-28 11:41:18,147 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-11-28 11:41:18,167 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:41:18,168 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:41:18,168 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 11:41:18,168 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:41:18,168 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:41:18,168 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:41:18,168 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:41:18,168 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:41:18,168 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:41:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-11-28 11:41:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 11:41:18,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:18,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:18,192 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:41:18,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1363076523, now seen corresponding path program 1 times [2018-11-28 11:41:18,201 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:41:18,201 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:18,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:18,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:18,296 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-11-28 11:41:18,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:18,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:18,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:41:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:18,320 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:41:18,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:41:18,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:41:18,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:41:18,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:41:18,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:41:18,334 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2018-11-28 11:41:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:18,498 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-11-28 11:41:18,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:41:18,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 11:41:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:18,509 INFO L225 Difference]: With dead ends: 97 [2018-11-28 11:41:18,509 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 11:41:18,510 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-11-28 11:41:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 11:41:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-28 11:41:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 11:41:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-11-28 11:41:18,547 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 13 [2018-11-28 11:41:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:18,547 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-11-28 11:41:18,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:41:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-11-28 11:41:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 11:41:18,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:18,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:18,548 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:41:18,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1363076524, now seen corresponding path program 1 times [2018-11-28 11:41:18,549 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:41:18,549 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:18,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:18,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:18,625 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-11-28 11:41:18,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:18,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:18,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:41:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:18,645 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:41:18,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:41:18,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:41:18,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:41:18,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:41:18,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:41:18,649 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 3 states. [2018-11-28 11:41:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:18,787 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-11-28 11:41:18,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:41:18,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 11:41:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:18,789 INFO L225 Difference]: With dead ends: 88 [2018-11-28 11:41:18,789 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 11:41:18,790 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-11-28 11:41:18,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 11:41:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-28 11:41:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 11:41:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-11-28 11:41:18,794 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 13 [2018-11-28 11:41:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:18,795 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-11-28 11:41:18,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:41:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-11-28 11:41:18,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 11:41:18,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:18,796 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-11-28 11:41:18,796 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:41:18,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:18,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1814254063, now seen corresponding path program 1 times [2018-11-28 11:41:18,797 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:41:18,797 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:18,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:18,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:18,887 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-11-28 11:41:18,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:18,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:18,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:41:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:18,916 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:41:18,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:41:18,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:41:18,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:41:18,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:41:18,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:41:18,919 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 6 states. [2018-11-28 11:41:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:19,195 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-11-28 11:41:19,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:41:19,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 11:41:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:19,198 INFO L225 Difference]: With dead ends: 92 [2018-11-28 11:41:19,198 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 11:41:19,199 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-11-28 11:41:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 11:41:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-11-28 11:41:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 11:41:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-11-28 11:41:19,206 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2018-11-28 11:41:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:19,206 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-11-28 11:41:19,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:41:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-11-28 11:41:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 11:41:19,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:19,207 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-11-28 11:41:19,208 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:41:19,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1814254064, now seen corresponding path program 1 times [2018-11-28 11:41:19,208 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:41:19,208 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:19,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:19,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:19,303 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-11-28 11:41:19,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:19,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:19,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:41:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:19,380 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:41:19,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:41:19,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:41:19,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:41:19,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:41:19,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:41:19,382 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 6 states. [2018-11-28 11:41:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:19,640 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-11-28 11:41:19,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:41:19,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 11:41:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:19,642 INFO L225 Difference]: With dead ends: 91 [2018-11-28 11:41:19,643 INFO L226 Difference]: Without dead ends: 91 [2018-11-28 11:41:19,643 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-11-28 11:41:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-28 11:41:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-11-28 11:41:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 11:41:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-11-28 11:41:19,649 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 19 [2018-11-28 11:41:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:19,649 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-11-28 11:41:19,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:41:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-28 11:41:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:41:19,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:19,650 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-11-28 11:41:19,650 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:41:19,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1942189562, now seen corresponding path program 1 times [2018-11-28 11:41:19,651 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:41:19,651 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:19,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:19,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:19,733 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:41:19,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:41:19,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:41:19,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:41:19,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:41:19,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:41:19,738 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 5 states. [2018-11-28 11:41:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:19,763 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-11-28 11:41:19,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:41:19,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-28 11:41:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:19,765 INFO L225 Difference]: With dead ends: 95 [2018-11-28 11:41:19,766 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 11:41:19,766 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-11-28 11:41:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 11:41:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-11-28 11:41:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 11:41:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-11-28 11:41:19,772 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 25 [2018-11-28 11:41:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:19,772 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-11-28 11:41:19,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:41:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-11-28 11:41:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 11:41:19,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:19,774 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-11-28 11:41:19,775 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:41:19,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:19,775 INFO L82 PathProgramCache]: Analyzing trace with hash 802124793, now seen corresponding path program 1 times [2018-11-28 11:41:19,776 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:41:19,776 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:19,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:19,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:19,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:41:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 11:41:20,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:20,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-28 11:41:20,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:41:20,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:41:20,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:41:20,023 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 9 states. [2018-11-28 11:41:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:20,117 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-11-28 11:41:20,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:41:20,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-28 11:41:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:20,118 INFO L225 Difference]: With dead ends: 101 [2018-11-28 11:41:20,118 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 11:41:20,118 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-11-28 11:41:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 11:41:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2018-11-28 11:41:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 11:41:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-11-28 11:41:20,123 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 38 [2018-11-28 11:41:20,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:20,123 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-11-28 11:41:20,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:41:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-11-28 11:41:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 11:41:20,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:20,124 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-11-28 11:41:20,124 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:41:20,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:20,125 INFO L82 PathProgramCache]: Analyzing trace with hash -908956582, now seen corresponding path program 2 times [2018-11-28 11:41:20,125 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:41:20,125 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:20,149 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-28 11:41:20,270 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-11-28 11:41:20,270 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 11:41:20,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:41:20,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:41:20,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:41:20,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:41:20,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:20,362 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-11-28 11:41:20,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:20,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:20,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:41:22,384 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-28 11:41:24,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:24,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:24,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:24,272 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-11-28 11:41:24,276 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-11-28 11:41:24,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:24,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:24,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:41:24,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2018-11-28 11:41:24,810 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-11-28 11:41:24,820 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:24,820 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-11-28 11:41:24,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:24,833 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-11-28 11:41:24,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-11-28 11:41:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 19 not checked. [2018-11-28 11:41:24,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:41:27,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:41:27,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-28 11:41:27,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:41:27,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:41:27,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=8, NotChecked=42, Total=182 [2018-11-28 11:41:27,872 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 10 states. [2018-11-28 11:41:39,810 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-11-28 11:41:44,299 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-28 11:41:45,367 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-11-28 11:42:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:42:18,582 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2018-11-28 11:42:18,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:42:18,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-11-28 11:42:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:42:18,583 INFO L225 Difference]: With dead ends: 140 [2018-11-28 11:42:18,584 INFO L226 Difference]: Without dead ends: 140 [2018-11-28 11:42:18,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=49, Invalid=136, Unknown=9, NotChecked=78, Total=272 [2018-11-28 11:42:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-28 11:42:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2018-11-28 11:42:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-28 11:42:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2018-11-28 11:42:18,590 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 51 [2018-11-28 11:42:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:42:18,590 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2018-11-28 11:42:18,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:42:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-11-28 11:42:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 11:42:18,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:42:18,591 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-11-28 11:42:18,591 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:42:18,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:42:18,591 INFO L82 PathProgramCache]: Analyzing trace with hash -908956581, now seen corresponding path program 1 times [2018-11-28 11:42:18,592 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:42:18,592 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:42:18,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:42:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:42:18,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:42:18,794 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-11-28 11:42:18,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:18,802 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-11-28 11:42:18,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:18,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:18,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 11:42:19,697 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-11-28 11:42:23,144 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-11-28 11:42:23,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:23,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:23,206 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-11-28 11:42:23,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:23,215 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-11-28 11:42:23,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:23,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:23,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:23,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:23,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:23,269 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-11-28 11:42:23,270 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:23,283 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-11-28 11:42:23,283 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:25 [2018-11-28 11:42:27,599 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-11-28 11:42:27,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:27,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:27,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:27,624 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-11-28 11:42:27,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-28 11:42:27,670 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-11-28 11:42:27,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:60 [2018-11-28 11:42:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 26 not checked. [2018-11-28 11:42:27,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:42:29,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:42:29,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:42:29,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:42:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:42:29,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:42:29,996 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-11-28 11:42:29,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:30,003 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-11-28 11:42:30,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:30,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:30,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 11:42:31,033 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-11-28 11:42:32,740 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-11-28 11:42:32,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:32,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:32,752 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-11-28 11:42:32,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:32,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:32,766 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-11-28 11:42:32,778 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-11-28 11:42:32,778 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:42:32,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:42:32,814 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-11-28 11:42:32,814 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:42 [2018-11-28 11:42:34,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:34,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:34,660 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-11-28 11:42:34,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-28 11:42:34,724 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-11-28 11:42:34,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:34,756 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-11-28 11:42:34,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:61 [2018-11-28 11:42:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 20 not checked. [2018-11-28 11:42:36,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:42:36,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:42:36,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2018-11-28 11:42:36,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 11:42:36,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 11:42:36,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=228, Unknown=10, NotChecked=170, Total=462 [2018-11-28 11:42:36,852 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 20 states. [2018-11-28 11:42:48,483 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-11-28 11:42:52,804 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-11-28 11:42:56,840 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-11-28 11:42:59,097 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-11-28 11:43:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:37,458 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2018-11-28 11:43:37,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:43:37,459 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-11-28 11:43:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:37,460 INFO L225 Difference]: With dead ends: 151 [2018-11-28 11:43:37,460 INFO L226 Difference]: Without dead ends: 151 [2018-11-28 11:43:37,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=92, Invalid=384, Unknown=14, NotChecked=322, Total=812 [2018-11-28 11:43:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-28 11:43:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 127. [2018-11-28 11:43:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-28 11:43:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2018-11-28 11:43:37,464 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 51 [2018-11-28 11:43:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:37,464 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2018-11-28 11:43:37,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 11:43:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2018-11-28 11:43:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:43:37,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:37,465 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-11-28 11:43:37,465 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:43:37,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:37,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2015476768, now seen corresponding path program 1 times [2018-11-28 11:43:37,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:43:37,466 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:43:37,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:37,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:43:37,658 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-11-28 11:43:37,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:37,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:37,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:43:39,333 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-28 11:43:41,346 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-28 11:43:44,500 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-11-28 11:43:45,808 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-11-28 11:43:46,827 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-11-28 11:43:48,831 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-11-28 11:43:48,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:48,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:48,837 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-11-28 11:43:48,841 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-11-28 11:43:48,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:48,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:48,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:43:48,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2018-11-28 11:43:51,450 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-11-28 11:43:51,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:51,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:51,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:51,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:51,473 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-11-28 11:43:51,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:51,547 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-11-28 11:43:51,554 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-11-28 11:43:51,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:51,560 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-11-28 11:43:51,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:51,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:51,578 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:51,601 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-11-28 11:43:51,601 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:62, output treesize:60 [2018-11-28 11:43:51,661 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-11-28 11:43:51,666 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-11-28 11:43:51,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:51,679 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-11-28 11:43:51,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:51,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:51,712 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-11-28 11:43:51,712 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:66, output treesize:42 [2018-11-28 11:43:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 2 refuted. 3 times theorem prover too weak. 1 trivial. 18 not checked. [2018-11-28 11:43:51,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:43:51,963 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:43:51,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:43:51,978 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-11-28 11:43:51,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-11-28 11:44:00,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:44:00,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:44:00,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:00,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:44:00,885 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-11-28 11:44:00,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:00,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:00,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:44:14,180 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 c_sll_create_~head~0.base)) (= (store .cse0 c_sll_create_~head~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-11-28 11:44:16,186 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select .cse0 |c_sll_create_#res.base|) (_ bv0 1)) (= |c_#valid| (store .cse0 |c_sll_create_#res.base| (_ bv1 1)))))) is different from true [2018-11-28 11:44:16,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:16,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:16,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:16,208 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-11-28 11:44:16,211 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-11-28 11:44:16,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:16,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:16,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:44:16,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2018-11-28 11:44:16,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:16,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:16,575 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:44:16,576 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-11-28 11:44:16,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:16,654 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-11-28 11:44:16,660 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-11-28 11:44:16,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:16,671 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-11-28 11:44:16,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:16,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:16,699 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:16,736 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-11-28 11:44:16,736 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:75 [2018-11-28 11:44:16,889 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-11-28 11:44:16,896 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-11-28 11:44:16,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:16,919 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-11-28 11:44:16,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:16,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:16,956 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-11-28 11:44:16,956 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:84, output treesize:52 [2018-11-28 11:44:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 2 refuted. 3 times theorem prover too weak. 1 trivial. 9 not checked. [2018-11-28 11:44:17,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:44:17,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:44:17,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:44:17,508 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-11-28 11:44:17,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-11-28 11:44:28,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:44:28,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 36 [2018-11-28 11:44:28,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-28 11:44:28,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 11:44:28,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=955, Unknown=20, NotChecked=552, Total=1640 [2018-11-28 11:44:28,100 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand 37 states. [2018-11-28 11:44:59,709 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2018-11-28 11:45:09,831 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-28 11:45:42,172 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-11-28 11:46:02,900 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-11-28 11:46:09,554 WARN L180 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-28 11:46:11,029 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2018-11-28 11:46:25,486 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2018-11-28 11:46:51,448 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-11-28 11:46:56,992 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2018-11-28 11:48:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:48:23,093 INFO L93 Difference]: Finished difference Result 154 states and 170 transitions. [2018-11-28 11:48:23,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 11:48:23,094 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-11-28 11:48:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:48:23,095 INFO L225 Difference]: With dead ends: 154 [2018-11-28 11:48:23,095 INFO L226 Difference]: Without dead ends: 154 [2018-11-28 11:48:23,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 113.0s TimeCoverageRelationStatistics Valid=215, Invalid=1845, Unknown=42, NotChecked=760, Total=2862 [2018-11-28 11:48:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-28 11:48:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2018-11-28 11:48:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-28 11:48:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2018-11-28 11:48:23,099 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 55 [2018-11-28 11:48:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:48:23,100 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2018-11-28 11:48:23,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-28 11:48:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2018-11-28 11:48:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:48:23,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:48:23,101 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-11-28 11:48:23,101 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:48:23,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:23,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2015476767, now seen corresponding path program 1 times [2018-11-28 11:48:23,101 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:48:23,101 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:48:23,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:48:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:23,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:23,347 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-11-28 11:48:23,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:23,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:23,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:48:24,306 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-28 11:48:24,312 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-11-28 11:48:24,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:24,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:24,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-28 11:48:26,355 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 11:48:28,385 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 11:48:29,053 WARN L180 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 11:48:31,090 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 11:48:31,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:31,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:31,097 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-11-28 11:48:31,104 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-11-28 11:48:31,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:31,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:31,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:31,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:33 [2018-11-28 11:48:33,496 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-11-28 11:48:33,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:33,526 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:33,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:33,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:33,542 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-11-28 11:48:33,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:33,649 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-11-28 11:48:33,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:33,757 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-11-28 11:48:33,763 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-11-28 11:48:33,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:33,776 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-11-28 11:48:33,776 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:33,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:33,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:33,863 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-11-28 11:48:33,868 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-11-28 11:48:33,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:33,878 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-11-28 11:48:33,878 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:33,887 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:33,897 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:33,928 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-11-28 11:48:33,928 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:98, output treesize:55 [2018-11-28 11:48:34,010 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-11-28 11:48:34,013 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-11-28 11:48:34,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:34,024 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-11-28 11:48:34,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:34,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:34,052 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-11-28 11:48:34,059 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-11-28 11:48:34,059 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:34,072 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-11-28 11:48:34,072 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:34,076 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:34,086 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-11-28 11:48:34,086 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:70, output treesize:22 [2018-11-28 11:48:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2018-11-28 11:48:34,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:48:34,713 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 11:48:34,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:34,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:36,443 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:36,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:37,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:37,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:38,055 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:38,079 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:38,344 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:38,362 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:38,522 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:38,544 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:38,666 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-11-28 11:48:38,666 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:190, output treesize:129 [2018-11-28 11:48:44,300 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-11-28 11:48:44,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:48:44,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:48:44,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:48:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:44,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:44,359 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-11-28 11:48:44,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:44,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:44,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:48:44,843 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-11-28 11:48:44,849 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-11-28 11:48:44,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:44,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:44,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-28 11:48:46,319 WARN L180 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 11:48:48,388 WARN L180 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 11:48:51,057 WARN L180 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 11:48:53,280 WARN L180 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 11:48:53,285 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-11-28 11:48:53,289 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-11-28 11:48:53,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:53,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:53,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:53,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2018-11-28 11:48:53,704 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:53,705 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-11-28 11:48:53,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:53,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:53,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:53,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:53,801 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-11-28 11:48:53,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:53,882 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-11-28 11:48:53,886 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-11-28 11:48:53,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:53,895 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-11-28 11:48:53,895 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:53,904 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:53,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:53,961 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-11-28 11:48:53,965 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-11-28 11:48:53,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:53,973 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-11-28 11:48:53,973 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:53,979 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:53,987 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,006 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-11-28 11:48:54,007 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:88, output treesize:54 [2018-11-28 11:48:54,139 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-11-28 11:48:54,142 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-11-28 11:48:54,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,153 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-11-28 11:48:54,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,182 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-11-28 11:48:54,185 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-11-28 11:48:54,185 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,197 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-11-28 11:48:54,198 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,211 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-11-28 11:48:54,211 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:70, output treesize:22 [2018-11-28 11:48:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2018-11-28 11:48:54,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:48:54,431 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 11:48:54,646 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:54,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:56,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:56,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:57,056 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:57,080 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:57,558 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:57,572 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:57,791 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:57,811 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:58,007 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:58,029 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:48:58,154 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-11-28 11:48:58,154 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:190, output treesize:129 [2018-11-28 11:49:04,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:49:04,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2018-11-28 11:49:04,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 11:49:04,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 11:49:04,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1029, Unknown=9, NotChecked=198, Total=1332 [2018-11-28 11:49:04,735 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand 33 states. [2018-11-28 11:49:18,239 WARN L180 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-11-28 11:49:26,772 WARN L180 SmtUtils]: Spent 8.18 s on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-11-28 11:49:34,246 WARN L180 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-11-28 11:49:41,488 WARN L180 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-11-28 11:49:52,533 WARN L180 SmtUtils]: Spent 10.65 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-28 11:50:02,812 WARN L180 SmtUtils]: Spent 3.13 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-28 11:50:12,757 WARN L180 SmtUtils]: Spent 5.91 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 11:50:13,297 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 11:50:14,699 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-11-28 11:50:21,537 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-11-28 11:50:22,034 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-28 11:50:22,275 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-11-28 11:50:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:28,840 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2018-11-28 11:50:28,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 11:50:28,841 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2018-11-28 11:50:28,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:28,842 INFO L225 Difference]: With dead ends: 166 [2018-11-28 11:50:28,842 INFO L226 Difference]: Without dead ends: 166 [2018-11-28 11:50:28,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 96.9s TimeCoverageRelationStatistics Valid=208, Invalid=2137, Unknown=19, NotChecked=288, Total=2652 [2018-11-28 11:50:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-28 11:50:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2018-11-28 11:50:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-28 11:50:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2018-11-28 11:50:28,846 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 55 [2018-11-28 11:50:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:28,846 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2018-11-28 11:50:28,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 11:50:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2018-11-28 11:50:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:50:28,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:28,848 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-11-28 11:50:28,848 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:50:28,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:28,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1077922252, now seen corresponding path program 1 times [2018-11-28 11:50:28,848 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:50:28,848 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:50:28,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:28,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:29,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-11-28 11:50:29,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:50:29,054 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-11-28 11:50:29,056 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-11-28 11:50:29,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 11:50:29,089 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-11-28 11:50:29,091 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-11-28 11:50:29,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-28 11:50:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 11:50:29,123 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:50:29,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:29,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:50:29,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:50:29,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:50:29,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:50:29,125 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand 12 states. [2018-11-28 11:50:29,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:29,802 INFO L93 Difference]: Finished difference Result 170 states and 200 transitions. [2018-11-28 11:50:29,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:50:29,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-28 11:50:29,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:29,804 INFO L225 Difference]: With dead ends: 170 [2018-11-28 11:50:29,804 INFO L226 Difference]: Without dead ends: 170 [2018-11-28 11:50:29,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 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-11-28 11:50:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-28 11:50:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 142. [2018-11-28 11:50:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-28 11:50:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 168 transitions. [2018-11-28 11:50:29,807 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 168 transitions. Word has length 59 [2018-11-28 11:50:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:29,807 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 168 transitions. [2018-11-28 11:50:29,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:50:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 168 transitions. [2018-11-28 11:50:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:50:29,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:29,808 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-11-28 11:50:29,809 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:50:29,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1077922253, now seen corresponding path program 1 times [2018-11-28 11:50:29,809 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:50:29,809 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:50:29,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:29,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:29,992 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-11-28 11:50:29,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:50:30,057 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-11-28 11:50:30,059 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-11-28 11:50:30,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:30,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:30,076 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-11-28 11:50:30,078 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-11-28 11:50:30,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:30,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:30,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:30,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-11-28 11:50:30,123 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-11-28 11:50:30,125 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-11-28 11:50:30,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:30,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:30,134 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-11-28 11:50:30,135 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-11-28 11:50:30,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:30,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:30,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:30,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-28 11:50:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 11:50:30,172 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:50:30,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:30,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:50:30,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:50:30,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:50:30,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:50:30,175 INFO L87 Difference]: Start difference. First operand 142 states and 168 transitions. Second operand 12 states. [2018-11-28 11:50:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:30,986 INFO L93 Difference]: Finished difference Result 179 states and 207 transitions. [2018-11-28 11:50:30,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:50:30,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-28 11:50:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:30,987 INFO L225 Difference]: With dead ends: 179 [2018-11-28 11:50:30,987 INFO L226 Difference]: Without dead ends: 179 [2018-11-28 11:50:30,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:50:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-28 11:50:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 146. [2018-11-28 11:50:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-28 11:50:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2018-11-28 11:50:30,990 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 59 [2018-11-28 11:50:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:30,991 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2018-11-28 11:50:30,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:50:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2018-11-28 11:50:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:50:30,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:30,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, 1] [2018-11-28 11:50:30,992 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:50:30,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:30,992 INFO L82 PathProgramCache]: Analyzing trace with hash 630090838, now seen corresponding path program 1 times [2018-11-28 11:50:30,992 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:50:30,992 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:50:31,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:31,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:31,234 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-11-28 11:50:31,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:31,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:31,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:50:31,410 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-11-28 11:50:31,412 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-11-28 11:50:31,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:31,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:31,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:31,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-11-28 11:50:31,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:31,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:31,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:31,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 33 treesize of output 52 [2018-11-28 11:50:31,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 32 treesize of output 46 [2018-11-28 11:50:31,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:31,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:31,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:31,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:47 [2018-11-28 11:50:34,238 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-11-28 11:50:34,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:34,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:34,270 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:50:34,271 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-11-28 11:50:34,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:34,409 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-11-28 11:50:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-28 11:50:34,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:34,426 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-11-28 11:50:34,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:34,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:34,449 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:34,533 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-11-28 11:50:34,539 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-11-28 11:50:34,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:34,550 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-11-28 11:50:34,550 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:34,558 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:34,580 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:34,621 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-11-28 11:50:34,622 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:128, output treesize:124 [2018-11-28 11:50:34,769 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-11-28 11:50:34,776 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-11-28 11:50:34,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:34,792 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-11-28 11:50:34,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:34,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:34,838 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-11-28 11:50:34,838 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:137, output treesize:117 [2018-11-28 11:50:35,038 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-11-28 11:50:35,043 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-11-28 11:50:35,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,060 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-11-28 11:50:35,060 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,075 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-11-28 11:50:35,076 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:35,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:35,108 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-11-28 11:50:35,108 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:118, output treesize:50 [2018-11-28 11:50:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-11-28 11:50:35,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:50:35,789 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 11:50:35,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:35,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:36,017 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:36,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:36,048 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-11-28 11:50:36,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:68 [2018-11-28 11:50:53,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:53,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:50:53,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:53,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:53,213 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-11-28 11:50:53,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:53,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:53,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:50:53,298 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-11-28 11:50:53,300 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-11-28 11:50:53,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:53,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:53,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:53,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-11-28 11:50:53,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:53,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:53,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:53,340 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-11-28 11:50:53,344 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-11-28 11:50:53,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:53,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:53,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:53,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2018-11-28 11:50:53,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:53,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:53,901 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:50:53,902 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-11-28 11:50:53,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,042 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-11-28 11:50:54,050 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-11-28 11:50:54,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:54,063 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-11-28 11:50:54,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,090 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,177 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-11-28 11:50:54,182 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-11-28 11:50:54,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:54,191 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-11-28 11:50:54,191 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,200 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,221 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,264 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-11-28 11:50:54,264 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:127, output treesize:123 [2018-11-28 11:50:54,464 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-11-28 11:50:54,472 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-11-28 11:50:54,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,492 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-11-28 11:50:54,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,547 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-11-28 11:50:54,547 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:139, output treesize:119 [2018-11-28 11:50:54,994 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-11-28 11:50:54,999 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-11-28 11:50:54,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:55,020 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-11-28 11:50:55,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:55,037 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-11-28 11:50:55,038 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:55,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:55,070 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-11-28 11:50:55,071 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:120, output treesize:52 [2018-11-28 11:50:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-11-28 11:50:55,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:50:57,595 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 11:50:57,782 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:57,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:57,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:57,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:57,884 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-11-28 11:50:57,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:91 [2018-11-28 11:51:21,830 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 11:51:21,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:51:21,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 36 [2018-11-28 11:51:21,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-28 11:51:21,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 11:51:21,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1913, Unknown=14, NotChecked=88, Total=2162 [2018-11-28 11:51:21,847 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand 37 states. [2018-11-28 11:51:31,227 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-11-28 11:51:35,739 WARN L180 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-28 11:51:39,288 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-11-28 11:51:39,635 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-11-28 11:51:40,660 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-11-28 11:51:41,074 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2018-11-28 11:51:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:51:42,666 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2018-11-28 11:51:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:51:42,667 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 59 [2018-11-28 11:51:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:51:42,668 INFO L225 Difference]: With dead ends: 166 [2018-11-28 11:51:42,668 INFO L226 Difference]: Without dead ends: 166 [2018-11-28 11:51:42,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 63.7s TimeCoverageRelationStatistics Valid=293, Invalid=3355, Unknown=16, NotChecked=118, Total=3782 [2018-11-28 11:51:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-28 11:51:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 148. [2018-11-28 11:51:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-28 11:51:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-11-28 11:51:42,673 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 59 [2018-11-28 11:51:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:51:42,674 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-11-28 11:51:42,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-28 11:51:42,674 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-11-28 11:51:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:51:42,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:51:42,675 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-11-28 11:51:42,675 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 11:51:42,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:42,675 INFO L82 PathProgramCache]: Analyzing trace with hash 630090839, now seen corresponding path program 1 times [2018-11-28 11:51:42,676 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:51:42,676 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/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-11-28 11:51:42,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:51:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:42,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:51:42,973 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-11-28 11:51:42,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:42,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:42,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:51:42,992 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-11-28 11:51:42,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:42,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:42,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-11-28 11:51:43,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:43,144 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-11-28 11:51:43,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:43,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:43,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:41 [2018-11-28 11:51:43,269 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-11-28 11:51:43,272 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-11-28 11:51:43,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:43,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:43,303 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-11-28 11:51:43,305 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-11-28 11:51:43,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:43,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:43,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:43,328 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:71 [2018-11-28 11:51:43,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:43,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:43,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:43,585 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-11-28 11:51:43,588 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-11-28 11:51:43,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:43,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:43,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:43,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:70 [2018-11-28 11:51:46,328 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-11-28 11:51:46,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:46,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:46,352 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:51:46,353 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-11-28 11:51:46,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:46,488 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-11-28 11:51:46,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:46,659 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-11-28 11:51:46,666 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-11-28 11:51:46,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:46,679 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-11-28 11:51:46,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:46,691 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:46,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:46,822 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-11-28 11:51:46,829 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-11-28 11:51:46,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:46,840 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-11-28 11:51:46,840 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:46,849 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:46,867 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:46,925 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-11-28 11:51:46,926 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:161, output treesize:129 [2018-11-28 11:51:47,342 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-11-28 11:51:47,347 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-11-28 11:51:47,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:47,371 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-11-28 11:51:47,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:47,388 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-11-28 11:51:47,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:47,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:47,453 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-11-28 11:51:47,458 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-11-28 11:51:47,458 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:47,491 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-11-28 11:51:47,491 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:47,513 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-11-28 11:51:47,513 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:47,529 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:47,552 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-11-28 11:51:47,553 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:164, output treesize:37 [2018-11-28 11:51:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-28 11:51:47,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:51:48,878 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 11:51:49,020 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-28 11:51:49,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:49,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:50,053 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:50,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:50,952 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:50,997 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:51,509 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:51,536 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:51,984 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:52,023 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:52,252 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:52,280 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:52,520 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-11-28 11:51:52,520 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:240, output treesize:309 [2018-11-28 11:52:11,352 WARN L180 SmtUtils]: Spent 6.35 s on a formula simplification that was a NOOP. DAG size: 97 [2018-11-28 11:52:11,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:52:11,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24197e1-666f-445e-a378-d3ee5ea44c3b/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:52:11,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:11,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:52:11,428 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-11-28 11:52:11,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:52:11,529 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-11-28 11:52:11,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-11-28 11:52:11,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:11,565 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 12 treesize of output 15 [2018-11-28 11:52:11,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-11-28 11:52:11,587 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-11-28 11:52:11,590 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-11-28 11:52:11,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,621 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-11-28 11:52:11,624 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-11-28 11:52:11,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:71 [2018-11-28 11:52:11,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:11,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:11,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:11,681 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-11-28 11:52:11,685 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-11-28 11:52:11,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-11-28 11:52:13,924 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-28 11:52:14,125 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:52:14,126 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:928) 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) 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) ... 39 more [2018-11-28 11:52:14,128 INFO L168 Benchmark]: Toolchain (without parser) took 656931.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 938.0 MB in the beginning and 880.6 MB in the end (delta: 57.4 MB). Peak memory consumption was 204.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:14,128 INFO L168 Benchmark]: CDTParser took 0.16 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-11-28 11:52:14,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:14,129 INFO L168 Benchmark]: Boogie Preprocessor took 43.48 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:14,129 INFO L168 Benchmark]: RCFGBuilder took 487.44 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:14,129 INFO L168 Benchmark]: TraceAbstraction took 656014.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.7 MB). Free memory was 1.1 GB in the beginning and 880.6 MB in the end (delta: 181.4 MB). Peak memory consumption was 196.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:14,130 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.16 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 383.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.48 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 487.44 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 656014.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.7 MB). Free memory was 1.1 GB in the beginning and 880.6 MB in the end (delta: 181.4 MB). Peak memory consumption was 196.0 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...